LTL to Büchi Automata Translation: Fast and More Deterministic
arXiv:1201.0682
Abstract
We introduce improvements in the algorithm by Gastin and Oddoux translating LTL formulae into Büchi automata via very weak alternating co-Büchi automata and generalized Büchi automata. Several improvements are based on specific properties of any formula where each branch of its syntax tree contains at least one eventually operator and at least one always operator. These changes usually result in faster translations and smaller automata. Other improvements reduce non-determinism in the produced automata. In fact, we modified all the steps of the original algorithm and its implementation known as LTL2BA. Experimental results show that our modifications are real improvements. Their implementations within an LTL2BA translation made LTL2BA very competitive with the current version of SPOT, sometimes outperforming it substantially.
Full version of the paper presented at TACAS 2012
Cited by in corpus (7)
- Parameterized Synthesis Case Study: AMBA AHB
- Parameterized Synthesis Case Study: AMBA AHB (extended version)
- The 3rd Reactive Synthesis Competition (SYNTCOMP 2016): Benchmarks, Participants & Results
- Improving HyLTL model checking of hybrid systems
- Assume-Guarantee Synthesis for Concurrent Reactive Programs with Partial Information
- Synthesis of coordination programs from linear temporal logic
- Bounded Cycle Synthesis