Symmetric electoral systems for ambient calculi
From MaRDI portal
Publication:2475806
DOI10.1016/j.ic.2007.08.005zbMath1133.68059MaRDI QIDQ2475806
Maria Grazia Vigliotti, Iain Phillips
Publication date: 11 March 2008
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ic.2007.08.005
68Q85: Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)
Related Items
On the expressiveness and decidability of higher-order process calculi, A taxonomy of process calculi for distribution and mobility, Theory of interaction, On the validity of encodings of the synchronous in the asynchronous \(\pi\)-calculus, Towards a unified approach to encodability and separation results for process calculi, Replacement freeness: a criterion for separating process calculi, Tutorial on separation results in process calculi via leader election problems, On the Expressiveness of the π-Calculus and the Mobile Ambients, On the expressiveness of π-calculus for encoding mobile ambients
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the existence of symmetric algorithms to find leaders in networks of communicating sequential processes
- A calculus of mobile processes. II
- Mobile ambients
- On the computational strength of pure ambient calculi
- What is a ``good encoding of guarded choice?
- Resource access control in systems of mobile agents
- On the expressive power of movement and restriction in pure mobile ambients
- Leader election in rings of ambient processes
- The seal calculus
- Process Algebra
- Communicating sequential processes
- Introduction to Distributed Algorithms
- Encoding Distributed Areas and Local Communication into the π-Calculus
- Foundations of Software Science and Computation Structures
