A Distributed Pi-Calculus
From MaRDI portal
Publication:3439883
DOI10.1017/CBO9780511611063zbMath1125.68082OpenAlexW4212790255MaRDI QIDQ3439883
Publication date: 21 May 2007
Full work available at URL: https://doi.org/10.1017/cbo9780511611063
bisimulationtype systemaction semanticsreduction semanticspi-calculuslabeled transition systemdistributed asynchronous pi-calculus
Logic in computer science (03B70) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Research exposition (monographs, survey articles) pertaining to computer science (68-02)
Related Items
Characteristic bisimulation for higher-order session processes ⋮ Declarative event based models of concurrency and refinement in psi-calculi ⋮ Name-passing calculi: from fusions to preorders and types ⋮ Strategy based semantics for mobility with time and access permissions ⋮ Theory of interaction ⋮ Precise subtyping for synchronous multiparty sessions ⋮ Twenty Years on: Reflections on the CEDISYS Project. Combining True Concurrency with Process Algebra ⋮ Exploring probabilistic bisimulations. I ⋮ Processes in space ⋮ Verification of distributed systems with the axiomatic system of MSVL ⋮ Timed mobility in process algebra and Petri nets ⋮ Algorithmic type checking for a pi-calculus with name matching and session types ⋮ Linked data privacy ⋮ Unnamed Item ⋮ First-order reasoning for higher-order concurrency ⋮ Distributability of mobile ambients ⋮ Integrating deployment architectures and resource consumption in timed object-oriented models ⋮ A taxonomy of process calculi for distribution and mobility ⋮ Using bisimulation proof techniques for the analysis of distributed abstract machines ⋮ A theory of system behaviour in the presence of node and link failure ⋮ Types for Role-Based Access Control of Dynamic Web Data ⋮ Explicit Identifiers and Contexts in Reversible Concurrent Calculus ⋮ The \(C_\pi\)-calculus: a model for confidential name passing ⋮ Counting the Cost in the Picalculus (Extended Abstract) ⋮ On asynchronous eventful session semantics ⋮ Verification of Correspondence Assertions in a Calculus for Mobile Ad Hoc Networks ⋮ Unnamed Item ⋮ A calculus of branching processes ⋮ A Theory of Monitors ⋮ Mobility control via passports ⋮ A theory of monitors ⋮ On parameterization of higher-order processes ⋮ Processes against tests: on defining contextual equivalences ⋮ Dynamic structural operational semantics
