Contextual equivalence for higher-order pi-calculus revisited

DOI10.2168/LMCS-1(1:4)2005zbMath1125.68084OpenAlexW2951546131MaRDI QIDQ5310635

Julian Rathke, Alan Jeffrey

Publication date: 11 October 2007

Published in: Logical Methods in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2168/lmcs-1(1:4)2005

Mathematics Subject Classification ID

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

Related Items (12)

Characteristic bisimulation for higher-order session processes ⋮ Howe’s Method for Calculi with Passivation ⋮ HOCore in Coq ⋮ On the expressiveness and decidability of higher-order process calculi ⋮ More on bisimulations for higher order \(\pi\)-calculus ⋮ First-order reasoning for higher-order concurrency ⋮ Characterizing contextual equivalence in calculi with passivation ⋮ A Testing Theory for a Higher-Order Cryptographic Language ⋮ On the Semantics of Markov Automata ⋮ Behavioural equivalences for dynamic web data ⋮ On parameterization of higher-order processes ⋮ safeDpi: a language for controlling mobile code

Uses Software

• Facile

This page was built for publication: Contextual equivalence for higher-order pi-calculus revisited