A theory of bisimulation for the -calculus
From MaRDI portal
Publication:1901699
DOI10.1007/S002360050036zbMATH Open0835.68072OpenAlexW2027689693WikidataQ56019903 ScholiaQ56019903MaRDI QIDQ1901699FDOQ1901699
Publication date: 15 November 1995
Published in: Acta Informatica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s002360050036
bisimulationaxiomatisationtransition systemcompleteness proofscompleteness proof\(pi\)-calculusautomated-verficationautomated-verification
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Specification and verification (program logics, model checking, etc.) (68Q60) Logic in computer science (03B70) Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Functions as processes
- Calculi for synchrony and asynchrony
- A calculus of mobile processes. I
- Algebra of communicating processes with abstraction
- A proof system for communicating processes with value-passing
Cited In (92)
- A partition refinement algorithm for the \(\pi\)-calculus
- Understanding the mismatch combinator in chi calculus
- A π-calculus with explicit substitutions: The late semantics
- On bisimulations for the asynchronous π-calculus
- G-reactive systems as coalgebras
- Relating Coalgebraic Notions of Bisimulation
- A Categorical Model of the Fusion Calculus
- Multisets and structural congruence of the pi-calculus with replication
- A presheaf environment for the explicit fusion calculus
- Encoding cryptographic primitives in a calculus with polyadic synchronisation
- On the expressiveness of interaction
- Explicit fusions
- A Category of Explicit Fusions
- Undecidability of 2-Label BPP Equivalences and Behavioral Type Systems for the π-Calculus
- Coalgebraic Symbolic Semantics
- Constraints as processes
- On bisimulations for the asynchronous \(\pi\)-calculus
- Small bisimulations for reasoning about higher-order imperative programs
- A congruence rule format for name-passing process calculi
- A fully abstract model for the \(\pi\)-calculus.
- SPEC: An Equivalence Checker for Security Protocols
- On quasi-open bisimulation
- Some congruence properties for \(\pi\)-calculus bisimilarities
- A \(\pi\)-calculus with explicit substitutions
- Variable binding operators in transition system specifications
- A complexity analysis of bisimilarity for value-passing processes
- Reactive systems, (semi-)saturated semantics and coalgebras on presheaves
- Computing strong and weak bisimulations for psi-calculi
- Open Bisimulation for the Concurrent Constraint Pi-Calculus
- Coalgebraic minimization of HD-automata for the \(\pi\)-calculus using polymorphic types
- Deciding framed bisimilarity
- Complete inference systems for weak bisimulation equivalences in the π-calculus
- On well-founded and recursive coalgebras
- Comparing higher-order encodings in logical frameworks and tile logic
- A coordination approach to mobile components
- A fully abstract denotational semantics for the \(\pi\)-calculus
- Observational congruences for dynamically reconfigurable tile systems
- Structured coalgebras and minimal HD-automata for the \(\pi\)-calculus
- \(\pi\)-calculus in (Co)inductive-type theory
- Tau laws for pi calculus
- Comparing operational models of name-passing process calculi
- A synchronous \(\pi\)-calculus
- Fair ambients
- A Complete, Co-inductive Syntactic Theory of Sequential Control and State
- A coalgebraic theory of reactive systems
- A hierarchy of equivalences for asynchronous calculi
- Complete inference systems for weak bisimulation equivalences in the \(\pi\)-calculus.
- Towards an algebraic theory of typed mobile processes
- Title not available (Why is that?)
- Bisimulation congruence of \(\chi\)-calculus
- A complete symbolic bisimulation for full applied pi calculus
- On Bisimulation Theory in Linear Higher-Order π-Calculus
- A behavioural theory for a \(\pi\)-calculus with preorders
- Normal Bisimulations in Calculi with Passivation
- Distinguishing and relating higher-order and first-order processes by expressiveness
- On the expressiveness of internal mobility in name-passing calculi
- Bisimulation Congruences in the Calculus of Looping Sequences
- Variations on mobile processes
- Calculating Invariants as Coreflexive Bisimulations
- Computing maximal weak and other bisimulations
- Trustworthy Global Computing
- Processes against tests: on defining contextual equivalences
- Theory of interaction
- From CML to its process algebra
- Locality and interleaving semantics in calculi for mobile processes
- A multiset semantics for the pi-calculus with replication
- Compositional analysis of protocol equivalence in the applied \(\pi \)-calculus using quasi-open bisimilarity
- Verifying quantum communication protocols with ground bisimulation
- Efficient Bisimilarities from Second-Order Reaction Semantics for π-Calculus
- FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
- When privacy fails, a formula describes an attack: a complete and compositional verification method for the applied \(\pi\)-calculus
- Open bisimulation, revisited
- Nominal SOS
- A semantic framework for open processes
- Comparing the expressiveness of the \(\pi \)-calculus and CCS
- Symbolic Bisimulation for Quantum Processes
- Behavioural equivalences for dynamic web data
- Title not available (Why is that?)
- A compositional coalgebraic model of fusion calculus
- On the role of names in reasoning about \(\lambda\)-tree syntax specifications
- Two cotensors in one: presentations of algebraic theories for local state and fresh names
- Title not available (Why is that?)
- Explicit substitutions for \(\pi\)-congruences
- Replacement freeness: a criterion for separating process calculi
- Stateful applied pi calculus: observational equivalence and labelled bisimilarity
- Processes, systems \& tests: defining contextual equivalences
- Divergence and unique solution of equations
- Title not available (Why is that?)
- Title not available (Why is that?)
- Formalising Observer Theory for Environment-Sensitive Bisimulation
- Constructing weak simulations from linear implications for processes with private names
- Title not available (Why is that?)
This page was built for publication: A theory of bisimulation for the \(\pi\)-calculus
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1901699)
