Fast LTL to büchi automata translation

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2102, Issue , 2001, Pages 53-65

  Gastin, Paul ^a   Oddoux, Denis ^a  

^a UNIVERSITÉ PARIS DIDEROT   (France)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; COMPUTER AIDED ANALYSIS;

BUCHI AUTOMATA; LTL FORMULAE; ON THE FLIES;

ALGORITHMS;

EID: 84958741847     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44585-4_6     Document Type: Conference Paper

References (12)

1. M. Daniele, F. Giunchiglia, and M. Vardi. Improved automata generation for linear temporal logic. In Proc. 11th International Computer Aided Verification Conference, pages 249-260, 1999.
2. K. Etessami and G. Holzmann. Optimizing Buchi automata. In Proceedings of 11th Int. Conf. on Concurrency Theory (CONCUR), 2000.
3. R. Gerth, D. Peled, M. Vardi, and P. Wolper. Simple on-the-fly automatic verification of linear temporal logic. In Protocol Specification Testing and Verification, pages 3-18, Warsaw, Poland, 1995. Chapman & Hall.
4. G. Holzmann. The model checker SPIN. IEEE Transactions on Software Engineering, 23(5):279-295, May 1997.
5. O. Kupferman and M. Vardi. Weak alternating automata are not that weak. In Proc. 5th Israeli Symposium on Theory of Computing and Systems ISTCS'97, pages 147-158. IEEE, 1997.
6. D. Muller and P. Schupp. Alternating automata on infinite objects: Determinacy and Rabin's theorem. In Proceedings of the Ecole de Printemps d'Informatique Theoretique on Automata on Infinite Words, volume 192 of LNCS, pages 100-107, Le Mont Dore, France, May 1984. Springer.
7. D. Muller and P. Schupp. Alternating automata on infinite trees. Theoretical Computer Science, 54(2-3):267-276, October 1987.
8. D. Muller and P. Schupp. Simulating alternating tree automata by nondeterminis-tic automata: New results and new proofs of the theorems of Rabin, McNaughton and Safra. Theoretical Computer Science, 141(1-2):69-107, April 1995.
9. S. Rohde. Alternating automata and the temporal logic of ordinals. PhD Thesis in Mathematics, University of Illinois at Urbana-Champaign, 1997.
10. F. Somenzi and R. Bloem. Efficient Buchi automata from LTL formulae. In CAV: International Conference on Computer Aided Verification, 2000.
11. H. Tauriainen. A randomized testbench for algorithms translating linear temporal logic formulae into Buchi automata. In Workshop Concurrency, Specifications and Programming, pages 251-262, Warsaw, Poland, 1999.
12. M. Vardi. An Automata-Theoretic Approach to Linear Temporal Logic, volume 1043 of Lecture Notes in Computer Science, pages 238-266. Springer-Verlag Inc., New York, NY, USA, 1996.