Bisimulation for higher-order process calculi
From MaRDI portal
Publication:675066
DOI10.1006/inco.1996.0096zbMath0876.68042OpenAlexW2033051110MaRDI QIDQ675066
Publication date: 18 November 1997
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/5c669a71dc39c26543e02a00a8ad711a88eb421d
Related Items (47)
Characteristic bisimulation for higher-order session processes ⋮ Reversibility in the higher-order \(\pi\)-calculus ⋮ Nominal SOS ⋮ Howe’s Method for Calculi with Passivation ⋮ Basic observables for a calculus for global computing ⋮ Space-aware ambients and processes ⋮ SOS formats and meta-theory: 20 years after ⋮ Fair ambients ⋮ HOCore in Coq ⋮ Distinguishing and relating higher-order and first-order processes by expressiveness ⋮ A Logic for Distributed Higher Order π-Calculus ⋮ Theory of interaction ⋮ Parameterizing higher-order processes on names and processes ⋮ On the expressiveness and decidability of higher-order process calculi ⋮ Characterisations of testing preorders for a finite probabilistic \(\pi\)-calculus ⋮ Light logics and higher-order processes ⋮ More on bisimulations for higher order \(\pi\)-calculus ⋮ Unnamed Item ⋮ Towards a unified approach to encodability and separation results for process calculi ⋮ First-order reasoning for higher-order concurrency ⋮ Characterizing contextual equivalence in calculi with passivation ⋮ A Testing Theory for a Higher-Order Cryptographic Language ⋮ Bisimulations in calculi modelling membranes ⋮ Reversible session-based pi-calculus ⋮ On the expressiveness of interaction ⋮ First–order Semantics for Higher–order Processes ⋮ On the observational theory of the CPS-calculus ⋮ Higher-order psi-calculi ⋮ On the expressive power of \textsc{Klaim}-based calculi ⋮ Unnamed Item ⋮ On the interactive power of higher-order processes extended with parameterization ⋮ \(\mathrm{HO}\pi\) in Coq ⋮ Recursive equations in higher-order process calculi ⋮ Towards `up to context' reasoning about higher-order processes ⋮ Normal Bisimulations in Calculi with Passivation ⋮ Comparing communication primitives via their relative expressive power ⋮ Equivalence Checking for a Finite Higher Order π-Calculus ⋮ On parameterization of higher-order processes ⋮ Full abstractness for a functional/concurrent language with higher-order value-passing ⋮ Process calculus based upon evaluation to committed form ⋮ The seal calculus ⋮ \(\pi\)-calculus with noisy channels ⋮ Communication and mobility control in boxed ambients ⋮ On an open problem of Amadio and Curien: The finite antichain condition ⋮ Asynchronous process calculi: The first- and higher-order paradigms ⋮ Bisimilarity of open terms. ⋮ Bisimulation and Co-induction: Some Problems
This page was built for publication: Bisimulation for higher-order process calculi
