This translator algorithm is seldom used in practice because we work with explicit automata everywhere, and this is only useful to build symbolic automata. Furthermore, the symbolic automata produced by this algorithm are larger (when looked at explicitly) than those produced by ltl2tgba_fm or other explicit translators. The nice side effect of this removal is that we can also remove a lot of supporting classes, that were relying a lot on BDDs. * src/tgba/public.hh, src/tgba/statebdd.cc, src/tgba/statebdd.hh, src/tgba/succiterconcrete.cc, src/tgba/succiterconcrete.hh, src/tgba/tgbabddconcrete.cc, src/tgba/tgbabddconcrete.hh, src/tgba/tgbabddconcretefactory.cc, src/tgba/tgbabddconcretefactory.hh, src/tgba/tgbabddconcreteproduct.cc, src/tgba/tgbabddconcreteproduct.hh, src/tgba/tgbabddcoredata.cc, src/tgba/tgbabddcoredata.hh, src/tgba/tgbabddfactory.hh, src/tgbaalgos/ltl2tgba_lacim.cc, src/tgbaalgos/ltl2tgba_lacim.hh, src/tgbatest/bddprod.test, src/tgbatest/mixprod.cc, src/tgbatest/mixprod.test: Delete all these files. * bench/ltlcounter/Makefile.am, bench/ltlcounter/README, bench/ltlcounter/plot.gnu, bench/ltlcounter/run, src/tgba/Makefile.am, src/tgbaalgos/Makefile.am, src/tgbatest/Makefile.am, src/tgbatest/cycles.test, src/tgbatest/dupexp.test, src/tgbatest/emptchk.test, src/tgbatest/ltl2tgba.cc, src/tgbatest/ltl2tgba.test, src/tgbatest/ltlcross.test, src/tgbatest/ltlprod.cc, src/tgbatest/spotlbtt.test, src/tgbatest/wdba.test, src/tgbatest/wdba2.test, src/tgba/tgbaexplicit.hh, wrap/python/ajax/ltl2tgba.html, wrap/python/ajax/spot.in, wrap/python/spot.i, wrap/python/tests/interdep.py, wrap/python/tests/ltl2tgba.py, wrap/python/tests/ltl2tgba.test: Adjust.
127 lines
3.2 KiB
Python
Executable file
127 lines
3.2 KiB
Python
Executable file
# -*- mode: python; coding: utf-8 -*-
|
|
# Copyright (C) 2009, 2010, 2012, 2014 Laboratoire de Recherche et
|
|
# Développement de l'Epita (LRDE).
|
|
# Copyright (C) 2003, 2004 Laboratoire d'Informatique de Paris 6 (LIP6),
|
|
# département Systèmes Répartis Coopératifs (SRC), Université Pierre
|
|
# et Marie Curie.
|
|
#
|
|
# This file is part of Spot, a model checking library.
|
|
#
|
|
# Spot 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 3 of the License, or
|
|
# (at your option) any later version.
|
|
#
|
|
# Spot 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, see <http://www.gnu.org/licenses/>.
|
|
|
|
# This is a python translation of the ltl2tgba C++ test program.
|
|
# Compare with src/tgbatest/ltl2tgba.cc.
|
|
|
|
import sys
|
|
import getopt
|
|
import spot
|
|
|
|
def usage(prog):
|
|
sys.stderr.write("""Usage: %s [OPTIONS...] formula
|
|
|
|
Options:
|
|
-d turn on traces during parsing
|
|
-D degeneralize the automaton
|
|
-f use Couvreur's FM algorithm for translation
|
|
-t display reachable states in LBTT's format
|
|
-T use ltl2taa for translation
|
|
-v display the BDD variables used by the automaton
|
|
""" % prog)
|
|
sys.exit(2)
|
|
|
|
|
|
prog = sys.argv[0]
|
|
try:
|
|
opts, args = getopt.getopt(sys.argv[1:], 'dDftTv')
|
|
except getopt.GetoptError:
|
|
usage(prog)
|
|
|
|
exit_code = 0
|
|
debug_opt = False
|
|
degeneralize_opt = None
|
|
output = 0
|
|
fm_opt = 0
|
|
taa_opt = 0
|
|
|
|
for o, a in opts:
|
|
if o == '-d':
|
|
debug_opt = True
|
|
elif o == '-D':
|
|
degeneralize_opt = 1
|
|
elif o == '-f':
|
|
fm_opt = 1
|
|
elif o == '-t':
|
|
output = 6
|
|
elif o == '-T':
|
|
taa_opt = 1
|
|
elif o == '-v':
|
|
output = 5
|
|
else:
|
|
usage(prog)
|
|
|
|
if len(args) != 1:
|
|
usage(prog)
|
|
|
|
|
|
cout = spot.get_cout()
|
|
cerr = spot.get_cerr()
|
|
|
|
e = spot.default_environment.instance()
|
|
p = spot.empty_parse_error_list()
|
|
|
|
f = spot.parse(args[0], p, e, debug_opt)
|
|
if spot.format_parse_errors(cerr, args[0], p):
|
|
exit_code = 1
|
|
|
|
dict = spot.bdd_dict()
|
|
|
|
if f:
|
|
if fm_opt:
|
|
a = spot.ltl_to_tgba_fm(f, dict)
|
|
concrete = 0
|
|
elif taa_opt:
|
|
a = concrete = spot.ltl_to_taa(f, dict)
|
|
else:
|
|
assert "unspecified translator"
|
|
f.destroy()
|
|
del f
|
|
|
|
degeneralized = None
|
|
if degeneralize_opt:
|
|
a = degeneralized = spot.tgba_tba_proxy(a)
|
|
|
|
if output == 0:
|
|
spot.dotty_reachable(cout, a)
|
|
elif output == 5:
|
|
a.get_dict().dump(cout)
|
|
elif output == 6:
|
|
spot.lbtt_reachable(cout, a)
|
|
else:
|
|
assert "unknown output option"
|
|
|
|
if degeneralize_opt:
|
|
del degeneralized
|
|
# Must delete absolutely all references to an automaton
|
|
# so that the C++ destructor gets called.
|
|
del a, concrete
|
|
|
|
else:
|
|
exit_code = 1
|
|
|
|
del dict;
|
|
|
|
assert spot.atomic_prop.instance_count() == 0
|
|
assert spot.unop.instance_count() == 0
|
|
assert spot.binop.instance_count() == 0
|
|
assert spot.multop.instance_count() == 0
|