CONCUR 2004 - Concurrency Theory
From MaRDI portal
Publication:5311491
DOI10.1007/b100113zbMath1099.68672OpenAlexW2499482941MaRDI QIDQ5311491
Publication date: 23 August 2005
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b100113
Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Combinatory logic and lambda calculus (03B40)
Related Items (9)
Game Semantics in the Nominal Model ⋮ An approach to innocent strategies as graphs ⋮ Resource modalities in tensor logic ⋮ Angelic semantics of fine-grained concurrency ⋮ Unnamed Item ⋮ Sequential algorithms and strongly stable functions ⋮ Handshake Games ⋮ A Graph Abstract Machine Describing Event Structure Composition ⋮ Probabilistic π-Calculus and Event Structures
This page was built for publication: CONCUR 2004 - Concurrency Theory
