Computing bisimulations for finite-control \(\pi\)-calculus

DOI10.1007/BF02951922zbMath0954.68040OpenAlexW2016748987MaRDI QIDQ1966507

Huimin Lin

Publication date: 7 March 2000

Published in: Journal of Computer Science and Technology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02951922

zbMATH Keywords

mobile processessymbolic bisimulation

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18)

Related Items

Equivalence checking 40 years after: a review of bisimulation tools ⋮ On-the-fly bisimilarity checking for fresh-register automata ⋮ Computing strong and weak bisimulations for psi-calculi ⋮ Equivalence Checking for a Finite Higher Order π-Calculus

Uses Software

• MWB

Cites Work

• Symbolic bisimulations
• A calculus of mobile processes. I
• Proof systems for message-passing process algebras
• A symbolic semantics for the \(\pi\)-calculus
• Unnamed Item