Normal Bisimulations in Calculi with Passivation
From MaRDI portal
Publication:3617734
DOI10.1007/978-3-642-00596-1_19zbMath1234.68303MaRDI QIDQ3617734
Jean-Bernard Stefani, Sergueï Lenglet, Alan Schmitt
Publication date: 31 March 2009
Published in: Foundations of Software Science and Computational Structures (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-00596-1_19
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, Characterizing contextual equivalence in calculi with passivation, Howe’s Method for Calculi with Passivation, Normal Bisimulations in Calculi with Passivation
Cites Work
- Unnamed Item
- Unnamed Item
- On the expressiveness and decidability of higher-order process calculi
- Bisimulation for higher-order process calculi
- Plain CHOCS. A second generation calculus for higher order processes
- Mobile ambients
- Proving congruence of bisimulation in functional programming languages
- The seal calculus
- Behavioral theory for mobile ambients
- Normal Bisimulations in Calculi with Passivation
- Global Computing
- FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
- Foundations of Software Science and Computation Structures