Name
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. |
Year | DOI | Venue |
|---|---|---|
2012 | 10.1007/978-3-642-28756-5_8 | tools and algorithms for construction and analysis of systems |
Keywords | DocType | Volume |
real improvement,smaller automaton,generalized b,ltl2ba translation,chi automata translation,faster translation,ltl formula,current version,chi automaton,original algorithm,linear temporal logic,buchi automata | Conference | abs/1201.0682 |
ISSN | Citations | PageRank |
0302-9743 | 47 | 1.48 |
References | Authors | |
11 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Tomáš Babiak | 1 | 90 | 3.70 |
| Mojmír Křetínský | 2 | 56 | 3.62 |
| Vojtěch Řehák | 3 | 68 | 5.99 |
| Jan Strejček | 4 | 79 | 8.12 |