spot/src/tests/unambig.test
Alexandre Duret-Lutz 8c32fba8b9 scc_info: determine accepting/rejecting-SCCs for any acceptance
* src/twaalgos/sccinfo.cc, src/twaalgos/sccinfo.hh
(determine_unknown_acceptance): New function to call explicitly
in case one want to know whether the accepting/rejecting status
of all SCCs regardless of the acceptance.
* src/twaalgos/dotty.cc src/twaalgos/sccfilter.cc,
src/twaalgos/sccfilter.hh: Use it.
* src/tests/unambig.test, src/tests/sccdot.test: Add more tests.
* doc/org/oaut.org: Adjust doc for --dot=s, orange is not output
anymore.
2015-05-13 23:16:26 +02:00

156 lines
3 KiB
Bash
Executable file

#!/bin/sh
# -*- coding: utf-8 -*-
# Copyright (C) 2013, 2015 Laboratoire de Recherche et Developpement
# 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/>.
. ./defs
set -e
ltl2tgba=../../bin/ltl2tgba
autfilt=../../bin/autfilt
for f in 'Ga' \
'Ga | Gb' \
'Ga | GFb' \
'Ga | FGb' \
'XFGa | GFb | Gc' \
'(Ga -> Gb) W c' \
'F(a & !b & (!c W b))' \
'G({{1;1}*}<>->a)'
do
$ltl2tgba -UH "$f" | $autfilt -q --is-unambiguous
$ltl2tgba -UH "!($f)" | $autfilt -q --is-unambiguous
$ltl2tgba -UH "$f" | $autfilt --check | grep unambiguous
$ltl2tgba -UH "!($f)" | $autfilt --check | grep unambiguous
done
for f in FGa '(({p1[*0..1]}[]-> 0) R XFp0)'
do
$ltl2tgba -H "$f" | $autfilt -qv --is-unambiguous
$ltl2tgba -UH "$f" | $autfilt -q --is-unambiguous
done
# All these should be detected as ambiguous automata
cat >input<<EOF
HOA: v1
States: 1
Start: 0
AP: 2 "a" "b"
Acceptance: 1 Inf(0)
--BODY--
State: 0
[0] 0
[1] 0
[0&1] 0 {0}
--END--
HOA: v1
States: 1
Start: 0
AP: 2 "a" "b"
Acceptance: 2 Inf(0) & Inf(1)
--BODY--
State: 0
[0] 0
[1] 0 {0}
[0&1] 0 {0 1}
--END--
HOA: v1
States: 2
Start: 0
AP: 2 "a" "b"
Acceptance: 1 Inf(0)
--BODY--
State: 0
[0] 1 {0}
[1] 1
State: 1
[0] 1 {0}
--END--
HOA: v1
States: 2
Start: 0
AP: 2 "a" "b"
Acceptance: 1 Fin(0)
--BODY--
State: 0
[0] 1 {0}
[1] 1
State: 1
[0] 1 {0}
[!0] 1
--END--
HOA: v1
States: 3
Start: 0
AP: 2 "b" "a"
Acceptance: 4 (Fin(1) & Inf(2)) | (Fin(0) & Inf(3))
properties: trans-labels explicit-labels trans-acc complete
--BODY--
State: 0
[!0&!1] 1 {1}
[0&!1] 0 {1 3}
[!0&1] 1 {2}
[0&1] 0 {2 3}
State: 1
[!0&!1] 2 {1}
[0&!1] 2 {1 3}
[!0&1] 1 {2}
[0&1] 1 {2 3}
State: 2
[!0&!1] 2 {1}
[0&!1] 2 {1 3}
[!0&1] 2 {1}
[0&1] 2 {1 3}
[!0] 0 /* extra transition */
--END--
HOA: v1
States: 3
Start: 0
Start: 2 /* extra initial state */
AP: 2 "b" "a"
Acceptance: 4 (Fin(1) & Inf(2)) | (Fin(0) & Inf(3))
properties: trans-labels explicit-labels trans-acc complete
--BODY--
State: 0
[!0&!1] 1 {1}
[0&!1] 0 {1 3}
[!0&1] 1 {2}
[0&1] 0 {2 3}
State: 1
[!0&!1] 2 {1}
[0&!1] 2 {1 3}
[!0&1] 1 {2}
[0&1] 1 {2 3}
State: 2
[!0&!1] 2 {1}
[0&!1] 2 {1 3}
[!0&1] 2 {1}
[0&1] 2 {1 3}
--END--
EOF
run 1 $autfilt -q --is-unambiguous input
run 0 $autfilt --check input > output
test `grep -c unambiguous output` = 0
# Check 1000 random PSL formulas
../../bin/randltl --psl -n 1000 3 | $ltl2tgba -U -F- -H |
$autfilt -v --is-unamb --stats=%M && exit 1
: