Verifying identical communicating processes is undecidable

DOI10.1016/S0304-3975(96)00026-6zbMath0902.68127OpenAlexW1996288883MaRDI QIDQ1269916

Pierre McKenzie, Alain Finkel

Publication date: 22 October 1998

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(96)00026-6

zbMATH Keywords

boundednessreachability tree finiteness

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (5)

Automated verification of automata communicating via FIFO and bag buffers ⋮ Honesty by Typing ⋮ On the Undecidability of Asynchronous Session Subtyping ⋮ Conversation protocols: a formalism for specification and verification of reactive electronic services ⋮ Verification of programs with half-duplex communication

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• An introduction to FIFO nets - monogeneous nets: a subclass of FIFO nets
• Automates a file
• Unreliable channels are easier to verify than perfect channels
• On Communicating Finite-State Machines

This page was built for publication: Verifying identical communicating processes is undecidable