8be67c1976
* src/tgbatest/reductgba.test: More Test. * src/tgbatest/ltl2tgba.cc: Adjust ... * src/tgbaalgos/reductgba_sim_del.cc, src/tgbaalgos/reductgba_sim.hh, src/tgbaalgos/reductgba_sim.cc: try to optimize. * src/tgba/tgbareduc.hh, src/tgba/tgbareduc.cc: Scc reduction and we remove some acceptance condition in scc which are not accepting. * src/ltlvisit/syntimpl.cc : Some case wasn't detect. * src/ltlvisit/basicreduce.cc: Case FGa || FGb = F(Ga | Gb) added. * src/ltltest/syntimpl.test: More Test. * src/ltltest/syntimpl.cc: Put the formula in negative normal form.
93 lines
No EOL
2.7 KiB
Bash
Executable file
93 lines
No EOL
2.7 KiB
Bash
Executable file
#! /bin/sh
|
|
# Copyright (C) 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.
|
|
|
|
|
|
# Check syntactic implication.
|
|
|
|
. ./defs || exit 1
|
|
|
|
#
|
|
#GFa && GFb && FG(!a && !b)
|
|
run 1 ./syntimpl 0 'a' 'a | b'
|
|
run 1 ./syntimpl 0 'F(a)' 'F(a | b)'
|
|
run 1 ./syntimpl 0 'G(a)' 'G(a | b)'
|
|
run 1 ./syntimpl 0 'GF(a)' 'GF(a | b)'
|
|
run 1 ./syntimpl 0 'GF(a)' '!FG(!a && !b)'
|
|
|
|
run 1 ./syntimpl 0 'Xa' 'X(b U a)'
|
|
run 1 ./syntimpl 0 'XXa' 'XX(b U a)'
|
|
|
|
run 1 ./syntimpl 0 '(e R f)' '(g U f)'
|
|
run 1 ./syntimpl 0 '( X(a + b))' '( X((a + b)+(c)+(d)))'
|
|
run 1 ./syntimpl 0 '( X(a + b)) U (e R f)' '( X((a + b)+(c)+(d))) U (g U f)'
|
|
|
|
run 1 ./syntimpl 0 '1' '1'
|
|
run 1 ./syntimpl 0 '0' '0'
|
|
|
|
run 1 ./syntimpl 0 'a' '1'
|
|
run 1 ./syntimpl 0 'a' 'a'
|
|
|
|
run 1 ./syntimpl 0 'a' 'a * 1'
|
|
|
|
run 1 ./syntimpl 0 'a * b' 'b'
|
|
run 1 ./syntimpl 0 'a * b' 'a'
|
|
|
|
run 1 ./syntimpl 0 'a' 'a + b'
|
|
run 1 ./syntimpl 0 'b' 'a + b'
|
|
|
|
run 1 ./syntimpl 0 'a + b' '1'
|
|
|
|
run 1 ./syntimpl 0 'a' 'b U a'
|
|
run 1 ./syntimpl 0 'a' 'b U 1'
|
|
run 1 ./syntimpl 0 'a U b' '1'
|
|
|
|
run 1 ./syntimpl 0 'a' '1 R a'
|
|
run 1 ./syntimpl 0 'a' 'a R 1'
|
|
run 1 ./syntimpl 0 'a R b' 'b'
|
|
run 1 ./syntimpl 0 'a R b' '1'
|
|
|
|
run 1 ./syntimpl 0 'Xa' 'X(b U a)'
|
|
run 1 ./syntimpl 0 'X(a R b)' 'Xb'
|
|
|
|
run 1 ./syntimpl 0 'a U b' '1 U b'
|
|
run 1 ./syntimpl 0 'a R b' '1 R b'
|
|
|
|
run 1 ./syntimpl 0 'b * (a U b)' 'a U b'
|
|
run 1 ./syntimpl 0 'a U b' 'c + (a U b)'
|
|
|
|
run 0 ./syntimpl 0 'Xa' 'XX(b U a)'
|
|
run 0 ./syntimpl 0 'XXa' 'X(b U a)'
|
|
|
|
run 0 ./syntimpl 0 '( X(a + b))' '( X(X(a + b)+(c)+(d)))'
|
|
run 0 ./syntimpl 0 '( X(a + b)) U (e R f)' '( X(X(a + b)+(c)+(d))) U (g U f)'
|
|
|
|
run 0 ./syntimpl 0 'a' 'b'
|
|
run 0 ./syntimpl 0 'a' 'b + c'
|
|
run 0 ./syntimpl 0 'a + b' 'a'
|
|
run 0 ./syntimpl 0 'a' 'a * c'
|
|
run 0 ./syntimpl 0 'a * b' 'c'
|
|
run 0 ./syntimpl 0 'a' 'a U b'
|
|
run 0 ./syntimpl 0 'a' 'a R b'
|
|
run 0 ./syntimpl 0 'a R b' 'a'
|
|
|
|
run 0 ./syntimpl 0 'p2' 'p3 || G(p2 && p5)'
|
|
run 0 ./syntimpl 0 '!(p3 || G(p2 && p5))' '!p2' |