On the decidability of process equivalences for the π-calculus

DOI10.1007/3-540-60043-4_52zbMath1496.68223OpenAlexW4246520964MaRDI QIDQ5096384

Mads Dam

Publication date: 16 August 2022

Published in: Algebraic Methodology and Software Technology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-60043-4_52

Mathematics Subject Classification ID

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

Cites Work

• Symbolic bisimulations
• Modal logics for mobile processes
• CCS expressions, finite state processes, and three problems of equivalence
• A calculus of mobile processes. I
• An algebraic verification of a mobile network
• Deciding bisimulation equivalences for a class of non-finite-state programs
• Bisimulation equivalence is decidable for all context-free processes
• Graphes canoniques de graphes algébriques
• Three Partition Refinement Algorithms
• Functions as processes

This page was built for publication: On the decidability of process equivalences for the π-calculus