Deadlock in packet switching networks

Research output: Working paperPreprintAcademic

33 Downloads (Pure)

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.
Original languageEnglish
Volumeabs/2101.06015
Publication statusPublished - 15 Jan 2021

Publication series

NameCoRR
PublisherSchloss Dagstuhl - Leibniz-Zentrum für Informatik
ISSN (Print)2331-8422

Bibliographical note

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)

Keywords

  • cs.NI
  • cs.LO

Fingerprint

Dive into the research topics of 'Deadlock in packet switching networks'. Together they form a unique fingerprint.
  • Deadlock in Packet Switching Networks

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

    Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

Cite this