Towards an algebraic theory of typed mobile processes
From MaRDI portal
Publication:817843
DOI10.1016/J.TCS.2005.10.029zbMATH Open1086.68090OpenAlexW2123074865MaRDI QIDQ817843FDOQ817843
Authors: Davide Sangiorgi, Yuxin Deng 
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
Recommendations
Cites Work
- A fully abstract semantics for causality in the \(\pi\)-calculus
- Title not available (Why is that?)
- Title not available (Why is that?)
- A calculus of mobile processes. II
- The \(\pi\)-calculus: A theory of mobile processes
- Title not available (Why is that?)
- Resource access control in systems of mobile agents
- Termination of context-sensitive rewriting
- A theory of bisimulation for the \(\pi\)-calculus
- Typed behavioural equivalences for processes in the presence of subtyping
- Testing equivalence for mobile processes
- Algebraic theories for name-passing calculi
- Complete inference systems for weak bisimulation equivalences in the \(\pi\)-calculus.
Cited In (11)
- Typed behavioural equivalences for processes in the presence of subtyping
- An algebra of behavioural types
- A calculus of mobile processes. II
- Title not available (Why is that?)
- A behavioural theory for a \(\pi\)-calculus with preorders
- Linear logical relations and observational equivalences for session-based concurrency
- Typed behavioural equivalences for processes in the presence of subtyping
- A behavioural theory for a \(\pi\)-calculus with preorders
- Two Session Typing Systems for Higher-Order Mobile Processes
- Programming Languages and Systems
- Process types as a descriptive tool for interaction. Control and the pi-calculus
This page was built for publication: Towards an algebraic theory of typed mobile processes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q817843)
