Write a Blog >>
APLAS 2019
Sun 1 - Wed 4 December 2019 Bali, Indonesia
Wed 4 Dec 2019 11:00 - 11:30 at Bali Room - Logic and Automata Chair(s): Peter Thiemann

Complementation of Buchi automata is an essential technique used in a number of approaches for termination analysis of programs. The long search for an optimal complementation construction climaxed with the work of Schewe, who proposed a worst-case optimal rank-based procedure that generates complements of a size matching the theoretical lower bound of (0.76n)^n, modulo a polynomial factor of O(n^2). Although worst-case optimal, the procedure in many cases produces automata that are unnecessarily large. In this paper, we propose several novel ways of how to use the direct and delayed simulation relations to reduce the size of the automaton obtained in the rank-based complementation procedure. Our techniques are based on either (i) ignoring macrostates that cannot be used for accepting a word in the complement or (ii) saturating macrostates with simulation-smaller states, in order to decrease their total number. We experimentally showed that our techniques can indeed considerably decrease the size of the output of the complementation.

Wed 4 Dec
Times are displayed in time zone: Beijing, Chongqing, Hong Kong, Urumqi change

10:30 - 12:00: Logic and AutomataResearch Papers at Bali Room
Chair(s): Peter ThiemannUniversity of Freiburg, Germany
10:30 - 11:00
Research Papers
Aquinas HoborNational University of Singapore, Singapore, Elaine LiRuntime Verification, Inc., Frank StephanNational University of Singapore
11:00 - 11:30
Research Papers
Yu-Fang ChenAcademia Sinica, Vojtěch HavlenaBrno University of Technology, Ondřej LengálBrno University of Technology
11:30 - 12:00
Research Papers
Lukáš HolíkBrno University of Technology, Tomáš VojnarBrno University of Technology, Ondřej LengálBrno University of Technology , Lenka TuroňováBrno University of Technology, Margus VeanesMicrosoft Research, Olli Saarikivi