Proof Pearl: A Formal Proof of Dally and Seitz' Necessary and Sufficient Condition for Deadlock-Free Routing in Interconnection Networks.
Freek VerbeekJulien SchmaltzPublished in: J. Autom. Reason. (2012)
Keyphrases
- formal proof
- sufficient conditions
- deadlock free
- interconnection networks
- routing algorithm
- theorem prover
- ad hoc networks
- routing protocol
- wireless sensor networks
- shortest path
- lyapunov function
- network traffic
- sensor nodes
- energy consumption
- fault tolerant
- optimal policy
- sensor networks
- end to end
- learning algorithm
- wireless networks
- parallel computers
- dynamic programming
- database systems
- image segmentation