1. LICENSE LTL2BA - Version 1.0 - October 2001 Written by Denis Oddoux, LIAFA, France Copyright (c) 2001 Denis Oddoux This program is free software; you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation; either version 2 of the License, or (at your option) any later version. GNU GPL is included in this distribution, in a file called 'LICENSE' This program is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. You should have received a copy of the GNU General Public License along with this program; if not, write to the Free Software Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA Based on the translation algorithm by Gastin and Oddoux, presented at the CAV Conference, held in 2001, Paris, France 2001. Send bug-reports and/or questions to: ltl2ba@liafa.jussieu.fr or to Denis Oddoux LIAFA, UMR 7089, case 7014 Universite Paris 7 2, place Jussieu F-75251 Paris Cedex 05 FRANCE The LTL2BA software is written by Denis Oddoux, the algorithm it uses was published in : G. Berry, H. Comon, A. Finkel (Eds.): Computer Aided Verification 13th International Conference, CAV 2001, Paris, France, July 18-22, 2001, Proceedings - LNCS 2102 "Fast LTL to Büchi Automata Translation", P.Gastin and D.Oddoux, pp. 53-65 Part of the code included is issued from the SPIN software Version 3.4.1 The SPIN software is written by Gerard J. Holzmann, originally as part of ``Design and Validation of Protocols,'' ISBN 0-13-539925-4, 1991, Prentice Hall, Englewood Cliffs, NJ, 07632 Here are the files that contain some code from Spin v3.4.1 : cache.c (originally tl_cache.c) lex.c ( tl_lex.c ) ltl2ba.h ( tl.h ) main.c ( tl_main.c ) mem.c ( tl_mem.c ) parse.c ( tl_parse.c) rewrt.c ( tl_rewrt.c) trans.c ( tl_trans.c) 2. COMPILING open the archive : > gunzip ltl2ba.tar.gz > tar xf ltl2ba.tar > cd ltl2ba compile the program > make 3. EXECUTING run the program > ./ltl2ba -f "formula" The formula is an LTL formula, and may contain propositional symbols, boolean operators, temporal operators, and parentheses. The syntax used is the one used in the 'Spin' model-checker Propositonal Symbols: true, false any lowercase string Boolean operators: ! (negation) -> (implication) <-> (equivalence) && (and) || (or) Temporal operators: [] (always) <> (eventually) U (until) V (release) X (next) Use spaces between any symbols. The result is a never claim in Promela that can be given to the Spin model checker to verify properties on a system. run the command > ./ltl2ba to see the possible options for executing the program For more details, read the following paper G. Berry, H. Comon, A. Finkel (Eds.): Computer Aided Verification 13th International Conference, CAV 2001, Paris, France, July 18-22, 2001, Proceedings - LNCS 2102 "Fast LTL to Büchi Automata Translation", P.Gastin and D.Oddoux, pp. 53-65 This tool is also available on-line, at the following address : http://verif.liafa.jussieu.fr/ltl2ba