Fast LTL to Büchi Automata Translation

  • Paul Gastin
  • Denis Oddoux
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2102)


We present an algorithm to generate Büchi automata from LTL formulae. This algorithm generates a very weak alternating co-Büchi automaton and then transforms it into a Büchi automaton, using a generalized Büchi automaton as an intermediate step. Each automaton is simplified on-the-fly in order to save memory and time. As usual we simplify the LTL formula before any treatment. We implemented this algorithm and compared it with Spin: the experiments show that our algorithm is much more efficient than Spin. The criteria of comparison are the size of the resulting automaton, the time of the computation and the memory used. Our implementation is available on the web at the following address:


Model Checker Transition Function Linear Temporal Logic Atomic Proposition Acceptance Condition 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


  1. 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.Google Scholar
  2. 2.
    K. Etessami and G. Holzmann. Optimizing Büchi automata. In Proceedings of 11th Int. Conf. on Concurrency Theory (CONCUR), 2000.Google Scholar
  3. 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.Google Scholar
  4. 4.
    G. Holzmann. The model checker SPIN. IEEE Transactions on Software Engineering, 23(5):279–295, May 1997.CrossRefMathSciNetGoogle Scholar
  5. 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.Google Scholar
  6. 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 Théoretique on Automata on Infinite Words, volume 192 of LNCS, pages 100–107, Le Mont Dore, France, May 1984. Springer.Google Scholar
  7. 7.
    D. Muller and P. Schupp. Alternating automata on infinite trees. Theoretical Computer Science, 54(2–3):267–276, October 1987.zbMATHCrossRefMathSciNetGoogle Scholar
  8. 8.
    D. Muller and P. Schupp. Simulating alternating tree automata by nondeterministic automata: New results and new proofs of the theorems of Rabin, McNaughton and Safra. Theoretical Computer Science, 141(1–2):69–107, April 1995.zbMATHCrossRefMathSciNetGoogle Scholar
  9. 9.
    S. Rohde. Alternating automata and the temporal logic of ordinals. PhD Thesis in Mathematics, University of Illinois at Urbana-Champaign, 1997.Google Scholar
  10. 10.
    F. Somenzi and R. Bloem. Efficient Büchi automata from LTL formulae. In CAV: International Conference on Computer Aided Verification, 2000.Google Scholar
  11. 11.
    H. Tauriainen. A randomized testbench for algorithms translating linear temporal logic formulae into Büchi automata. In Workshop Concurrency, Specifications and Programming, pages 251–262, Warsaw, Poland, 1999.Google Scholar
  12. 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.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2001

Authors and Affiliations

  • Paul Gastin
    • 1
  • Denis Oddoux
    • 1
  1. 1.LIAFAUniversité ParisParisFrance

Personalised recommendations