Abstract
We summarize classical and recent results about two-player games played on graphs with omega-regular objectives. These games have applications in the verification and synthesis of reactive systems. Important distinctions are whether a graph game is turn-based or concurrent; deterministic or stochastic; zero-sum or not. We cluster known results and open problems according to these classifications. (C) 2011 Elsevier Inc. All rights reserved.
Details
Title
A survey of stochastic omega-regular games
Author(s)
Chatterjee, Krishnendu ; Henzinger, Thomas A.
Published in
Journal Of Computer And System Sciences
Volume
78
Pages
394-413
Date
2012
Keywords
Other identifier(s)
View record in Web of Science
Laboratories
MTC
Record Appears in
Scientific production and competences > I&C - School of Computer and Communication Sciences > IC Archives > MTC - Models and Theory of Computation Laboratory
Peer-reviewed publications
Work produced at EPFL
Journal Articles
Published
Peer-reviewed publications
Work produced at EPFL
Journal Articles
Published
Record creation date
2012-03-01