CONCUR 2004 - Concurrency Theory

DOI10.1007/b100113zbMath1099.68064OpenAlexW2499482941MaRDI QIDQ5311501

Martin Berger

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

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (12)

A synchronous \(\pi\)-calculus ⋮ Linear forwarders ⋮ A pi-calculus based semantics for WS-BPEL ⋮ Strategy based semantics for mobility with time and access permissions ⋮ Value-passing CCS with noisy channels ⋮ Timed mobility in process algebra and Petri nets ⋮ A timed semantics of Orc ⋮ A theory of system behaviour in the presence of node and link failure ⋮ A calculus of quality for robustness against unreliable communication ⋮ A process calculus BigrTiMo of mobile systems and its formal semantics ⋮ \(\pi\)-calculus with noisy channels ⋮ Genericity and the \(\pi\)-calculus

This page was built for publication: CONCUR 2004 - Concurrency Theory