Locality and interleaving semantics in calculi for mobile processes
From MaRDI portal
Publication:672123
DOI10.1016/0304-3975(95)00020-8zbMath0874.68115OpenAlexW2033241085MaRDI QIDQ672123
Publication date: 27 February 1997
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(95)00020-8
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Logic in computer science (03B70) Semantics in the theory of computing (68Q55)
Related Items (10)
A stable non-interleaving early operational semantics for the pi-calculus ⋮ Unnamed Item ⋮ Specification of a Localization Component Driven by a Goal-Based Approach: Some Lessons We Learned ⋮ \(\pi\)-calculus, internal mobility, and agent-passing calculi ⋮ Encoding Distributed Areas and Local Communication into the π-Calculus ⋮ A Distributed π-Calculus with Local Areas of Communication ⋮ A Stable Non-interleaving Early Operational Semantics for the Pi-Calculus ⋮ Mobile objects as mobile processes ⋮ On the expressiveness of internal mobility in name-passing calculi ⋮ Non-interleaving semantics for mobile processes
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Universal axioms for bisimulations
- Observing localities
- A fully abstract semantics for causality in the \(\pi\)-calculus
- A calculus of mobile processes. II
- An efficiency preorder for processes
- A theory of processes with localities
- A static view of localities
- Comparing locality and causality based equivalences
- Asynchronous process calculi: The first- and higher-order paradigms
- Objects in the \(\pi\)-calculus
- Algebraic theories for name-passing calculi
- A theory of bisimulation for the \(\pi\)-calculus
- Functions as processes
- On the bisimulation proof method
- A parametric approach to localities
- Proved trees
- Logic and Algebra of Specification
This page was built for publication: Locality and interleaving semantics in calculi for mobile processes
