A taxonomy of process calculi for distribution and mobility
From MaRDI portal
Publication:660996
DOI10.1007/s00446-010-0120-6zbMath1231.68169OpenAlexW2019329654MaRDI QIDQ660996
Publication date: 6 February 2012
Published in: Distributed Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00446-010-0120-6
Logic in computer science (03B70) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Distributed systems (68M14)
Related Items
Session-based concurrency, declaratively ⋮ On the Expressiveness of Symmetric Communication ⋮ On the validity of encodings of the synchronous in the asynchronous \(\pi\)-calculus ⋮ Expressiveness of concurrent intensionality ⋮ Unnamed Item ⋮ Full abstraction for expressiveness: history, myths and facts ⋮ On the relative expressiveness of higher-order session processes ⋮ On the expressiveness of π-calculus for encoding mobile ambients
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Comparing communication primitives via their relative expressive power
- A calculus of mobile processes. I
- Testing equivalences for processes
- On modelling mobility
- Mobile ambients
- On the computational strength of pure ambient calculi
- What is a ``good encoding of guarded choice?
- Decoding choice encodings
- Resource access control in systems of mobile agents
- On the expressive power of movement and restriction in pure mobile ambients
- Towards a behavioural theory of access and mobility control in distributed systems
- Towards a unified approach to encodability and separation results for process calculi
- Symmetric electoral systems for ambient calculi
- A typed encoding of boxed into safe ambients
- On the expressive power of \textsc{Klaim}-based calculi
- Leader election in rings of ambient processes
- On an open problem of Amadio and Curien: The finite antichain condition
- Safe ambients: Abstract machine and distributed implementation
- On the Relative Expressive Power of Calculi for Mobility
- Expressiveness of Process Algebras
- Secure implementations of typed channel abstractions
- A Distributed Pi-Calculus
- Functions as processes
- On the Expressiveness of Pure Mobile Ambients
- A generic type system for the Pi-calculus
- Programming Languages and Systems
- Automata, Languages and Programming
- Semantic Barbs and Biorthogonality
