Computer Aided Verification

Volume 2102 of the series Lecture Notes in Computer Science pp 53-65


Fast LTL to Büchi Automata Translation

  • Paul GastinAffiliated withLIAFA, Université Paris
  • , Denis OddouxAffiliated withLIAFA, Université Paris

* Final gross prices may vary according to local VAT.

Get Access


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: