Publication details
LTL to Büchi Automata: Improved Once Again
| Authors | |
|---|---|
| Year of publication | 2010 |
| Type | Appeared in Conference without Proceedings |
| MU Faculty or unit | |
| 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: |