Stuttering mostly speeds up solving parity games

Authors:
Sjoerd Cranen;Jeroen J. A. Keiren;Tim A. C. Willemse
Affiliations:
Department of Mathematics and Computer Science, Technische Universiteit Eindhoven, Eindhoven, The Netherlands;Department of Mathematics and Computer Science, Technische Universiteit Eindhoven, Eindhoven, The Netherlands;Department of Mathematics and Computer Science, Technische Universiteit Eindhoven, Eindhoven, The Netherlands
Venue:
NFM'11 Proceedings of the Third international conference on NASA Formal methods
Year:
2011

Citing 15
Cited 2

Characterizing finite Kripke structures in propositional temporal logic

Theoretical Computer Science - International Joint Conference on Theory and Practice of Software Development, P
Tree automata, Mu-Calculus and determinacy

SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Three logics for branching bisimulation

Journal of the ACM (JACM)
Infinite games on finitely coloured graphs with applications to automata on infinite trees

Theoretical Computer Science
Practical Model-Checking Using Games

TACAS '98 Proceedings of the 4th International Conference on Tools and Algorithms for Construction and Analysis of Systems
Small Progress Measures for Solving Parity Games

STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
Concurrency and Automata on Infinite Sequences

Proceedings of the 5th GI-Conference on Theoretical Computer Science
A Discrete Strategy Improvement Algorithm for Solving Parity Games

CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
Verification of a sliding window protocol in μCRL and PVS

Formal Aspects of Computing
A Multi-Core Solver for Parity Games

Electronic Notes in Theoretical Computer Science (ENTCS)
Solving Parity Games in Practice

ATVA '09 Proceedings of the 7th International Symposium on Automated Technology for Verification and Analysis
Solving parity games in big steps

FSTTCS'07 Proceedings of the 27th international conference on Foundations of software technology and theoretical computer science
Sigref: a symbolic bisimulation tool box

ATVA'06 Proceedings of the 4th international conference on Automated Technology for Verification and Analysis
Simulation relations for alternating parity automata and parity games

DLT'06 Proceedings of the 10th international conference on Developments in Language Theory
Equivalence checking for infinite systems using parameterized Boolean equation systems

CONCUR'07 Proceedings of the 18th international conference on Concurrency Theory

A cure for stuttering parity games

ICTAC'12 Proceedings of the 9th international conference on Theoretical Aspects of Computing
An overview of the mCRL2 toolset and its recent advances

TACAS'13 Proceedings of the 19th international conference on Tools and Algorithms for the Construction and Analysis of Systems

Quantified Score

Hi-index	0.00

Visualization

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.