LTL to Büchi Automata: Improved Once Again

Warning

This publication doesn't include Faculty of Education. It includes Faculty of Informatics. Official publication website can be found on muni.cz.
Authors

BABIAK Tomáš

Year of publication 2010
Type Appeared in Conference without Proceedings
MU Faculty or unit

Faculty of Informatics

Citation
Description We present an improvement of an algorithm translating LTL formulae into Büchi automata via alternating automata. In particular, we improve the transformation of alternating Büchi automata to generalized Büchi automata, where we temporarily ignore some transitions leading from the alternating automata states corresponding to subformulae that are prefix-invariant, that can lead to a faster translation.
Related projects:

You are running an old browser version. We recommend updating your browser to its latest version.