A Formal Proof of a Necessary and Sufficient Condition for Deadlock-Free Adaptive Networks

DOI10.1007/978-3-642-14052-5_7zbMath1291.68373OpenAlexW1571136502MaRDI QIDQ5747642

Julien Schmaltz, Freek Verbeek

Publication date: 14 September 2010

Published in: Interactive Theorem Proving (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-14052-5_7

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Uses Software

• Unnamed Item

This page was built for publication: A Formal Proof of a Necessary and Sufficient Condition for Deadlock-Free Adaptive Networks