Complete inference systems for weak bisimulation equivalences in the \(\pi\)-calculus.

DOI10.1016/S0890-5401(02)00014-7zbMath1045.68098OpenAlexW2043338352MaRDI QIDQ1400579

Huimin Lin

Publication date: 13 August 2003

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0890-5401(02)00014-7

zbMATH Keywords

\(\pi\)-calculusProcess algebraBisimulationMobile processesProof systemsSymbolic bisimulation

Mathematics Subject Classification ID

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

Related Items (8)

Finite axiomatization for symbolic probabilistic \(\pi \)-calculus ⋮ Axiomatizing Lüttgen \& Vogler's ready simulation for finite processes in \(\mathrm{CLL}_{R}\) ⋮ Theory of interaction ⋮ Replacement freeness: a criterion for separating process calculi ⋮ A complete symbolic bisimulation for full applied pi calculus ⋮ Explicit substitutions for \(\pi\)-congruences ⋮ Equivalence Checking for a Finite Higher Order π-Calculus ⋮ Towards an algebraic theory of typed mobile processes

Cites Work

• Unnamed Item
• Symbolic bisimulations
• Modal logics for mobile processes
• A calculus of mobile processes. II
• Proof systems for message-passing process algebras
• Algebraic theories for name-passing calculi
• Testing equivalence for mobile processes
• A theory of bisimulation for the \(\pi\)-calculus
• A symbolic semantics for the \(\pi\)-calculus

This page was built for publication: Complete inference systems for weak bisimulation equivalences in the \(\pi\)-calculus.