CONCUR 2005 – Concurrency Theory

DOI10.1007/11539452zbMATH Open1134.68447OpenAlexW1737342522MaRDI QIDQ5897474FDOQ5897474

Authors: Jim Laird 

Publication date: 1 November 2006

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11539452

Recommendations

• A truly concurrent game model of the asynchronous \(\pi\)-calculus
• Asynchronous games. II: The true concurrency of innocence
• A fully abstract denotational semantics for the \(\pi\)-calculus
• Game Semantics for Higher-Order Concurrency
• A Game Semantics of Idealized CSP

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Cited In (17)

• On bisimulations for the asynchronous π-calculus
• Title not available (Why is that?)
• CONCUR 2004 - Concurrency Theory
• On the validity of encodings of the synchronous in the asynchronous \(\pi\)-calculus
• Justified sequences in string diagrams: a comparison between two approaches to concurrent game semantics
• The far side of the cube. An elementary introduction to game semantics
• Non-angelic concurrent game semantics
• A truly concurrent game model of the asynchronous \(\pi\)-calculus
• Full abstraction in a subtyped pi-calculus with linear types
• A fully abstract denotational semantics for the \(\pi\)-calculus
• A graph abstract machine describing event structure composition
• Title not available (Why is that?)
• Title not available (Why is that?)
• Processes, systems \& tests: defining contextual equivalences
• Ludics is a Model for the Finitary Linear Pi-Calculus
• Partial Orders, Event Structures and Linear Strategies
• Game Semantics for Higher-Order Concurrency

This page was built for publication: CONCUR 2005 – Concurrency Theory

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