Asynchronous Games: Innocence Without Alternation
From MaRDI portal
Publication:3525651
DOI10.1007/978-3-540-74407-8_27zbMath1151.68465MaRDI QIDQ3525651
Paul-André Melliès, Samuel Mimram
Publication date: 18 September 2008
Published in: CONCUR 2007 – Concurrency Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-74407-8_27
91A80: Applications of game theory
68Q55: Semantics in the theory of computing
68Q85: Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)
68N30: Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.)
Related Items
Jump from parallel to sequential proofs: exponentials, Unnamed Item, Imperfect Information in Logic and Concurrent Games, Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, Distributed Strategies Made Easy, On concurrent games with payoff, An approach to innocent strategies as graphs, Partial-order Boolean games: informational independence in a logic-based model of strategic interaction, Deterministic concurrent strategies, Bayesian strategies: probabilistic programs as generalised graphical models, A Truly Concurrent Game Model of the Asynchronous $$\pi $$-Calculus, The structure of first-order causality, A Characterization of Hypercoherent Semantic Correctness in Multiplicative Additive Linear Logic, Partial Orders, Event Structures and Linear Strategies