CONCUR 2003 - Concurrency Theory
From MaRDI portal
Publication:5900562
DOI10.1007/b11938zbMath1274.68173OpenAlexW105220891MaRDI QIDQ5900562
Rajeev Alur, P. Madhusudan, Salvatore La Torre
Publication date: 30 March 2010
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b11938
2-person games (91A05) Games involving graphs (91A43) Applications of game theory (91A80) Specification and verification (program logics, model checking, etc.) (68Q60) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (11)
Reasoning about equilibria in game-like concurrent systems ⋮ From model checking to equilibrium checking: reactive modules for rational verification ⋮ Connectivity games over dynamic networks ⋮ Robust, expressive, and quantitative linear temporal logics: pick any two for free ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Visibly pushdown modular games ⋮ Doomsday equilibria for omega-regular games ⋮ Bridging the gap between fair simulation and trace inclusion ⋮ Two Variable vs. Linear Temporal Logic in Model Checking and Games ⋮ Complexity of model checking MDPs against LTL specifications
This page was built for publication: CONCUR 2003 - Concurrency Theory