International Conference on Computer Aided Verification

CAV 2001: Computer Aided Verification pp 53-65

Fast LTL to Büchi Automata Translation

  • Paul Gastin
  • Denis Oddoux
Conference paper

DOI: 10.1007/3-540-44585-4_6

Volume 2102 of the book series Lecture Notes in Computer Science (LNCS)
Cite this paper as:
Gastin P., Oddoux D. (2001) Fast LTL to Büchi Automata Translation. In: Berry G., Comon H., Finkel A. (eds) Computer Aided Verification. CAV 2001. Lecture Notes in Computer Science, vol 2102. Springer, Berlin, Heidelberg

Abstract

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: http://verif.liafa.jussieu.fr/ltl2ba

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2001

Authors and Affiliations

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