Construction of Deadlock-free Designs of Communication Protocols from Observations

DOI10.1093/COMJNL/45.2.162MaRDI QIDQ4542805zbMATH OpenOpenAlexFDO

Authors

Publication date 7 January 2003

Published in The Computer Journal (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/57892c975d84ecd99fba6c0ad02497153e55f8eb

zbMATH Keywords

distributed systemsreverse engineering

Mathematics Subject Classification ID

Network protocols (68M12)

Recommendations

• scientific article; zbMATH DE number 4043216
• scientific article; zbMATH DE number 3926230
• Deadlock analysis in networks of communicating processes
• Component-Based Construction of Deadlock-Free Systems
• Static deadlock prevention in dynamically configured communication networks
• Verifying deadlock-freedom of communication fabrics
• scientific article; zbMATH DE number 1438577
• Design of Minimum-Cost Deadlock-Free Systems

Cited in

(2)

• Recovering Repetitive Sub-functions from Observations
• An approach for recovering distributed system architectures

This page was built for publication: Construction of Deadlock-free Designs of Communication Protocols from Observations

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