Deadlock in packet switching networks

Onderzoeksoutput: WerkdocumentPreprintAcademic

35 Downloads (Pure)


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.
Originele taal-2Engels
StatusGepubliceerd - 15 jan. 2021

Publicatie series

UitgeverijSchloss Dagstuhl - Leibniz-Zentrum für Informatik
ISSN van geprinte versie2331-8422

Bibliografische nota

This is a version with full proofs of the preprint that was submitted to FSEN 2021, and accepted for publication in that conference (published in Springer LNCS)


Duik in de onderzoeksthema's van 'Deadlock in packet switching networks'. Samen vormen ze een unieke vingerafdruk.
  • Deadlock in Packet Switching Networks

    Stramaglia, A., Keiren, J. J. A. & Zantema, H., 17 okt. 2021, Fundamentals of Software Engineering - 9th International Conference, FSEN 2021, Virtual Event, May 19-21, 2021, Revised Selected Papers. Hojjat, H. & Massink, M. (uitgave). Springer, blz. 127-141 15 blz. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 12818 LNCS).

    Onderzoeksoutput: Hoofdstuk in Boek/Rapport/CongresprocedureConferentiebijdrageAcademicpeer review

Citeer dit