Deadlock in Packet Switching Networks - Fundamentals of Software Engineering Access content directly
Conference Papers Year : 2021

Deadlock in Packet Switching Networks

Abstract

A deadlock in a packet switching network is a state in which one or more messages have not yet reached their target, yet cannot progress any further. We formalize three different notions of deadlock in the context of packet switching networks, to which we refer as global, local and weak deadlock. We establish the precise relations between these notions, and prove they characterize different sets of deadlocks. Moreover, we implement checking of deadlock freedom of packet switching networks using the symbolic model checker nuXmv. We show experimentally that the implementation is effective at finding subtle deadlock situations in packet switching networks.
Fichier principal
Vignette du fichier
506725_1_En_9_Chapter.pdf (451.21 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-04074517 , version 1 (19-04-2023)

Licence

Attribution

Identifiers

Cite

Anna Stramaglia, Jeroen Keiren, Hans Zantema. Deadlock in Packet Switching Networks. 9th International Conference on Fundamentals of Software Engineering (FSEN), May 2021, Virtual, Iran. pp.127-141, ⟨10.1007/978-3-030-89247-0_9⟩. ⟨hal-04074517⟩
8 View
0 Download

Altmetric

Share

Gmail Facebook X LinkedIn More