A survey of stochastic omega-regular games

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.


Published in:
Journal Of Computer And System Sciences, 78, 394-413
Year:
2012
Keywords:
Laboratories:




 Record created 2012-03-01, last modified 2018-03-17


Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)