Abstract
Buchi automata (non-deterministic automata on infinite words with a simple acceptance condition) play a central role 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 Buchi 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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
