Deadlock absence proofs for networks of communicating processes

DOI10.1016/0020-0190(79)90065-6zbMath0456.68030OpenAlexW1968841918MaRDI QIDQ1151025

K. Mani Chandy, Jayadev Misra

Publication date: 1979

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

Full work available at URL: https://doi.org/10.1016/0020-0190(79)90065-6

zbMATH Keywords

deadlock avoidancesynchronisationcommunicating processesprocessor networksdeadlock absence proofs

Mathematics Subject Classification ID

Theory of operating systems (68N25)

Related Items

Deadlock analysis in networks of communicating processes, Verification of a class of self-timed computational networks, Deadlock absence proofs for networks of communicating processes, A proof technique for communicating sequential processes, Efficient analysis of concurrent constraint logic programs, Control machines: A new model of parallelism for compositional specifications and their effective compilation, The pursuit of deadlock freedom, Logical models of discrete even systems: a comparative exposition, A fixed point approach to parallel discrete event simulation, A weakest precondition semantics for communicating processes, On the suitability of trace semantics for modular proofs of communicating processes

Cites Work

• Unnamed Item
• Deadlock absence proofs for networks of communicating processes
• Distributed Simulation: A Case Study in Design and Verification of Distributed Programs
• Communicating sequential processes