A cure for stuttering parity games

  • Authors:

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

  • Affiliations:

  • Department of Computer Science and Mathematics, Eindhoven University of Technology, Eindhoven, The Netherlands;Department of Computer Science and Mathematics, Eindhoven University of Technology, Eindhoven, The Netherlands;Department of Computer Science and Mathematics, Eindhoven University of Technology, Eindhoven, The Netherlands

  • Venue:
  • ICTAC'12 Proceedings of the 9th international conference on Theoretical Aspects of Computing
  • Year:
  • 2012

Quantified Score

Hi-index 0.00

Visualization

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 $\mathcal{O}(n^2m)$ 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.