Typed behavioural equivalences for processes in the presence of subtyping

DOI10.1016/S1571-0661(04)00309-3zbMath1268.68127MaRDI QIDQ2841263

Julian Rathke, Matthew C. B. Hennessy

Publication date: 24 July 2013

Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)

Mathematics Subject Classification ID

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

Related Items (4)

Towards a behavioural theory of access and mobility control in distributed systems ⋮ A fully abstract may testing semantics for concurrent objects ⋮ The security pi-calculus and non-interference ⋮ Typed behavioural equivalences for processes in the presence of subtyping

Uses Software

• Pict
• KLAIM

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A fully abstract semantics for causality in the \(\pi\)-calculus
• On bisimulations for the asynchronous \(\pi\)-calculus
• Testing equivalences for processes
• Trust and partial typing in open systems of mobile agents
• Resource access control in systems of mobile agents
• A theory of bisimulation for a fragment of concurrent ML with local names
• Typed behavioural equivalences for processes in the presence of subtyping
• Behavioral equivalence in the polymorphic pi-calculus
• A calculus of mobile agents

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