game: git rid of the parity_game class
This class was a simple wrapper on top of twa_graph_ptr, but it's easier to simply use a twa_graph_ptr with a "state-player" property instead, this way we will be able to modify the automata I/O routines to support games directly. * spot/misc/game.cc, spot/misc/game.hh: Rewrite the solver and pg_printer interface. * bin/ltlsynt.cc: Adjust. * NEWS: Mention this change. * doc/org/concepts.org: Mention the state-player property.
This commit is contained in:
parent
6379d9889f
commit
25c75c55b1
5 changed files with 239 additions and 266 deletions
|
|
@ -1144,6 +1144,7 @@ Here is a list of named properties currently used inside Spot:
|
|||
| ~rejected-word~ | ~std::string~ | a word rejected by the automaton |
|
||||
| ~simulated-states~ | ~std::vector<unsigned>~ | map states of the original automaton to states if the current automaton in the result of simulation-based reductions |
|
||||
| ~state-names~ | ~std::vector<std::string>~ | vector naming each state of the automaton, for display purpose |
|
||||
| ~state-player~ | ~std::vector<bool>~ | the automaton represents a two-player game, and the vector gives the player (0 or 1) associated to each state |
|
||||
| ~synthesis-outputs~ | ~bdd~ | conjunction of controllable atomic propositions (used by ~print_aiger()~ to determine which propositions should be encoded as outputs of the circuit) |
|
||||
|
||||
Objects referenced via named properties are automatically destroyed
|
||||
|
|
|
|||
Loading…
Add table
Add a link
Reference in a new issue