CONCUR 2005 – Concurrency Theory

DOI10.1007/11539452zbMath1134.68438OpenAlexW1737342522MaRDI QIDQ5897499

Hugo Gimbert, Wiesław Zielonka

Publication date: 1 November 2006

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11539452

Mathematics Subject Classification ID

2-person games (91A05) Games involving graphs (91A43) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (23)

Extending finite-memory determinacy to multi-player games ⋮ Admissible Strategies in Infinite Games over Graphs ⋮ Optimal strategy synthesis for request-response games ⋮ Average-energy games ⋮ Cooperative concurrent games ⋮ Continuous Positional Payoffs ⋮ Playing Safe, Ten Years Later ⋮ Computing Game Values for Crash Games ⋮ Unnamed Item ⋮ Submixing and shift-invariant stochastic games ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Exploring the boundary of half-positionality ⋮ Exploiting Game Theory for Analysing Justifications ⋮ Combinations of Qualitative Winning for Stochastic Parity Games ⋮ First-cycle games ⋮ Energy parity games ⋮ Unnamed Item ⋮ On Memoryless Quantitative Objectives ⋮ Extending Finite-Memory Determinacy by Boolean Combination of Winning Conditions

This page was built for publication: CONCUR 2005 – Concurrency Theory