Stuttering mostly speeds up solving parity games

Onderzoeksoutput: Hoofdstuk in Boek/Rapport/CongresprocedureConferentiebijdrageAcademicpeer review

8 Citaten (Scopus)
1 Downloads (Pure)

Samenvatting

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.
Originele taal-2Engels
TitelNASA Formal Methods (Third International Symposium, NFM 2011, Pasadena, CA, USA, April 18-20, 2011. Proceedings)
RedacteurenM. Bobaru, K. Havelund, G.J. Holzmann, R. Joshi
Plaats van productieBerlin
UitgeverijSpringer
Pagina's207-221
ISBN van geprinte versie978-3-642-20397-8
DOI's
StatusGepubliceerd - 2011

Publicatie series

NaamLecture Notes in Computer Science
Volume6617
ISSN van geprinte versie0302-9743

Vingerafdruk Duik in de onderzoeksthema's van 'Stuttering mostly speeds up solving parity games'. Samen vormen ze een unieke vingerafdruk.

Citeer dit