Asynchronous Games: Innocence Without Alternation

DOI10.1007/978-3-540-74407-8_27zbMath1151.68465OpenAlexW2146242204MaRDI 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

Mathematics Subject Classification ID

Applications of game theory (91A80) Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (18)

On concurrent games with payoff ⋮ Jump from parallel to sequential proofs: exponentials ⋮ An approach to innocent strategies as graphs ⋮ Deterministic concurrent strategies ⋮ Unnamed Item ⋮ Unnamed Item ⋮ A Truly Concurrent Game Model of the Asynchronous $$\pi $$-Calculus ⋮ A Characterization of Hypercoherent Semantic Correctness in Multiplicative Additive Linear Logic ⋮ Bayesian strategies: probabilistic programs as generalised graphical models ⋮ Partial-order Boolean games: informational independence in a logic-based model of strategic interaction ⋮ Imperfect Information in Logic and Concurrent Games ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ The structure of first-order causality ⋮ Partial Orders, Event Structures and Linear Strategies ⋮ Distributed Strategies Made Easy

This page was built for publication: Asynchronous Games: Innocence Without Alternation