Abstract
Büchi automata (non-deterministic automata on infinite words with a simple acceptance condition) play a central rôle in model checking when properties are specified in temporal logic and state spaces are represented explicitly. Model checking then amounts to a graph search in a product of a transition system with a Büchi automaton that represents the specification. From a practical perspective it is therefore important to have procedures at hand which minimize the automata involved if possible. As computing–even approximating–minimum-state automata is PSPACE-hard, heuristics are applied. In the talk, a technique that is frequently used in current heuristics is presented: state-space reductions via simulation relations.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wilke, T. (2003). Minimizing Automata on Infinite Words. In: Vardi, M.Y., Voronkov, A. (eds) Logic for Programming, Artificial Intelligence, and Reasoning. LPAR 2003. Lecture Notes in Computer Science(), vol 2850. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-39813-4_20
Download citation
DOI: https://doi.org/10.1007/978-3-540-39813-4_20
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20101-4
Online ISBN: 978-3-540-39813-4
eBook Packages: Springer Book Archive