Fast LTL to Büchi Automata Translation
Top Cited Papers
- 4 July 2001
- book chapter
- Published by Springer Nature
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Weak alternating automata are not that weakPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Optimizing Büchi AutomataPublished by Springer Nature ,2000
- Efficient Büchi Automata from LTL FormulaePublished by Springer Nature ,2000
- Improved Automata Generation for Linear Temporal LogicPublished by Springer Nature ,1999
- The model checker SPINIEEE Transactions on Software Engineering, 1997
- Simple On-the-fly Automatic Verification of Linear Temporal LogicPublished by Springer Nature ,1996
- An automata-theoretic approach to linear temporal logicPublished by Springer Nature ,1996
- Simulating alternating tree automata by nondeterministic automata: New results and new proofs of the theorems of Rabin, McNaughton and SafraTheoretical Computer Science, 1995
- Alternating automata on infinite treesTheoretical Computer Science, 1987