Complete inference systems for weak bisimulation equivalences in the -calculus

DOI10.1007/3-540-59293-8_195MaRDI QIDQ5096731zbMATH OpenOpenAlexFDO

Authors Huimin Lin

Publication date 18 August 2022

Published in TAPSOFT '95: Theory and Practice of Software Development (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-59293-8_195

Mathematics Subject Classification ID

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

Recommendations

• Complete inference systems for weak bisimulation equivalences in the -calculus.
• scientific article; zbMATH DE number 1223723
• Inference systems for observation equivalences in the \(\pi\)-calculus
• A theory of bisimulation for the -calculus
• Proof systems for message-passing process algebras

Cites work

• A calculus of mobile processes. I
• A theory of bisimulation for the -calculus
• Algebraic theories for name-passing calculi
• scientific article; zbMATH DE number 42752 (Why is no real title available?)
• Symbolic bisimulations

Cited in

(10)

• Bisimulation congruence of -calculus
• Complete inference systems for weak bisimulation equivalences in the -calculus.
• Variations on mobile processes
• Inference systems for observation equivalences in the \(\pi\)-calculus
• A completeness proof for bisimulation in the pi-calculus using Isabelle
• Efficient Bisimilarities from Second-Order Reaction Semantics for π-Calculus
• scientific article; zbMATH DE number 1223723 (Why is no real title available?)
• scientific article; zbMATH DE number 1223732 (Why is no real title available?)
• Undecidability of 2-Label BPP Equivalences and Behavioral Type Systems for the π-Calculus
• Theory of interaction

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5096731)