Deadlock analysis in networks of communicating processes

DOI10.1007/BF01784721zbMath0717.68006OpenAlexW3160274653MaRDI QIDQ2638755

A. W. Roscoe, Stephen Brookes

Publication date: 1991

Published in: Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01784721

zbMATH Keywords

deadlocknetworks of communicating processes

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10)

Related Items

A semantics for concurrent separation logic, Efficient verification of concurrent systems using local-analysis-based approximations and SAT solving, Deadlock-freedom in component systems with architectural constraints, Efficient analysis of concurrent constraint logic programs, Logical models of discrete even systems: a comparative exposition, Discovering and correcting a deadlock in a channel implementation

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The pursuit of deadlock freedom
• Reasoning about networks with many identical finite state processes
• Deadlock absence proofs for networks of communicating processes
• A Proof System for Communicating Sequential Processes
• Guarded commands, nondeterminacy and formal derivation of programs
• Communicating sequential processes
• Concurrent Processes and Their Syntax