On quasi-open bisimulation

DOI10.1016/J.TCS.2004.10.041zbMath1077.68060OpenAlexW2131851771MaRDI QIDQ557789

Yuxi Fu

Publication date: 30 June 2005

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

Full work available at URL: https://doi.org/10.1016/j.tcs.2004.10.041

zbMATH Keywords

\(\pi\)-calculusaxiomatizationopen bisimulationquasi-open bisimulation

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (8)

Fair ambients ⋮ Distinguishing and relating higher-order and first-order processes by expressiveness ⋮ Theory of interaction ⋮ Parameterizing higher-order processes on names and processes ⋮ Unnamed Item ⋮ Open bisimulation, revisited ⋮ On the expressiveness of interaction ⋮ Applying a testing approach to the Calculus of Fair Ambients

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Symbolic bisimulations
• A complete inference system for a class of regular behaviours
• A calculus of mobile processes. I
• A complete axiomatisation for observational congruence of finite-state behaviours
• Tau laws for pi calculus
• Algebraic theories for name-passing calculi
• A theory of bisimulation for the \(\pi\)-calculus

This page was built for publication: On quasi-open bisimulation