FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
From MaRDI portal
Publication:5897755
DOI10.1007/11590156zbMath1172.68540OpenAlexW2484051058MaRDI QIDQ5897755
Thomas A. Henzinger, Krishnendu Chatterjee
Publication date: 14 November 2006
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11590156
Games involving graphs (91A43) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Related Items
Graph Games and Reactive Synthesis ⋮ Compositional and symbolic synthesis of reactive controllers for multi-agent systems ⋮ Solving zero-sum one-sided partially observable stochastic games ⋮ Randomness for free ⋮ A survey of stochastic \(\omega \)-regular games ⋮ Strategy logic ⋮ Deciding Maxmin Reachability in Half-Blind Stochastic Games ⋮ Games with Opacity Condition