2010-11-03 23:53:14 +01:00
1. LICENSE
LTL2BA - Version 1.0 - October 2001
Written by Denis Oddoux, LIAFA, France
Copyright (c) 2001 Denis Oddoux
LTL2BA - Version 1.1 - August 2007
Modified by Paul Gastin, LSV, France
Copyright (c) 2007 Paul Gastin
Available at http://www.lsv.ens-cachan.fr/~gastin/ltl2ba
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
The LTL2BA software was written by Denis Oddoux and modified by Paul
Gastin. It is based on the translation algorithm presented at CAV '01:
P.Gastin and D.Oddoux
2020-10-25 12:19:48 +01:00
"Fast LTL to Büchi Automata Translation"
2010-11-03 23:53:14 +01:00
in 13th International Conference on Computer Aided Verification, CAV 2001,
G. Berry, H. Comon, A. Finkel (Eds.)
Paris, France, July 18-22, 2001,
Proceedings - LNCS 2102, pp. 53-65
Send bug-reports and/or questions to Paul Gastin
http://www.lsv.ens-cachan.fr/~gastin
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
2020-10-25 12:19:48 +01:00
Using autotools:
> autoconf -i -f
> ./configure
> make
2010-11-03 23:53:14 +01:00
2020-10-25 12:19:48 +01:00
Using CMake
> mkdir build && cd build
> cmake ..
2010-11-03 23:53:14 +01:00
> make
2020-10-25 12:19:48 +01:00
3. EXECUTING AND TESTING
2010-11-03 23:53:14 +01:00
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
2020-10-25 12:19:48 +01:00
To test, simply use a command with a formula such as:
> ./ltl2ba -f "a U b"
2010-11-03 23:53:14 +01:00
4. CHANGES IN VERSION 1.1
- fixing a bug in the way sets were used for strongly connected components. Thanks to Joachim Klein (klein@tcs.inf.tu-dresden.de) who found the bug and proposed a patch to fix it.
2020-10-25 12:19:48 +01:00
- fixing a bug in the simplification with strongly connected components for the generalized Büchi automaton.
- improving the simplification with strongly connected components for the generalized Büchi automaton.
2010-11-03 23:53:14 +01:00
- using getrusage to compute running times for the statistics
- some other minor updates.
