Asynchronous Games: Innocence Without Alternation

DOI10.1007/978-3-540-74407-8_27MaRDI QIDQ3525651zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• CONCUR 2004 - Concurrency Theory
• Asynchronous games. II: The true concurrency of innocence
• Asynchronous games 3 an innocent model of linear logic
• scientific article; zbMATH DE number 1841820
• An approach to innocent strategies as graphs

Cited in

(31)

• Asynchronous game of life
• Deterministic concurrent strategies
• Bayesian strategies: probabilistic programs as generalised graphical models
• Asynchronous games. II: The true concurrency of innocence
• On concurrent games with payoff
• Asynchronous games 3 an innocent model of linear logic
• A truly concurrent game model of the asynchronous -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
• An approach to innocent strategies as graphs
• Jump from parallel to sequential proofs: exponentials
• Imperfect information in logic and concurrent games
• Presenting finite posets
• The true concurrency of Herbrand's theorem
• Fully abstract models of the probabilistic -calculus
• Concurrent specifications beyond linearizability
• Distributed Strategies Made Easy
• scientific article; zbMATH DE number 7204431 (Why is no real title available?)
• Partial-order Boolean games: informational independence in a logic-based model of strategic interaction
• CONCUR 2004 - Concurrency Theory
• Grounding game semantics in categorical algebra
• The mays and musts of concurrent strategies
• A tale of additives and concurrency in game semantics
• Disentangling parallelism and interference in game semantics
• Bi-invariance for uniform strategies on event structures
• From thin concurrent games to generalized species of structures (extended version)
• Choice trees: representing and reasoning about nondeterministic, recursive, and impure programs in Rocq
• Extensional and non-extensional functions as processes
• The categorical contours of the Chomsky-Schützenberger representation theorem
• A compositional theory of linearizability

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3525651)