Typed behavioural equivalences for processes in the presence of subtyping

DOI10.1017/S0960129504004281zbMath1093.68062OpenAlexW1980172083MaRDI QIDQ4653017

Julian Rathke, Matthew C. B. Hennessy

Publication date: 28 February 2005

Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0960129504004281

Mathematics Subject Classification ID

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

Related Items (12)

Controlling information release in the \(\pi\)-calculus ⋮ A theory for observational fault tolerance ⋮ Complete Lattices and Up-To Techniques ⋮ Termination in a π-calculus with subtyping ⋮ Linear logical relations and observational equivalences for session-based concurrency ⋮ Security types for dynamic web data ⋮ A theory of system behaviour in the presence of node and link failure ⋮ Open bisimulation, revisited ⋮ Counting the Cost in the Picalculus (Extended Abstract) ⋮ Linearity and bisimulation ⋮ safeDpi: a language for controlling mobile code ⋮ Towards an algebraic theory of typed mobile processes

This page was built for publication: Typed behavioural equivalences for processes in the presence of subtyping