A Generic Constructive Solution for Concurrent Games with Expressive Constraints on Strategies
From MaRDI portal
Publication:3510800
DOI10.1007/978-3-540-75596-8_19zbMath1141.68512MaRDI QIDQ3510800
Publication date: 3 July 2008
Published in: Automated Technology for Verification and Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-75596-8_19
91A80: Applications of game theory
68Q45: Formal languages and automata
68Q85: Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)
Related Items
The complexity of one-agent refinement modal logic, Model-checking iterated games, Strategic reasoning: building cognitive models from logical formulas, The Complexity of One-Agent Refinement Modal Logic, Reasoning About Strategies, Strategies in Games: A Logic-Automata Study, ATL with Strategy Contexts and Bounded Memory