A Generic Constructive Solution for Concurrent Games with Expressive Constraints on Strategies

DOI10.1007/978-3-540-75596-8_19zbMath1141.68512OpenAlexW1514267827MaRDI QIDQ3510800

Sophie Pinchinat

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

Mathematics Subject Classification ID

Applications of game theory (91A80) Formal languages and automata (68Q45) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (7)

Strategies in Games: A Logic-Automata Study ⋮ The Complexity of One-Agent Refinement Modal Logic ⋮ Model-checking iterated games ⋮ Reasoning About Strategies ⋮ Strategic reasoning: building cognitive models from logical formulas ⋮ ATL with Strategy Contexts and Bounded Memory ⋮ The complexity of one-agent refinement modal logic

This page was built for publication: A Generic Constructive Solution for Concurrent Games with Expressive Constraints on Strategies