alarsyo/spot
1
0
Fork 0
Code Issues Pull requests Projects Releases Wiki Activity

parity game: compute winning strategy

Browse source 
* spot/misc/game.cc, spot/misc/game.hh: Here.
* bin/ltlsynt.cc: Realizability is now done by checking if the winning
strategy contains the initial state.
This commit is contained in:
Thibaud Michaud 2017-05-02 13:59:00 +02:00
parent f414e9f5f2
commit 601e1405de
3 changed files with 95 additions and 74 deletions
Download patch file Download diff file Expand all files Collapse all files

2
bin/ltlsynt.cc
View file

@ -213,7 +213,7 @@ namespace
{
case REC:
{
if (pg.winner())
if (std::get<0>(pg.solve()).count(pg.get_init_state_number()))
std::cout << "REALIZABLE\n";
else
std::cout << "UNREALIZABLE\n";