License
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.ICALP.2019.100
URN: urn:nbn:de:0030-drops-106761
URL: http://drops.dagstuhl.de/opus/volltexte/2019/10676/
Go to the corresponding LIPIcs Volume Portal


Abu Radi, Bader ; Kupferman, Orna

Minimizing GFG Transition-Based Automata

pdf-format:
LIPIcs-ICALP-2019-100.pdf (0.5 MB)


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.

BibTeX - Entry

@InProceedings{aburadi_et_al:LIPIcs:2019:10676,
  author =	{Bader Abu Radi and Orna Kupferman},
  title =	{{Minimizing GFG Transition-Based Automata}},
  booktitle =	{46th International Colloquium on Automata, Languages, and Programming (ICALP 2019)},
  pages =	{100:1--100:16},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-109-2},
  ISSN =	{1868-8969},
  year =	{2019},
  volume =	{132},
  editor =	{Christel Baier and Ioannis Chatzigiannakis and Paola Flocchini and Stefano Leonardi},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2019/10676},
  URN =		{urn:nbn:de:0030-drops-106761},
  doi =		{10.4230/LIPIcs.ICALP.2019.100},
  annote =	{Keywords: Minimization, Deterministic co-B{\"u}chi Automata}
}

Keywords: Minimization, Deterministic co-Büchi Automata
Seminar: 46th International Colloquium on Automata, Languages, and Programming (ICALP 2019)
Issue Date: 2019
Date of publication: 08.07.2019


DROPS-Home | Imprint | Privacy Published by LZI