Bisimulation for higher-order process calculi
From MaRDI portal
Publication:675066
DOI10.1006/INCO.1996.0096zbMATH Open0876.68042OpenAlexW2033051110MaRDI QIDQ675066FDOQ675066
Authors: Davide Sangiorgi 
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
Recommendations
- On context bisimulation for parameterized higher-order processes
- Sound bisimulations for higher-order distributed process calculus
- Characteristic bisimulation for higher-order session processes
- Characteristic bisimulation for higher-order session processes
- Publication:3028334
- Bisimulation for Feller-Dynkin processes
- Bisimulations for a Distributed Higher Order π-Calculus
- Computable processes and bisimulation equivalence
- scientific article; zbMATH DE number 4119652
Cited In (61)
- On parameterization of higher-order processes
- Parameterizing higher-order processes on names and processes
- First-order semantics for higher-order processes
- Convenient category of processes and simulations I: Modulo strong bisimilarity
- Higher-order processes with parameterization over names and processes
- A Testing Theory for a Higher-Order Cryptographic Language
- Reversibility in the higher-order \(\pi\)-calculus
- On the observational theory of the CPS-calculus
- Equivalence Checking for a Finite Higher Order π-Calculus
- A menagerie of non-finitely based process semantics over BPA* – from ready simulation to completed traces
- On the expressiveness of interaction
- Asynchronous process calculi: The first- and higher-order paradigms
- Bisimulations in calculi modelling membranes
- Howe’s Method for Calculi with Passivation
- Full abstractness for a functional/concurrent language with higher-order value-passing
- SOS formats and meta-theory: 20 years after
- The seal calculus
- CONCUR 2005 – Concurrency Theory
- Communication and mobility control in boxed ambients
- On context bisimulation for parameterized higher-order processes
- Process calculus based upon evaluation to committed form
- Process calculus based upon evaluation to committed form
- \(\pi\)-calculus with noisy channels
- Nominal SOS
- On the expressive power of \textsc{Klaim}-based calculi
- A complexity analysis of bisimilarity for value-passing processes
- Light logics and higher-order processes
- Towards a unified approach to encodability and separation results for process calculi
- Foundations of Software Science and Computation Structures
- Characteristic bisimulation for higher-order session processes
- Characteristic bisimulation for higher-order session processes
- More on bisimulations for higher order \(\pi\)-calculus
- Bisimulation by unification
- On the interactive power of higher-order processes extended with parameterization
- On an open problem of Amadio and Curien: The finite antichain condition
- \(\mathrm{HO}\pi\) in Coq
- On the expressiveness and decidability of higher-order process calculi
- Bisimulation and co-induction: some problems
- Bisimilarity of open terms.
- Basic observables for a calculus for global computing
- First-order reasoning for higher-order concurrency
- Reversible session-based pi-calculus
- Characterizing contextual equivalence in calculi with passivation
- Higher-order psi-calculi
- Title not available (Why is that?)
- Title not available (Why is that?)
- Recursive equations in higher-order process calculi
- Fair ambients
- HOCore in Coq
- Towards `up to context' reasoning about higher-order processes
- Space-aware ambients and processes
- Characterisations of testing preorders for a finite probabilistic \(\pi\)-calculus
- Process Bisimulation Via a Graphical Encoding
- Sound bisimulations for higher-order distributed process calculus
- Normal Bisimulations in Calculi with Passivation
- Distinguishing and relating higher-order and first-order processes by expressiveness
- Contextual labelled semantics for higher-order process calculi
- Decidable fragments of a higher order calculus with locations
- A Logic for Distributed Higher Order π-Calculus
- Comparing communication primitives via their relative expressive power
- Theory of interaction
This page was built for publication: Bisimulation for higher-order process calculi
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q675066)
