On the expressiveness of π-calculus for encoding mobile ambients
From MaRDI portal
Publication:3130299
DOI10.1017/S0960129516000256zbMath1387.68164MaRDI QIDQ3130299
Publication date: 11 January 2018
Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)
Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Related Items (3)
The \texttt{link}-calculus for open multiparty interactions ⋮ A formal approach to open multiparty interactions ⋮ A process algebraic approach to reaction systems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A decentralised graphical implementation of mobile ambients
- A taxonomy of process calculi for distribution and mobility
- \(\pi\)-calculus, internal mobility, and agent-passing calculi
- A calculus of mobile processes. I
- Mobile ambients
- Computing with membranes
- Symmetric electoral systems for ambient calculi
- Open Multiparty Interaction
- On the Expressiveness of the π-Calculus and the Mobile Ambients
- Encoding Mobile Ambients into the π-Calculus
- On the expressive power of recursion, replication and iteration in process calculi
- A Flat Process Calculus for Nested Membrane Interactions
- Brane Calculi
- Global Computing. Programming Environments, Languages, Security, and Analysis of Systems
This page was built for publication: On the expressiveness of π-calculus for encoding mobile ambients