0e71dd70c1
* spot/twaalgos/sccfilter.cc: If an inherently-weak automaton has no rejecting cycle, reduce its acceptance to t instead of Büchi. * spot/twa/acc.hh (operator==, operator<): Fix comparisons of true acceptances. * NEWS: Mention these two changes. * spot/twaalgos/sccfilter.hh: Update documentation. * spot/twaalgos/determinize.cc (tgba_determinize): The call to scc_filter assume that the input BA is never reduced to t acceptance. Call scc_filter with an extra option to ensure that. * spot/twaalgos/postproc.cc (do_scc_filter): Adjust to add the extra option when we want to build Büchi or coBuchi. (ensure_ba): Don't mark trivial SCCs as accepting. * tests/core/complement.test, tests/core/dstar.test, tests/core/ltlsynt.test, tests/core/readsave.test, tests/core/wdba2.test, tests/python/_product_susp.ipynb, tests/python/automata-io.ipynb, tests/python/dualize.py, tests/python/highlighting.ipynb, tests/python/intrun.py, tests/python/setacc.py, tests/python/simstate.py, tests/python/stutter-inv.ipynb, tests/python/zlktree.py: Adjust test cases.
118 lines
2.2 KiB
Bash
Executable file
118 lines
2.2 KiB
Bash
Executable file
#!/bin/sh
|
|
# -*- coding: utf-8 -*-
|
|
# Copyright (C) 2012, 2014-2015, 2018-2019, 2023 Laboratoire de
|
|
# Recherche et Développement de l'Epita (LRDE).
|
|
#
|
|
# 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/>.
|
|
|
|
. ./defs
|
|
|
|
set -e
|
|
|
|
cat >expected <<EOF
|
|
transitions: 16
|
|
edges: 8
|
|
states: 4
|
|
nondeterministic states: 0
|
|
EOF
|
|
|
|
# These two equivalent formulae used to produce
|
|
# minimized automata of different sizes...
|
|
run 0 ../ikwiad -Rm -kt 'a | X(Gd|Fa)' > out
|
|
run 0 ../ikwiad -Rm -kt 'Fa | XGd' > out2
|
|
|
|
cmp out expected
|
|
cmp out2 expected
|
|
|
|
cat >input <<EOF
|
|
HOA: v1
|
|
name: "XXFp1"
|
|
States: 5
|
|
Start: 4
|
|
AP: 1 "p1"
|
|
acc-name: Buchi
|
|
Acceptance: 1 Inf(0)
|
|
properties: implicit-labels state-acc complete deterministic
|
|
--BODY--
|
|
State: 0 {0}
|
|
0 0
|
|
State: 1 {0}
|
|
3 0
|
|
State: 2
|
|
1 1
|
|
State: 3
|
|
3 0
|
|
State: 4
|
|
2 2
|
|
--END--
|
|
EOF
|
|
|
|
cat >expected <<EOF
|
|
HOA: v1
|
|
States: 4
|
|
Start: 2
|
|
AP: 1 "p1"
|
|
acc-name: Buchi
|
|
Acceptance: 1 Inf(0)
|
|
properties: implicit-labels state-acc complete deterministic terminal
|
|
properties: very-weak
|
|
--BODY--
|
|
State: 0 {0}
|
|
0 0
|
|
State: 1
|
|
3 3
|
|
State: 2
|
|
1 1
|
|
State: 3
|
|
3 0
|
|
--END--
|
|
EOF
|
|
|
|
autfilt --small --high -C -Hi input > output
|
|
diff output expected
|
|
|
|
# This test comes from a report from Raven Beutner and used to cause a
|
|
# segfault.
|
|
cat >input <<EOF
|
|
HOA: v1
|
|
States: 1
|
|
Start: 0
|
|
AP: 3 "l0" "l1" "l2"
|
|
acc-name: generalized-Buchi 0
|
|
Acceptance: 0 t
|
|
--BODY--
|
|
State: 0
|
|
[0&1] 0
|
|
[2] 0
|
|
[!2] 0
|
|
--END--
|
|
EOF
|
|
autfilt --small -S input >output
|
|
cat >expected <<EOF
|
|
HOA: v1
|
|
States: 1
|
|
Start: 0
|
|
AP: 0
|
|
acc-name: all
|
|
Acceptance: 0 t
|
|
properties: trans-labels explicit-labels state-acc complete
|
|
properties: deterministic terminal very-weak
|
|
--BODY--
|
|
State: 0
|
|
[t] 0
|
|
--END--
|
|
EOF
|
|
diff output expected
|