Abstract
While many applications of automata in formal methods can use nondeterministic automata, some applications, most notably synthesis, need deterministic or good-for-games automata. The latter are nondeterministic automata that can resolve their nondeterministic choices in a way that only depends on the past. The minimization problem for nondeterministic and deterministic Büchi and co-Büchi word automata are PSPACE-complete and NP-complete, respectively. We describe a polynomial minimization algorithm for good-for-games co-Büchi word automata with transition-based acceptance. Thus, a run is accepting if it traverses a set of designated transitions only finitely often. Our algorithm is based on a sequence of transformations we apply to the automaton, on top of which a minimal quotient automaton is defined.
Original language | English |
---|---|
Title of host publication | 46th International Colloquium on Automata, Languages, and Programming, ICALP 2019 |
Editors | Christel Baier, Ioannis Chatzigiannakis, Paola Flocchini, Stefano Leonardi |
Publisher | Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing |
ISBN (Electronic) | 9783959771092 |
DOIs | |
State | Published - 1 Jul 2019 |
Event | 46th International Colloquium on Automata, Languages, and Programming, ICALP 2019 - Patras, Greece Duration: 9 Jul 2019 → 12 Jul 2019 |
Publication series
Name | Leibniz International Proceedings in Informatics, LIPIcs |
---|---|
Volume | 132 |
ISSN (Print) | 1868-8969 |
Conference
Conference | 46th International Colloquium on Automata, Languages, and Programming, ICALP 2019 |
---|---|
Country/Territory | Greece |
City | Patras |
Period | 9/07/19 → 12/07/19 |
Bibliographical note
Publisher Copyright:© Bader Abu Radi and Orna Kupferman; licensed under Creative Commons License CC-BY
Keywords
- Deterministic co-Büchi Automata
- Minimization