Communication errors in the -calculus are undecidable

DOI10.1016/S0020-0190(99)00109-XzbMATH Open0999.68134MaRDI QIDQ1606997FDOQ1606997

Authors: António Ravara, Vasco T. Vasconcelos 

Publication date: 25 July 2002

Published in: Information Processing Letters (Search for Journal in Brave)

Recommendations

• On hierarchical communication topologies in the \(\pi\)-calculus
• Undecidability results for deterministic communicating sequential processes
• Excommunication: transforming \(\pi \)-calculus specifications to remove internal communication
• scientific article; zbMATH DE number 512777
• Publication:4508393
• Verifying identical communicating processes is undecidable
• Undecidable verification problems for programs with unreliable channels
• Undecidable verification problems for programs with unreliable channels
• The unbounded-error communication complexity of symmetric functions
• Errors in Computational Complexity Proofs for Protocols

zbMATH Keywords

undecidabilitypolyadic \(\pi\)-calculus

Mathematics Subject Classification ID

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

Cites Work

• Functions as processes
• Title not available (Why is that?)
• Title not available (Why is that?)
• An efficiency preorder for processes

This page was built for publication: Communication errors in the \(\pi\)-calculus are undecidable

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