A Distributed Pi-Calculus
From MaRDI portal
Recommendations
Cited in
(50)- Mobility control via passports
- Towards a behavioural theory of access and mobility control in distributed systems
- Exploring probabilistic bisimulations. I
- The \(C_\pi\)-calculus: a model for confidential name passing
- A theory of monitors
- Processes against tests: on defining contextual equivalences
- Distributability of mobile ambients
- A calculus of branching processes
- Dynamic structural operational semantics
- Characteristic bisimulation for higher-order session processes
- Precise subtyping for synchronous multiparty sessions
- Algorithmic type checking for a pi-calculus with name matching and session types
- safeDpi: a language for controlling mobile code
- Declarative event based models of concurrency and refinement in psi-calculi
- A theory of monitors (extended abstract)
- Lexically scoped distribution: what you see is what you get
- Adding recursion to \textsc{Dpi} (extended abstract)
- Linked data privacy
- Types for role-based access control of dynamic web data
- On the distributability of mobile ambients
- Name-passing calculi: from fusions to preorders and types
- Twenty Years on: Reflections on the CEDISYS Project. Combining True Concurrency with Process Algebra
- The Space and Motion of Communicating Agents
- Processes in space
- scientific article; zbMATH DE number 1956519 (Why is no real title available?)
- scientific article; zbMATH DE number 1500657 (Why is no real title available?)
- First-order reasoning for higher-order concurrency
- Integrating deployment architectures and resource consumption in timed object-oriented models
- scientific article; zbMATH DE number 1420796 (Why is no real title available?)
- On parameterization of higher-order processes
- scientific article; zbMATH DE number 7559490 (Why is no real title available?)
- Explicit Identifiers and Contexts in Reversible Concurrent Calculus
- Counting the cost in the picalculus (extended abstract)
- Verification of correspondence assertions in a calculus for mobile ad hoc networks
- Network-conscious -calculus -- a model of Pastry
- Formal Techniques for Networked and Distributed Systems - FORTE 2005
- On asynchronous eventful session semantics
- Timed mobility in process algebra and Petri nets
- MAG\(\pi\): types for failure-prone communication
- Store locally, prove globally
- A taxonomy of process calculi for distribution and mobility
- Processes, systems \& tests: defining contextual equivalences
- Formal methods for mobile ad hoc networks: a survey
- Bialgebraic representation of coordination frameworks
- Adding recursion to Dpi
- Strategy based semantics for mobility with time and access permissions
- Theory of interaction
- Verification of distributed systems with the axiomatic system of MSVL
- Using bisimulation proof techniques for the analysis of distributed abstract machines
- A theory of system behaviour in the presence of node and link failure
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)
