Exposure to deadlock for communicating processes is hard to detect

DOI10.1016/0020-0190(85)90033-XzbMath0575.68021OpenAlexW2160455496MaRDI QIDQ1064050

Thomas Räuchle, Sam Toueg

Publication date: 1985

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

Full work available at URL: https://doi.org/10.1016/0020-0190(85)90033-x

zbMATH Keywords

undecidabilityvalidationFIFO channelscorrectness of communication protocolsglobal state analysisreachability of global deadlock states

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Theory of operating systems (68N25)

Related Items

On the analysis of cooperation and antagonism in networks of communicating processes, The complexity of reachability in distributed communicating processes, Boundedness, empty channel detection, and synchronization for communicating finite automata, Analysis of a class of communicating finite state machines

Cites Work

• State machines and assertions: An integrated approach to modeling and verification of distributed systems
• Verifying concurrent processes using temporal logic
• On Communicating Finite-State Machines
• Protocol validation by fair progress state exploration
• Unnamed Item
• Unnamed Item