A Truly Concurrent Game Model of the Asynchronous $$\pi $$-Calculus
From MaRDI portal
Publication:2988382
DOI10.1007/978-3-662-54458-7_23zbMath1486.68116OpenAlexW2613345300MaRDI QIDQ2988382
Publication date: 19 May 2017
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-662-54458-7_23
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
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An approach to innocent strategies as graphs
- \(\pi\)-calculus, internal mobility, and agent-passing calculi
- Uniformity and the Taylor expansion of ordinary lambda-terms
- Typed event structures and the linear \(\pi \)-calculus
- An exact correspondence between a typed pi-calculus and polarised proof-nets
- Interpreting a finitary pi-calculus in differential interaction nets
- On the expressiveness of internal mobility in name-passing calculi
- On full abstraction for PCF: I, II and III
- Full abstraction for PCF
- Angelic semantics of fine-grained concurrency
- Asynchronous games. II: The true concurrency of innocence
- Event Structure Semantics of Parallel Extrusion in the Pi-Calculus
- Innocent Game Semantics via Intersection Type Assignment Systems
- Game Semantics in String Diagrams
- Compositional Event Structure Semantics for the Internal π-Calculus
- Asynchronous Games: Innocence Without Alternation
- Thick Subtrees, Games and Experiments
- Causality vs. interleavings in concurrent game semantics
- Symmetry in concurrent games
- Nondeterminism in Game Semantics via Sheaves
- The Parallel Intensionally Fully Abstract Games Model of PCF
- Plays as Resource Terms via Non-idempotent Intersection Types
- A Game Semantics of Idealized CSP
- CONCUR 2005 – Concurrency Theory
