5ddac258e1
The explicit way of splitting suffers if there are too many input APs, two new ways of splitting are introduced as well as a heuristic to chose between them. * NEWS: update * spot/twaalgos/synthesis.cc, spot/twaalgos/synthesis.hh: New fonctions * bin/ltlsynt.cc: Add corresponding option * tests/core/gamehoa.test, tests/core/ltlsynt.test, tests/python/_partitioned_relabel.ipynb, tests/python/_synthesis.ipynb, tests/python/game.py, tests/python/split.py, tests/python/synthesis.py: Adjusting and adding test
303 lines
9.5 KiB
Python
303 lines
9.5 KiB
Python
# -*- mode: python; coding: utf-8 -*-
|
|
# Copyright (C) by the Spot authors, see the AUTHORS file for details.
|
|
#
|
|
# 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 buddy
|
|
from unittest import TestCase
|
|
tc = TestCase()
|
|
|
|
# CPython use reference counting, so that automata are destructed
|
|
# when we expect them to be. However other implementations like
|
|
# PyPy may call destructors latter, causing different output.
|
|
from platform import python_implementation
|
|
if python_implementation() == 'CPython':
|
|
def gcollect():
|
|
pass
|
|
else:
|
|
import gc
|
|
def gcollect():
|
|
gc.collect()
|
|
|
|
|
|
|
|
def incl(a, b):
|
|
return not b.intersects(spot.dualize(spot.tgba_determinize(a)))
|
|
|
|
|
|
def equiv(a, b):
|
|
return incl(a, b) and incl(b, a)
|
|
|
|
|
|
def do_split(f, out_list):
|
|
aut = spot.translate(f)
|
|
outputs = buddy.bddtrue
|
|
for a in out_list:
|
|
outputs &= buddy.bdd_ithvar(aut.register_ap(a))
|
|
s = spot.split_2step(aut, outputs, False)
|
|
return aut, s
|
|
|
|
aut, s = do_split('(FG !a) <-> (GF b)', ['b'])
|
|
tc.assertTrue(equiv(aut, spot.unsplit_2step(s)))
|
|
|
|
del aut
|
|
del s
|
|
gcollect()
|
|
|
|
aut, s = do_split('GFa && GFb', ['b'])
|
|
tc.assertTrue(equiv(aut, spot.unsplit_2step(s)))
|
|
# FIXME s.to_str() is NOT the same on Debian stable and on Debian unstable
|
|
# we should investigate this. See Issue #502.
|
|
# tc.assertEqual("""HOA: v1
|
|
# States: 3
|
|
# Start: 0
|
|
# AP: 2 "a" "b"
|
|
# acc-name: generalized-Buchi 2
|
|
# Acceptance: 2 Inf(0)&Inf(1)
|
|
# properties: trans-labels explicit-labels trans-acc complete
|
|
# properties: deterministic
|
|
# spot-state-player: 0 1 1
|
|
# --BODY--
|
|
# State: 0
|
|
# [0] 1
|
|
# [!0] 2
|
|
# State: 1
|
|
# [!1] 0 {0}
|
|
# [1] 0 {0 1}
|
|
# State: 2
|
|
# [!1] 0
|
|
# [1] 0 {1}
|
|
# --END--""", s.to_str() )
|
|
|
|
del aut
|
|
del s
|
|
gcollect()
|
|
|
|
aut, s = do_split('! ((G (req -> (F ack))) && (G (go -> (F grant))))', ['ack'])
|
|
tc.assertTrue(equiv(aut, spot.unsplit_2step(s)))
|
|
|
|
# FIXME s.to_str() is NOT the same on Debian stable and on Debian unstable
|
|
# we should investigate this. See Issue #502.
|
|
# tc.assertEqual(s.to_str(), """HOA: v1
|
|
# States: 9
|
|
# Start: 0
|
|
# AP: 4 "ack" "req" "go" "grant"
|
|
# acc-name: Buchi
|
|
# Acceptance: 1 Inf(0)
|
|
# properties: trans-labels explicit-labels state-acc
|
|
# --BODY--
|
|
# State: 0
|
|
# [1&!2] 3
|
|
# [!1&!2] 4
|
|
# [1&2] 5
|
|
# [!1&2] 6
|
|
# State: 1
|
|
# [t] 7
|
|
# State: 2
|
|
# [t] 8
|
|
# State: 3
|
|
# [t] 0
|
|
# [!0] 1
|
|
# State: 4
|
|
# [t] 0
|
|
# State: 5
|
|
# [t] 0
|
|
# [!0] 1
|
|
# [!3] 2
|
|
# State: 6
|
|
# [t] 0
|
|
# [!3] 2
|
|
# State: 7 {0}
|
|
# [!0] 1
|
|
# State: 8 {0}
|
|
# [!3] 2
|
|
# --END--""")
|
|
|
|
del aut
|
|
del s
|
|
gcollect()
|
|
|
|
aut, s = do_split('((G (((! g_0) || (! g_1)) && ((r_0 && (X r_1)) -> (F (g_0 \
|
|
&& g_1))))) && (G (r_0 -> F g_0))) && (G (r_1 -> F g_1))',
|
|
['g_0', 'g_1'])
|
|
tc.assertTrue(equiv(aut, spot.unsplit_2step(s)))
|
|
|
|
|
|
# check equivalence of split automata
|
|
# for the different methods for certain cases
|
|
autstr = """HOA: v1
|
|
name: "r2b_ack0 | F((!b2r_req0 & Xr2b_ack0) | (b2r_req0 & XG!r2b_ack0)) \
|
|
| (!b2r_req0 & G(!r2b_ack0 | ((!b2r_req0 | !b2r_req1) & X!b2r_req0 \
|
|
& (!(s2b_req0 | s2b_req1) | XF(b2r_req0 | b2r_req1)) & (!b2r_req0 \
|
|
| X(b2r_req0 | (b2r_req1 M !b2r_req0))) & (!b2r_req0 | r2b_ack0 \
|
|
| Xb2r_req0))))"
|
|
States: 12
|
|
Start: 7
|
|
AP: 5 "r2b_ack0" "b2r_req0" "b2r_req1" "s2b_req0" "s2b_req1"
|
|
controllable-AP: 2 1
|
|
acc-name: parity max even 4
|
|
Acceptance: 4 Fin(3) & (Inf(2) | (Fin(1) & Inf(0)))
|
|
properties: trans-labels explicit-labels trans-acc colored complete
|
|
properties: deterministic
|
|
--BODY--
|
|
State: 0
|
|
[!0&!1] 0 {2}
|
|
[0] 1 {1}
|
|
[!0&1] 3 {2}
|
|
State: 1
|
|
[t] 1 {2}
|
|
State: 2
|
|
[!0&1] 2 {2}
|
|
[0&1] 2 {3}
|
|
[!0&!1] 4 {2}
|
|
[0&!1] 5 {3}
|
|
State: 3
|
|
[!0&!1] 0 {2}
|
|
[0&1&2] 2 {1}
|
|
[!0&1] 3 {2}
|
|
[0&!1&3 | 0&!1&4] 6 {2}
|
|
[0&!1&!3&!4] 7 {2}
|
|
[0&1&!2] 8 {2}
|
|
State: 4
|
|
[0] 1 {1}
|
|
[!0&1] 2 {2}
|
|
[!0&!1] 4 {2}
|
|
State: 5
|
|
[0] 1 {1}
|
|
[!0&1] 2 {1}
|
|
[!0&!1] 5 {1}
|
|
State: 6
|
|
[!0&!1&2] 0 {2}
|
|
[0] 1 {1}
|
|
[!0&1] 2 {1}
|
|
[!0&!1&!2] 9 {1}
|
|
State: 7
|
|
[!0&!1] 0 {2}
|
|
[0] 1 {1}
|
|
[!0&1] 2 {1}
|
|
State: 8
|
|
[!0&!1&2] 0 {2}
|
|
[1] 2 {1}
|
|
[0&!1&2&3 | 0&!1&2&4] 6 {2}
|
|
[0&!1&2&!3&!4] 7 {2}
|
|
[!0&!1&!2] 10 {1}
|
|
[0&!1&!2] 11 {1}
|
|
State: 9
|
|
[!0&!1&2] 0 {2}
|
|
[0] 1 {1}
|
|
[!0&1] 3 {2}
|
|
[!0&!1&!2] 9 {1}
|
|
State: 10
|
|
[!0&!1&2] 0 {2}
|
|
[0] 1 {1}
|
|
[!0&1] 2 {1}
|
|
[!0&!1&!2] 10 {2}
|
|
State: 11
|
|
[!0&!1&2] 0 {2}
|
|
[0] 1 {1}
|
|
[!0&1] 2 {1}
|
|
[!0&!1&!2] 11 {1}
|
|
--END--
|
|
HOA: v1
|
|
States: 2
|
|
Start: 0
|
|
AP: 15 "u0room29light0f1dturn2off1b" "u0room29light0f1dturn2on1b" \
|
|
"p0b0room29window29opened" "u0room29light0f1dtoggle1b" \
|
|
"p0b0room29window29closed" "p0p0all2windows2closed0room" \
|
|
"u0system29start2new2timer0f1dmin25231b" \
|
|
"u0system29start2new2timer0f1dhour241b" \
|
|
"u0room29warnlight29control0room29warnlight29control" \
|
|
"u0system29start2new2timer0system29start2new2timer" \
|
|
"u0room29warnlight29control0f1dturn2on1b" \
|
|
"u0room29warnlight29control0f1dturn2off1b" "u0room29light0room29light" \
|
|
"u0system29start2new2timer0f1dhour251b" "p0b0timeout"
|
|
acc-name: all
|
|
Acceptance: 0 t
|
|
properties: trans-labels explicit-labels state-acc deterministic
|
|
controllable-AP: 0 1 3 6 7 8 9 10 11 12 13
|
|
--BODY--
|
|
State: 0
|
|
[!0&!1&!3&!6&!7&!8&!9&!10&11&12&13 | !0&!1&!3&!6&!7&!8&!9&10&!11&12&13 \
|
|
| !0&!1&!3&!6&!7&!8&9&!10&11&12&!13 | !0&!1&!3&!6&!7&!8&9&10&!11&12&!13 \
|
|
| !0&!1&!3&!6&!7&8&!9&!10&!11&12&13 | !0&!1&!3&!6&!7&8&9&!10&!11&12&!13 \
|
|
| !0&!1&!3&!6&7&!8&!9&!10&11&12&!13 | !0&!1&!3&!6&7&!8&!9&10&!11&12&!13 \
|
|
| !0&!1&!3&!6&7&8&!9&!10&!11&12&!13 | !0&!1&!3&6&!7&!8&!9&!10&11&12&!13 \
|
|
| !0&!1&!3&6&!7&!8&!9&10&!11&12&!13 | !0&!1&!3&6&!7&8&!9&!10&!11&12&!13 \
|
|
| !0&!1&3&!6&!7&!8&!9&!10&11&!12&13 | !0&!1&3&!6&!7&!8&!9&10&!11&!12&13 \
|
|
| !0&!1&3&!6&!7&!8&9&!10&11&!12&!13 | !0&!1&3&!6&!7&!8&9&10&!11&!12&!13 \
|
|
| !0&!1&3&!6&!7&8&!9&!10&!11&!12&13 | !0&!1&3&!6&!7&8&9&!10&!11&!12&!13 \
|
|
| !0&!1&3&!6&7&!8&!9&!10&11&!12&!13 | !0&!1&3&!6&7&!8&!9&10&!11&!12&!13 \
|
|
| !0&!1&3&!6&7&8&!9&!10&!11&!12&!13 | !0&!1&3&6&!7&!8&!9&!10&11&!12&!13 \
|
|
| !0&!1&3&6&!7&!8&!9&10&!11&!12&!13 | !0&!1&3&6&!7&8&!9&!10&!11&!12&!13 \
|
|
| !0&1&!3&!6&!7&!8&!9&!10&11&!12&13 | !0&1&!3&!6&!7&!8&!9&10&!11&!12&13 \
|
|
| !0&1&!3&!6&!7&!8&9&!10&11&!12&!13 | !0&1&!3&!6&!7&!8&9&10&!11&!12&!13 \
|
|
| !0&1&!3&!6&!7&8&!9&!10&!11&!12&13 | !0&1&!3&!6&!7&8&9&!10&!11&!12&!13 \
|
|
| !0&1&!3&!6&7&!8&!9&!10&11&!12&!13 | !0&1&!3&!6&7&!8&!9&10&!11&!12&!13 \
|
|
| !0&1&!3&!6&7&8&!9&!10&!11&!12&!13 | !0&1&!3&6&!7&!8&!9&!10&11&!12&!13 \
|
|
| !0&1&!3&6&!7&!8&!9&10&!11&!12&!13 | !0&1&!3&6&!7&8&!9&!10&!11&!12&!13 \
|
|
| 0&!1&!3&!6&!7&!8&!9&!10&11&!12&13 | 0&!1&!3&!6&!7&!8&!9&10&!11&!12&13 \
|
|
| 0&!1&!3&!6&!7&!8&9&!10&11&!12&!13 | 0&!1&!3&!6&!7&!8&9&10&!11&!12&!13 \
|
|
| 0&!1&!3&!6&!7&8&!9&!10&!11&!12&13 | 0&!1&!3&!6&!7&8&9&!10&!11&!12&!13 \
|
|
| 0&!1&!3&!6&7&!8&!9&!10&11&!12&!13 | 0&!1&!3&!6&7&!8&!9&10&!11&!12&!13 \
|
|
| 0&!1&!3&!6&7&8&!9&!10&!11&!12&!13 | 0&!1&!3&6&!7&!8&!9&!10&11&!12&!13 \
|
|
| 0&!1&!3&6&!7&!8&!9&10&!11&!12&!13 | 0&!1&!3&6&!7&8&!9&!10&!11&!12&!13] 1
|
|
State: 1
|
|
[!0&!1&!3&!6&!7&!8&!9&!10&11&12&13 | !0&!1&!3&!6&!7&!8&!9&10&!11&12&13 \
|
|
| !0&!1&!3&!6&!7&!8&9&!10&11&12&!13 | !0&!1&!3&!6&!7&!8&9&10&!11&12&!13 \
|
|
| !0&!1&!3&!6&!7&8&!9&!10&!11&12&13 | !0&!1&!3&!6&!7&8&9&!10&!11&12&!13 \
|
|
| !0&!1&!3&!6&7&!8&!9&!10&11&12&!13 | !0&!1&!3&!6&7&!8&!9&10&!11&12&!13 \
|
|
| !0&!1&!3&!6&7&8&!9&!10&!11&12&!13 | !0&!1&!3&6&!7&!8&!9&!10&11&12&!13 \
|
|
| !0&!1&!3&6&!7&!8&!9&10&!11&12&!13 | !0&!1&!3&6&!7&8&!9&!10&!11&12&!13 \
|
|
| !0&!1&3&!6&!7&!8&!9&!10&11&!12&13 | !0&!1&3&!6&!7&!8&!9&10&!11&!12&13 \
|
|
| !0&!1&3&!6&!7&!8&9&!10&11&!12&!13 | !0&!1&3&!6&!7&!8&9&10&!11&!12&!13 \
|
|
| !0&!1&3&!6&!7&8&!9&!10&!11&!12&13 | !0&!1&3&!6&!7&8&9&!10&!11&!12&!13 \
|
|
| !0&!1&3&!6&7&!8&!9&!10&11&!12&!13 | !0&!1&3&!6&7&!8&!9&10&!11&!12&!13 \
|
|
| !0&!1&3&!6&7&8&!9&!10&!11&!12&!13 | !0&!1&3&6&!7&!8&!9&!10&11&!12&!13 \
|
|
| !0&!1&3&6&!7&!8&!9&10&!11&!12&!13 | !0&!1&3&6&!7&8&!9&!10&!11&!12&!13 \
|
|
| !0&1&!3&!6&!7&!8&!9&!10&11&!12&13 | !0&1&!3&!6&!7&!8&!9&10&!11&!12&13 \
|
|
| !0&1&!3&!6&!7&!8&9&!10&11&!12&!13 | !0&1&!3&!6&!7&!8&9&10&!11&!12&!13 \
|
|
| !0&1&!3&!6&!7&8&!9&!10&!11&!12&13 | !0&1&!3&!6&!7&8&9&!10&!11&!12&!13 \
|
|
| !0&1&!3&!6&7&!8&!9&!10&11&!12&!13 | !0&1&!3&!6&7&!8&!9&10&!11&!12&!13 \
|
|
| !0&1&!3&!6&7&8&!9&!10&!11&!12&!13 | !0&1&!3&6&!7&!8&!9&!10&11&!12&!13 \
|
|
| !0&1&!3&6&!7&!8&!9&10&!11&!12&!13 | !0&1&!3&6&!7&8&!9&!10&!11&!12&!13 \
|
|
| 0&!1&!3&!6&!7&!8&!9&!10&11&!12&13 | 0&!1&!3&!6&!7&!8&!9&10&!11&!12&13 \
|
|
| 0&!1&!3&!6&!7&!8&9&!10&11&!12&!13 | 0&!1&!3&!6&!7&!8&9&10&!11&!12&!13 \
|
|
| 0&!1&!3&!6&!7&8&!9&!10&!11&!12&13 | 0&!1&!3&!6&!7&8&9&!10&!11&!12&!13 \
|
|
| 0&!1&!3&!6&7&!8&!9&!10&11&!12&!13 | 0&!1&!3&!6&7&!8&!9&10&!11&!12&!13 \
|
|
| 0&!1&!3&!6&7&8&!9&!10&!11&!12&!13 | 0&!1&!3&6&!7&!8&!9&!10&11&!12&!13 \
|
|
| 0&!1&!3&6&!7&!8&!9&10&!11&!12&!13 | 0&!1&!3&6&!7&8&!9&!10&!11&!12&!13] 1
|
|
--END--
|
|
"""
|
|
|
|
for autus in spot.automata(autstr):
|
|
si = spot.synthesis_info()
|
|
all_split = []
|
|
for sp in [spot.synthesis_info.splittype_EXPL,
|
|
spot.synthesis_info.splittype_SEMISYM,
|
|
spot.synthesis_info.splittype_FULLYSYM,
|
|
spot.synthesis_info.splittype_AUTO
|
|
]:
|
|
all_split.append(spot.split_2step(autus, si))
|
|
for i in range(len(all_split)):
|
|
for j in range(i+1, len(all_split)):
|
|
tc.assertTrue(spot.are_equivalent(all_split[i], all_split[j]))
|
|
|
|
|
|
del autus
|
|
del si
|
|
del all_split
|
|
gcollect()
|