Name
Abstract | ||
|---|---|---|
We study the process theoretic notion of stuttering equivalence in the setting of parity games. We demonstrate that stuttering equivalent vertices have the same winner in the parity game. This means that solving a parity game can be accelerated by minimising the game graph with respect to stuttering equivalence. While, at the outset, it might not be clear that this strategy should pay off, our experiments using typical verification problems illustrate that stuttering equivalence speeds up solving parity games in many cases. |
Year | DOI | Venue |
|---|---|---|
2011 | 10.1007/978-3-642-20398-5_16 | NASA Formal Methods |
Keywords | Field | DocType |
parity game,stuttering equivalence,game graph,equivalent vertex,typical verification problem,process theoretic notion,equivalence speed | Graph,Discrete mathematics,Parity game,Stuttering,Vertex (geometry),Computer science,Parity (mathematics),Stuttering equivalence | Conference |
Volume | ISSN | Citations |
6617 | 0302-9743 | 5 |
PageRank | References | Authors |
0.48 | 17 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Sjoerd Cranen | 1 | 110 | 6.61 |
| J. J. A. Keiren | 2 | 97 | 8.13 |
| Tim A. C. Willemse | 3 | 345 | 32.79 |