Stuttering Mostly Speeds Up Solving Parity Games

Cranen, Sjoerd; Keiren, Jeroen J. A.; Willemse, Tim A. C.

doi:10.1007/978-3-642-20398-5_16

Cited by 8 publications

(24 citation statements)

References 17 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Stuttering bisimulation [7] for Kripke Structures is among a select number of candidates worth considering, with an O(nm) time complexity (n being the number of vertices and m the number of edges). Indeed, as earlier experiments [9] indicate, off-the-shelf stuttering bisimulation reduction algorithms can be competitive when compared to modern available parity game solvers. Stuttering bisimulation, however, is inept when faced with alternations between players along the possible plays: it cannot relate vertices belonging to different players.…”

Section: Introductionmentioning

confidence: 88%

See 1 more Smart Citation

A Cure for Stuttering Parity Games

Cranen

Keiren

Willemse

2012

Theoretical Aspects of Computing – ICTAC 2012

Self Cite

View full text Add to dashboard Cite

Abstract. We define governed stuttering bisimulation for parity games, weakening stuttering bisimulation by taking the ownership of vertices into account only when this might lead to observably different games. We show that governed stuttering bisimilarity is an equivalence for parity games and allows for a natural quotienting operation. Moreover, we prove that all pairs of vertices related by governed stuttering bisimilarity are won by the same player in the parity game. Thus, our equivalence can be used as a preprocessing step when solving parity games. Governed stuttering bisimilarity can be decided in O(n 2 m) time for parity games with n vertices and m edges. Our experiments indicate that governed stuttering bisimilarity is mostly competitive with stuttering equivalence on parity games encoding typical verification problems.

show abstract

Section: Introductionmentioning

confidence: 88%

“…In [9] we introduced stuttering bisimulation for parity games. Informally, stuttering bisimulation compresses subsequences of "identical" vertices along a path p in a parity game, such that the path retains the essentials of the graph's branching structure.…”

mentioning

confidence: 99%

A Cure for Stuttering Parity Games

Cranen

Keiren

Willemse

2012

Theoretical Aspects of Computing – ICTAC 2012

Self Cite

View full text Add to dashboard Cite

show abstract

“…The properties were verified by creating a PBES, expanding it and solving the resulting BES. Solving time for these (large) equation systems was reduced by interpreting the BES as a parity game, reducing that game using a notion of stuttering equivalence tailored to parity games, and then solving the reduced game [13].…”

Section: Applications and Case Studiesmentioning

confidence: 99%

An Overview of the mCRL2 Toolset and Its Recent Advances

Cranen

Groote

Keiren

et al. 2013

Lecture Notes in Computer Science

Self Cite

111

View full text Add to dashboard Cite

Abstract. The analysis of complex distributed systems requires dedicated software tools. The mCRL2 language and toolset have been developed to support such analysis. We highlight changes and improvements made to the toolset in recent years. On the one hand, these affect the scope of application, which has been broadened with extended support for data structures like infinite sets and functions. On the other hand, considerable progress has been made regarding the performance of our tools for state space generation and model checking, due to improvements in symbolic reduction techniques and due to a shift towards parity gamebased solving. We also discuss the software architecture of the toolset, which was well suited to accommodate the above changes, and we address a number of case studies to illustrate the approach.

show abstract

“…The resulting smaller equation systems are then solved. A description of this procedure can be found in [10]. We use the July 2011 release of the mCRL2 toolset.…”

Section: Verificationmentioning

confidence: 99%

“…The µ-calculus properties were checked by using parity game reduction and parity game solvers, as described in [10]. Although the parity game reduction did speed up the solving process significantly, the real bottleneck was generating the game (or, equivalently, boolean equation system) itself, taking over three days for the second µ-calculus property for the scenario with a resetting leader node.…”

Section: Techniquesmentioning

confidence: 99%