2001 | OriginalPaper | Buchkapitel
Fair Simulation Relations, Parity Games, and State Space Reduction for Büchi Automata
verfasst von : Kousha Etessami, Thomas Wilke, Rebecca A. Schuller
Erschienen in: Automata, Languages and Programming
Verlag: Springer Berlin Heidelberg
Enthalten in: Professional Book Archive
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
We give efficient algorithms, beating or matching optimal known bounds, for computing a variety of simulation relations on the state space of a Büchi automaton. Our algorithms are derived via a unified and simple parity-game framework. This framework incorporates previously studied notions like fair and direct simulation, but our main motivation is state space reduction, and for this purpose we introduce a new natural notion of simulation, called delayed simulation. We show that, unlike fair simulation, delayed simulation preserves the automaton language upon quotienting, and that it allows substantially better state reduction than direct simulation.We use the parity-game approach, based on a recent algorithm by Jurdzinski, to efficiently compute all the above simulation relations. In particular, we obtain an O(mn3)-time and O(mn)-space algorithm for computing both the delayed and fair simulation relations. The best prior algorithm for fair simulation requires time O(n6) ([HKR97]).Our framework also allows one to compute bisimulations efficiently: we compute the fair bisimulation relation in O(mn3) time and O(mn) space, whereas the best prior algorithm for fair bisimulation requires time O(n10) ([HR00]).