A Distributed Pi-Calculus
DOI10.1017/CBO9780511611063zbMATH Open1125.68082OpenAlexW4212790255MaRDI QIDQ3439883FDOQ3439883
Authors: Matthew Hennessy 
Publication date: 21 May 2007
Full work available at URL: https://doi.org/10.1017/cbo9780511611063
Recommendations
pi-calculustype systembisimulationlabeled transition systemreduction semanticsaction semanticsdistributed asynchronous pi-calculus
Research exposition (monographs, survey articles) pertaining to computer science (68-02) Logic in computer science (03B70) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Cited In (47)
- Algorithmic type checking for a pi-calculus with name matching and session types
- Network-conscious \(\pi\)-calculus -- a model of Pastry
- Verification of correspondence assertions in a calculus for mobile ad hoc networks
- Dynamic structural operational semantics
- A theory of monitors (extended abstract)
- Towards a behavioural theory of access and mobility control in distributed systems
- Title not available (Why is that?)
- The \(C_\pi\)-calculus: a model for confidential name passing
- Declarative event based models of concurrency and refinement in psi-calculi
- A theory of system behaviour in the presence of node and link failure
- On parameterization of higher-order processes
- Processes in space
- Title not available (Why is that?)
- Precise subtyping for synchronous multiparty sessions
- safeDpi: a language for controlling mobile code
- Exploring probabilistic bisimulations. I
- Title not available (Why is that?)
- Counting the cost in the picalculus (extended abstract)
- A calculus of branching processes
- Characteristic bisimulation for higher-order session processes
- Store locally, prove globally
- Twenty Years on: Reflections on the CEDISYS Project. Combining True Concurrency with Process Algebra
- Explicit Identifiers and Contexts in Reversible Concurrent Calculus
- Mobility control via passports
- First-order reasoning for higher-order concurrency
- Strategy based semantics for mobility with time and access permissions
- On asynchronous eventful session semantics
- The Space and Motion of Communicating Agents
- Integrating deployment architectures and resource consumption in timed object-oriented models
- A theory of monitors
- Verification of distributed systems with the axiomatic system of MSVL
- Name-passing calculi: from fusions to preorders and types
- Timed mobility in process algebra and Petri nets
- Processes, systems \& tests: defining contextual equivalences
- Lexically scoped distribution: what you see is what you get
- Types for role-based access control of dynamic web data
- Formal Techniques for Networked and Distributed Systems - FORTE 2005
- Adding recursion to \textsc{Dpi} (extended abstract)
- On the distributability of mobile ambients
- A taxonomy of process calculi for distribution and mobility
- Using bisimulation proof techniques for the analysis of distributed abstract machines
- Title not available (Why is that?)
- MAG\(\pi\): types for failure-prone communication
- Distributability of mobile ambients
- Linked data privacy
- Processes against tests: on defining contextual equivalences
- Theory of interaction
This page was built for publication: A Distributed Pi-Calculus
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3439883)
