Normal Bisimulations in Calculi with Passivation

DOI10.1007/978-3-642-00596-1_19zbMath1234.68303OpenAlexW1773175139MaRDI QIDQ3617734

Sergueï Lenglet, Alan Schmitt, Jean-Bernard Stefani

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

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (7)

Reversibility in the higher-order \(\pi\)-calculus ⋮ Howe’s Method for Calculi with Passivation ⋮ Parameterizing higher-order processes on names and processes ⋮ On the expressiveness and decidability of higher-order process calculi ⋮ Unnamed Item ⋮ Characterizing contextual equivalence in 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

This page was built for publication: Normal Bisimulations in Calculi with Passivation