11. LICENSE 2 3LTL2BA - Version 1.0 - October 2001 4Written by Denis Oddoux, LIAFA, France 5Copyright (c) 2001 Denis Oddoux 6 7LTL2BA - Version 1.1 - August 2007 8Modified by Paul Gastin, LSV, France 9Copyright (c) 2007 Paul Gastin 10Available at http://www.lsv.ens-cachan.fr/~gastin/ltl2ba 11 12LTL2BA - Version 1.2 - May 2018 13Modified by Paul Gastin, LSV, France 14Copyright (c) 2018 Paul Gastin 15Available at http://www.lsv.ens-cachan.fr/~gastin/ltl2ba 16 17LTL2BA - Version 1.3 - June 2020 18Modified by Paul Gastin, LSV, France 19Copyright (c) 2018 Paul Gastin 20Available at http://www.lsv.ens-cachan.fr/~gastin/ltl2ba 21 22This program is free software; you can redistribute it and/or modify 23it under the terms of the GNU General Public License as published by 24the Free Software Foundation; either version 2 of the License, or 25(at your option) any later version. GNU GPL is included in this 26distribution, in a file called 'LICENSE' 27 28This program is distributed in the hope that it will be useful, 29but WITHOUT ANY WARRANTY; without even the implied warranty of 30MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 31GNU General Public License for more details. 32 33You should have received a copy of the GNU General Public License 34along with this program; if not, write to the Free Software 35Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA 36 37The LTL2BA software was written by Denis Oddoux and modified by Paul 38Gastin. It is based on the translation algorithm presented at CAV '01: 39 P.Gastin and D.Oddoux 40 "Fast LTL to B�chi Automata Translation" 41 in 13th International Conference on Computer Aided Verification, CAV 2001, 42 G. Berry, H. Comon, A. Finkel (Eds.) 43 Paris, France, July 18-22, 2001, 44 Proceedings - LNCS 2102, pp. 53-65 45 46Send bug-reports and/or questions to Paul Gastin 47http://www.lsv.ens-cachan.fr/~gastin 48 49Part of the code included is issued from the SPIN software Version 3.4.1 50The SPIN software is written by Gerard J. Holzmann, originally as part 51of ``Design and Validation of Protocols,'' ISBN 0-13-539925-4, 521991, Prentice Hall, Englewood Cliffs, NJ, 07632 53Here are the files that contain some code from Spin v3.4.1 : 54 55 cache.c (originally tl_cache.c) 56 lex.c ( tl_lex.c ) 57 ltl2ba.h ( tl.h ) 58 main.c ( tl_main.c ) 59 mem.c. ( tl_mem.c ) 60 parse.c ( tl_parse.c) 61 rewrt.c ( tl_rewrt.c) 62 trans.c ( tl_trans.c) 63 642. COMPILING 65 66open the archive : 67> tar -xzf ltl2ba-1.3.tar.gz 68> cd ltl2ba-1.3 69 70compile the program 71> make 72 733. EXECUTING 74 75run the program 76> ./ltl2ba -f 'formula' 77 78The formula is an LTL formula, and may contain propositional symbols, 79boolean operators, temporal operators, and parentheses. 80The syntax used is the one used in the 'Spin' model-checker 81 82Propositonal Symbols: 83 true, false 84 any lowercase string 85 86Boolean operators: 87 ! (negation) 88 -> (implication) 89 <-> (equivalence) 90 && (and) 91 || (or) 92 93Temporal operators: 94 [] (always) 95 <> (eventually) 96 U (until) 97 V (release) 98 X (next) 99 100Use spaces between any symbols. 101 102The result is a never claim in Promela that can be given to the 103Spin model checker to verify properties on a system. 104 105run the command 106> ./ltl2ba 107to see the possible options for executing the program 108 1094. CHANGES IN VERSION 1.1 110 111- 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. 112- fixing a bug in the simplification with strongly connected components for the generalized B�chi automaton. 113- improving the simplification with strongly connected components for the generalized B�chi automaton. 114- using getrusage to compute running times for the statistics 115- some other minor updates. 116 1175. CHANGES IN VERSION 1.3 118 119Thanks to Jerry James for the patches addressing the following issues 120- compatibility with gcc 10 (link-time failure for identically named 121variables in different files) 122- Remove unused function and variable declarations 123- Make (f)printf format declarations match the types of the corresponding expressions 124- Remove the second argument to Fatal(), fatal() and non_fatal(), since it is always NULL 125- Make main() return something (since it is supposed to return int) 126 127