Stuttering mostly speeds up solving parity games

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

8 Citations (Scopus)
1 Downloads (Pure)

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.
Original languageEnglish
Title of host publicationNASA Formal Methods (Third International Symposium, NFM 2011, Pasadena, CA, USA, April 18-20, 2011. Proceedings)
EditorsM. Bobaru, K. Havelund, G.J. Holzmann, R. Joshi
Place of PublicationBerlin
PublisherSpringer
Pages207-221
ISBN (Print)978-3-642-20397-8
DOIs
Publication statusPublished - 2011

Publication series

NameLecture Notes in Computer Science
Volume6617
ISSN (Print)0302-9743

Fingerprint Dive into the research topics of 'Stuttering mostly speeds up solving parity games'. Together they form a unique fingerprint.

Cite this