A taxonomy of process calculi for distribution and mobility
From MaRDI portal
Publication:660996
DOI10.1007/S00446-010-0120-6zbMATH Open1231.68169OpenAlexW2019329654MaRDI QIDQ660996FDOQ660996
Authors: Daniele Gorla 
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
Recommendations
Logic in computer science (03B70) Distributed systems (68M14) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Cites Work
- Functions as processes
- A calculus of mobile processes. I
- A Distributed Pi-Calculus
- Title not available (Why is that?)
- Testing equivalences for processes
- The \(\pi\)-calculus: A theory of mobile processes
- Title not available (Why is that?)
- Resource access control in systems of mobile agents
- Mobile ambients
- Towards a unified approach to encodability and separation results for process calculi
- Expressiveness of process algebras
- On the computational strength of pure ambient calculi
- A generic type system for the \(\pi\)-calculus
- On an open problem of Amadio and Curien: The finite antichain condition
- Programming Languages and Systems
- What is a ``good encoding of guarded choice?
- Decoding choice encodings
- Title not available (Why is that?)
- On the expressiveness of pure mobile ambients
- On the expressive power of movement and restriction in pure mobile ambients
- Symmetric electoral systems for ambient calculi
- On the relative expressive power of calculi for mobility
- Semantic Barbs and Biorthogonality
- Comparing communication primitives via their relative expressive power
- On modelling mobility
- Towards a behavioural theory of access and mobility control in distributed systems
- A typed encoding of boxed into safe ambients
- On the expressive power of \textsc{Klaim}-based calculi
- Leader election in rings of ambient processes
- Safe ambients: Abstract machine and distributed implementation
- Secure implementations of typed channel abstractions
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Automata, Languages and Programming
Cited In (18)
- On the expressiveness of \(\pi\)-calculus for encoding mobile ambients
- Full abstraction for expressiveness: history, myths and facts
- On the relative expressive power of calculi for mobility
- Title not available (Why is that?)
- On distributability in process calculi
- Session-based concurrency, declaratively
- The seal calculus
- On the expressive power of \textsc{Klaim}-based calculi
- On the validity of encodings of the synchronous in the asynchronous \(\pi\)-calculus
- On the expressiveness of symmetric communication
- Expressiveness of concurrent intensionality
- On the relative expressiveness of higher-order session processes
- Comparing session type systems derived from linear logic
- Lexically scoped distribution: what you see is what you get
- On the distributability of mobile ambients
- Mixed choice in session types
- Towards a Visual Definition of a Process in a Distributed Environment
- On the expressive power of \textsc{Klaim}-based calculi
Uses Software
This page was built for publication: A taxonomy of process calculi for distribution and mobility
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q660996)
