Deadlock in Packet Switching Networks

A deadlock in a packet switching network is state which one or more messages have not yet reached their target, cannot progress any further. We formalize three different notions of the context networks, to we refer as global, local and weak deadlock. establish precise relations between these notions, prove they characterize sets deadlocks. Moreover, implement checking freedom networks using symbolic model checker nuXmv. show experimentally that implementation effective at finding subtle situations networks.