game: mention Oink
* doc/spot.bib (vandijk.18.tacas): New entry. * spot/misc/game.hh (solve_parity_game): Mention it.
This commit is contained in:
parent
324b0872a4
commit
ca043bd62d
2 changed files with 20 additions and 1 deletions
16
doc/spot.bib
16
doc/spot.bib
|
|
@ -856,6 +856,22 @@
|
|||
doi = {10.1007/978-3-642-59126-6_7}
|
||||
}
|
||||
|
||||
@InProceedings{ vandijk.18.tacas,
|
||||
author = {Tom van Dijk},
|
||||
title = {Oink: An Implementation and Evaluation of Modern Parity
|
||||
Game Solvers},
|
||||
booktitle = {Proceedings of the 24th International Conference on Tools
|
||||
and Algorithms for the Construction and Analysis of Systems
|
||||
(TACAS'18)},
|
||||
year = 2018,
|
||||
pages = {291--308},
|
||||
editor = {Dirk Beyer and Marieke Huisman},
|
||||
isbn = {978-3-319-89960-2},
|
||||
publisher = {Springer},
|
||||
series = {Lecture Notes in Computer Science},
|
||||
volume = {10805}
|
||||
}
|
||||
|
||||
@Article{ zielonka.98.tcs,
|
||||
author = {Wieslaw Zielonka},
|
||||
title = {Infinite games on finitely coloured graphs with
|
||||
|
|
|
|||
|
|
@ -62,7 +62,10 @@ namespace spot
|
|||
/// game for player 1 using Zielonka's recursive algorithm.
|
||||
/// \cite zielonka.98.tcs
|
||||
///
|
||||
/// Return the player winning in the initial state, and set
|
||||
/// Also includes some inspiration from Oink.
|
||||
/// \cite vandijk.18.tacas
|
||||
///
|
||||
/// Returns the player winning in the initial state, and sets
|
||||
/// the state-winner and strategy named properties.
|
||||
SPOT_API
|
||||
bool solve_parity_game(const twa_graph_ptr& arena);
|
||||
|
|
|
|||
Loading…
Add table
Add a link
Reference in a new issue