A hierarchy of temporal properties (invited paper, 1989)
PODC '90 Proceedings of the ninth annual ACM symposium on Principles of distributed computing
Efficient minimization of deterministic weak &ohgr;-automata
Information Processing Letters
From States to Transitions: Improving Translation of LTL Formulae to Büchi Automata
FORTE '02 Proceedings of the 22nd IFIP WG 6.1 International Conference Houston on Formal Techniques for Networked and Distributed Systems
CONCUR '00 Proceedings of the 11th International Conference on Concurrency Theory
On-the-Fly Verification of Linear Temporal Logic
FM '99 Proceedings of the Wold Congress on Formal Methods in the Development of Computing Systems-Volume I - Volume I
Improved Automata Generation for Linear Temporal Logic
CAV '99 Proceedings of the 11th International Conference on Computer Aided Verification
Efficient Büchi Automata from LTL Formulae
CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
Fast LTL to Büchi Automata Translation
CAV '01 Proceedings of the 13th International Conference on Computer Aided Verification
SPOT: An Extensible Model Checking Library Using Transition-Based Generalized Büchi Automata
MASCOTS '04 Proceedings of the The IEEE Computer Society's 12th Annual International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunications Systems
The temporal logic of programs
SFCS '77 Proceedings of the 18th Annual Symposium on Foundations of Computer Science
Minimal Büchi Automata for Certain Classes of LTL Formulas
DEPCOS-RELCOMEX '09 Proceedings of the 2009 Fourth International Conference on Dependability of Computer Systems
CIAA'03 Proceedings of the 8th international conference on Implementation and application of automata
Proceedings of the 14th international SPIN conference on Model checking software
Mechanizing the powerset construction for restricted classes of ω-automata
ATVA'07 Proceedings of the 5th international conference on Automated technology for verification and analysis
On the virtue of patience: minimizing Büchi automata
SPIN'10 Proceedings of the 17th international SPIN conference on Model checking software
LTL translation improvements in spot
VECoS'11 Proceedings of the Fifth international conference on Verification and Evaluation of Computer and Communication Systems
Rabinizer: small deterministic automata for LTL (F,G)
ATVA'12 Proceedings of the 10th international conference on Automated Technology for Verification and Analysis
PARTY: parameterized synthesis of token rings
CAV'13 Proceedings of the 25th international conference on Computer Aided Verification
On the relationship between LTL normal forms and Büchi automata
Theories of Programming and Formal Methods
LTL receding horizon control for finite deterministic systems
Automatica (Journal of IFAC)
LTL translation improvements in Spot 1.0
International Journal of Critical Computer-Based Systems
| Hi-index | 0.00 |
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.