152b5d0d30
* NEWS: Mention of the deprecation * bench/stutter/stutter_invariance_randomgraph.cc, bin/autfilt.cc, bin/ltlcross.cc, spot/twaalgos/langmap.cc, spot/twaalgos/minimize.cc, spot/twaalgos/powerset.cc, spot/twaalgos/stutter.cc, tests/core/ikwiad.cc, tests/python/bugdet.py, tests/python/remfin.py, tests/python/sum.py: Refactor calls to dtwa_complement() with calls to dualize(). * doc/org/upgrade2.org: Change mention of dtwa_complement with dualize. * spot/twaalgos/complement.hh: Add deprecation notice. * python/spot/impl.i: Add deprecation notice for the python bindings.
91 lines
2.5 KiB
Python
91 lines
2.5 KiB
Python
# -*- mode: python; coding: utf-8 -*-
|
|
# Copyright (C) 2017 Laboratoire de Recherche et Développement
|
|
# de l'Epita
|
|
#
|
|
# 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/>.
|
|
|
|
import spot
|
|
import sys
|
|
import itertools
|
|
|
|
# make sure that we are not allowed to build the sum of two automata with
|
|
# different dictionaries.
|
|
|
|
aut1 = spot.translate('Xa')
|
|
aut2 = spot.translate('Xb', dict=spot.make_bdd_dict())
|
|
|
|
try:
|
|
spot.sum(aut1, aut2)
|
|
exit(2)
|
|
except RuntimeError:
|
|
pass
|
|
|
|
|
|
opts = spot.option_map()
|
|
opts.set('output', spot.OUTPUTLTL)
|
|
opts.set('tree_size_min', 15)
|
|
opts.set('tree_size_max', 15)
|
|
opts.set('wf', False)
|
|
opts.set('seed', 0)
|
|
opts.set('simplification_level', 0)
|
|
spot.srand(0)
|
|
rg = spot.randltlgenerator(2, opts)
|
|
|
|
|
|
dict = spot.make_bdd_dict()
|
|
|
|
def produce_phi(rg, n):
|
|
phi = []
|
|
while len(phi) < n:
|
|
f = rg.next()
|
|
if f.is_syntactic_persistence():
|
|
phi.append(f)
|
|
return phi
|
|
|
|
def equivalent(a, phi):
|
|
negphi = spot.formula.Not(phi)
|
|
nega = spot.dualize(spot.tgba_determinize(a))
|
|
a2 = spot.ltl_to_tgba_fm(phi, dict)
|
|
nega2 = spot.ltl_to_tgba_fm(negphi, dict)
|
|
return spot.product(a, nega2).is_empty()\
|
|
and spot.product(nega, a2).is_empty()
|
|
|
|
phi1 = produce_phi(rg, 1000)
|
|
phi2 = produce_phi(rg, 1000)
|
|
inputres = []
|
|
aut = []
|
|
for p in zip(phi1, phi2):
|
|
inputres.append(spot.formula.Or(p))
|
|
a1 = spot.ltl_to_tgba_fm(p[0], dict)
|
|
a2 = spot.ltl_to_tgba_fm(p[1], dict)
|
|
aut.append(spot.to_generalized_buchi( \
|
|
spot.remove_alternation(spot.sum(a1, a2), True)))
|
|
|
|
for p in zip(aut, inputres):
|
|
assert equivalent(p[0], p[1])
|
|
|
|
aut = []
|
|
inputres = []
|
|
|
|
for p in zip(phi1, phi2):
|
|
inputres.append(spot.formula.And(p))
|
|
a1 = spot.ltl_to_tgba_fm(p[0], dict)
|
|
a2 = spot.ltl_to_tgba_fm(p[1], dict)
|
|
aut.append(spot.to_generalized_buchi( \
|
|
spot.remove_alternation(spot.sum_and(a1, a2), True)))
|
|
|
|
for p in zip(aut, inputres):
|
|
assert equivalent(p[0], p[1])
|