|
typedef std::unordered_set< unsigned > | region_t |
|
typedef std::unordered_map< unsigned, unsigned > | strategy_t |
|
◆ parity_game()
spot::parity_game::parity_game |
( |
const twa_graph_ptr & |
arena, |
|
|
const std::vector< bool > & |
owner |
|
) |
| |
parity_game provides an interface to manipulate a colorized parity automaton as a parity game, including methods to solve the game. The input automaton (arena) should be colorized and have a max-odd parity acceptance condition.
- Parameters
-
arena | the underlying parity automaton |
owner | a vector of Booleans indicating the owner of each state: true stands for Player 1, false stands for Player 0. |
◆ print()
void spot::parity_game::print |
( |
std::ostream & |
os | ) |
|
Print the parity game in PGSolver's format.
◆ solve()
void spot::parity_game::solve |
( |
region_t(&) |
w[2], |
|
|
strategy_t(&) |
s[2] |
|
) |
| const |
Compute the winning strategy and winning region of this game for player 1 using Zielonka's recursive algorithm. [45]
The documentation for this class was generated from the following file: