On the decidability of process equivalences for the -calculus

DOI10.1007/3-540-60043-4_52MaRDI QIDQ5096384zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• On the decidability of process equivalences for the \(\pi\)-calculus
• On the decidability of fragments of the asynchronous -calculus
• scientific article; zbMATH DE number 1051237
• scientific article; zbMATH DE number 1809622
• Bounds on mobility

Cites work

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

Cited in

(8)

• On deciding trace equivalences for processes
• On the decidability of process equivalences for the \(\pi\)-calculus
• scientific article; zbMATH DE number 1809622 (Why is no real title available?)
• scientific article; zbMATH DE number 3909727 (Why is no real title available?)
• On the decidability of fragments of the asynchronous -calculus
• Negative Results on Decidability and Small Model Property of Process Equations
• Undecidability of 2-Label BPP Equivalences and Behavioral Type Systems for the π-Calculus
• Programming Languages and Systems

This page was built for publication: On the decidability of process equivalences for the \(\pi\)-calculus

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