CONCUR 2005 – Concurrency Theory

DOI10.1007/11539452zbMath1134.68447OpenAlexW1737342522MaRDI QIDQ5897474

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

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)

Related Items (5)

Unnamed Item ⋮ A Truly Concurrent Game Model of the Asynchronous $$\pi $$-Calculus ⋮ Full Abstraction in a Subtyped pi-Calculus with Linear Types ⋮ Partial Orders, Event Structures and Linear Strategies ⋮ A Graph Abstract Machine Describing Event Structure Composition

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