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.
机构:
Tel Aviv Univ, Sch Math Sci, Dept Stat & Operat Res, IL-6997800 Tel Aviv, IsraelTel Aviv Univ, Sch Math Sci, Dept Stat & Operat Res, IL-6997800 Tel Aviv, Israel
Solan, Eilon
Vieille, Nicolas
论文数: 0引用数: 0
h-index: 0
机构:
HEC Paris, Dept Econ & Decis Sci, F-78351 Jouy En Josas, FranceTel Aviv Univ, Sch Math Sci, Dept Stat & Operat Res, IL-6997800 Tel Aviv, Israel
机构:
ENS Paris Saclay, CNRS, F-911090 Gif Sur Yvette, France
ENS Paris Saclay, LMF, F-91190 Gif Sur Yvette, FranceENS Paris Saclay, CNRS, F-911090 Gif Sur Yvette, France