Stuttering Equivalence for Parity Games

Details Stuttering Equivalence for Parity Games Stuttering Equivalence for Parity Games

2011-02-11

arxiv.org/abs/1102.2366v1

Computer Science

Logic in Computer Science

Version to appear in NFM 2011

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Stuttering Equivalence for Parity Games does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Stuttering Equivalence for Parity Games, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Stuttering Equivalence for Parity Games will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-632528