Distributability of mobile ambients
From MaRDI portal
Publication:2216122
DOI10.1016/j.ic.2020.104608zbMath1496.68243arXiv1808.09361OpenAlexW3045831063MaRDI QIDQ2216122
Publication date: 15 December 2020
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1808.09361
Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Distributed systems (68M14)
Related Items (2)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Priorities in process algebras
- A calculus of mobile processes. I
- A calculus of mobile processes. II
- Testing equivalences for processes
- Mobile ambients
- On the computational strength of pure ambient calculi
- A structural approach to operational semantics
- Towards a unified approach to encodability and separation results for process calculi
- On Distributability of Petri Nets
- Breaking symmetries
- A Distributed Pi-Calculus
- Petri Net Distributability
- On Synchronous and Asynchronous Interaction in Distributed Systems
- Barbed bisimulation
- A Calculus of Virtually Timed Ambients
- On Distributability in Process Calculi
- Foundations of Security Analysis and Design II
This page was built for publication: Distributability of mobile ambients