d8ba172e6d
after the simulation-reduction. Report from Tomáš Babiak <xbabiak@fi.muni.cz>. * src/tgbaalgos/neverclaim.hh (never_claim_reachable): Take a tgba as input. * src/tgbaalgos/neverclaim.cc (never_claim_bfs): Call state_is_accepting() only if this tgba turns out to be a tgba_sba_proxy. Otherwise check the acceptance of one outgoing transition as we do in dotty_bfs since 2011-03-05. * src/tgbatest/ltl2tgba.cc: Do not redegeneralize before calling never_claim_reachable() if we know the automaton is degeneralized already. * src/tgbatest/ltl2tgba.test: Add a test case.
136 lines
4.1 KiB
Bash
Executable file
136 lines
4.1 KiB
Bash
Executable file
#!/bin/sh
|
|
# Copyright (C) 2009, 2010, 2011 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 2 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 Spot; see the file COPYING. If not, write to the Free
|
|
# Software Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA
|
|
# 02111-1307, USA.
|
|
|
|
|
|
. ./defs
|
|
|
|
set -e
|
|
|
|
check ()
|
|
{
|
|
run 0 ../ltl2tgba -l "$1"
|
|
run 0 ../ltl2tgba -f "$1"
|
|
run 0 ../ltl2tgba -f -FC "$1"
|
|
}
|
|
|
|
# We don't check the output, but just running these might be enough to
|
|
# trigger assertions.
|
|
|
|
check a
|
|
check 'a U b'
|
|
check 'X a'
|
|
check 'a & b & c'
|
|
check 'a | b | (c U (d & (g U (h ^ i))))'
|
|
check 'Xa & (b U !a) & (b U !a)'
|
|
check 'Fa & Xb & GFc & Gd'
|
|
check 'Fa & Xa & GFc & Gc'
|
|
check 'Fc & X(a | Xb) & GF(a | Xb) & Gc'
|
|
check 'a R (b R c)'
|
|
check '(a U b) U (c U d)'
|
|
|
|
check '((Xp2)U(X(1)))&(p1 R(p2 R p0))'
|
|
|
|
|
|
# Make sure 'a U (b U c)' has 3 states and 6 transitions,
|
|
# before and after degeneralization.
|
|
for opt in '' -D -DS; do
|
|
../ltl2tgba -ks -f -R3 $opt 'a U (b U c)' > stdout
|
|
grep 'transitions: 6$' stdout
|
|
grep 'states: 3$' stdout
|
|
done
|
|
|
|
# Make sure '!(Ga U b)' has 3 states and 6 transitions,
|
|
# before and after degeneralization.
|
|
for opt in '' -D -DS; do
|
|
../ltl2tgba -kt -f -R3 $opt '!(Ga U b)' > stdout
|
|
grep 'sub trans.: 11$' stdout
|
|
grep 'transitions: 6$' stdout
|
|
grep 'states: 3$' stdout
|
|
done
|
|
|
|
# Make sure 'Ga U b' has 4 states and 6 transitions,
|
|
# before and after degeneralization.
|
|
for opt in '' -D -DS; do
|
|
../ltl2tgba -kt -f -R3 $opt 'Ga U b' > stdout
|
|
grep 'sub trans.: 12$' stdout
|
|
grep 'transitions: 6$' stdout
|
|
grep 'states: 4$' stdout
|
|
done
|
|
|
|
# Make sure '(G (p -> F q)) && ((X (p) U q) || ! X (p U (p && q)))'
|
|
# has 6 states and 15 transitions, before and after degeneralization.
|
|
f='(G (p -> F q)) && ((X (p) U q) || ! X (p U (p && q)))'
|
|
for opt in '' -D -DS; do
|
|
../ltl2tgba -ks -f -R3 $opt "$f" > stdout
|
|
grep 'transitions: 15$' stdout
|
|
grep 'states: 6$' stdout
|
|
done
|
|
# Note: this is worse with -R3f.
|
|
../ltl2tgba -ks -f -R3f -DS "$f" > stdout
|
|
grep 'transitions: 17$' stdout
|
|
grep 'states: 7$' stdout
|
|
|
|
# Make sure 'GFa & GFb & GFc & GFd & GFe & GFf'
|
|
# has 7 states and 34 transitions after degeneralization.
|
|
f='GFa & GFb & GFc & GFd & GFe & GFg'
|
|
../ltl2tgba -ks -DS -x -f "$f" > stdout
|
|
grep 'transitions: 34$' stdout
|
|
grep 'states: 7$' stdout
|
|
|
|
# Make sure 'Ga & XXXX!a' is minimized to one state.
|
|
f='Ga & XXXX!a'
|
|
../ltl2tgba -ks -f "$f" > stdout
|
|
grep 'transitions: 4$' stdout
|
|
grep 'states: 5$' stdout
|
|
../ltl2tgba -ks -Rm -f "$f" > stdout
|
|
grep 'transitions: 0$' stdout
|
|
grep 'states: 1$' stdout
|
|
|
|
# Make sure a monitor for F(a & F(b)) accepts everything.
|
|
run 0 ../ltl2tgba -M -f "F(a & F(b))" | grep ' ->' > stdout
|
|
cat >expected <<EOF
|
|
0 -> 1
|
|
1 -> 1 [label="1\n"]
|
|
EOF
|
|
cmp stdout expected
|
|
|
|
# This formula caused a segfault with Spot 0.7.
|
|
run 0 ../ltl2tgba -Rm -ks -f "Gq|Gr|(G(q|FGp)&G(r|FG!p))" >stdout
|
|
grep 'transitions: 5$' stdout
|
|
grep 'states: 3$' stdout
|
|
|
|
# Adding -R3 used to make it work...
|
|
run 0 ../ltl2tgba -R3 -Rm -ks -f "Gq|Gr|(G(q|FGp)&G(r|FG!p))" >stdout
|
|
grep 'transitions: 5$' stdout
|
|
grep 'states: 3$' stdout
|
|
|
|
# Make sure FGa|GFb has the same number of states/transitions when
|
|
# output as a never claim or are a degeneralized BA in Spot's textual
|
|
# format. The option -R1q -R1t used to cause two degeneralizations to
|
|
# occur.
|
|
run 0 ../ltl2tgba -R1q -R1t -N 'FGa|FGb' > out.never
|
|
run 0 ../ltl2tgba -XN -kt out.never > count.never
|
|
run 0 ../ltl2tgba -R1q -R1t -DS -b 'FGa|FGb' > out.spot
|
|
run 0 ../ltl2tgba -X -kt out.spot > count.spot
|
|
cmp count.never count.spot
|