4260b17fba
Introduce a new, uniform way to create and solve games. Games can now be created directly from specification using creat_game, uniformly solved using solve_game and transformed into a strategy using create_strategy. Strategy are mealy machines, which can be minimized. * bin/ltlsynt.cc: Minor adaption * spot/twaalgos/game.cc: solve_game, setters and getters for named properties * spot/twaalgos/game.hh: Here too * spot/twaalgos/mealy_machine.cc: Minor adaption * spot/twaalgos/synthesis.cc: create_game, create_strategy and minimize_strategy * spot/twaalgos/synthesis.hh: Here too * tests/core/ltlsynt.test: Adapting * tests/python/aiger.py , tests/python/games.ipynb , tests/python/mealy.py , tests/python/parity.py , tests/python/split.py: Adapting
141 lines
3.3 KiB
Python
141 lines
3.3 KiB
Python
# -*- mode: python; coding: utf-8 -*-
|
|
# Copyright (C) 2018-2021 Laboratoire de Recherche et
|
|
# Développement 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/>.
|
|
|
|
import spot
|
|
|
|
# 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, in_list, out_list):
|
|
aut = spot.translate(f)
|
|
outputs = spot.buddy.bddtrue
|
|
for a in out_list:
|
|
outputs &= spot.buddy.bdd_ithvar(aut.get_dict().varnum(spot.formula(a)))
|
|
s = spot.split_2step(aut, outputs, False, False)
|
|
return aut, s
|
|
|
|
def str_diff(expect, obtained):
|
|
res = expect == obtained
|
|
if not res:
|
|
print("Expected:\n", expect, "\nbut obtained:\n", obtained)
|
|
return res
|
|
|
|
|
|
|
|
aut, s = do_split('(FG !a) <-> (GF b)', ['a'], ['b'])
|
|
assert equiv(aut, spot.unsplit_2step(s))
|
|
|
|
del aut
|
|
del s
|
|
gcollect()
|
|
|
|
aut, s = do_split('GFa && GFb', ['a'], ['b'])
|
|
assert equiv(aut, spot.unsplit_2step(s))
|
|
assert str_diff("""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))))',
|
|
['go', 'req'], ['ack'])
|
|
assert 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
|
|
# assert 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))',
|
|
['r_0', 'r_1'], ['g_0', 'g_1'])
|
|
assert equiv(aut, spot.unsplit_2step(s))
|