CONCUR 2004 - Concurrency Theory

DOI10.1007/B100113zbMATH Open1099.68064OpenAlexW2499482941MaRDI QIDQ5311501FDOQ5311501

Authors: 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

Recommendations

• Timed extensions of \(\pi\) calculus
• Timed \(\pi\)-calculus
• scientific article; zbMATH DE number 1223738
• On confluence in the \(\pi\)-calculus
• Concurrent and Located Synchronizations in π-Calculus

Mathematics Subject Classification ID

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

Cited In (13)

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

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

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