Towards an algebraic theory of typed mobile processes
From MaRDI portal
Publication:817843
DOI10.1016/j.tcs.2005.10.029zbMath1086.68090OpenAlexW2123074865MaRDI QIDQ817843
Publication date: 20 March 2006
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2005.10.029
Related Items
A Behavioural Theory for a π-calculus with Preorders, A behavioural theory for a \(\pi\)-calculus with preorders, Linear logical relations and observational equivalences for session-based concurrency
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A fully abstract semantics for causality in the \(\pi\)-calculus
- A calculus of mobile processes. II
- Complete inference systems for weak bisimulation equivalences in the \(\pi\)-calculus.
- Resource access control in systems of mobile agents
- Algebraic theories for name-passing calculi
- Testing equivalence for mobile processes
- A theory of bisimulation for the \(\pi\)-calculus
- Termination of context-sensitive rewriting
- Typed behavioural equivalences for processes in the presence of subtyping