Deadlock in Packet Switching Networks

Anna Stramaglia; Jeroen J.A. Keiren; Hans Zantema

doi:10.1007/978-3-030-89247-0_9

Deadlock in Packet Switching Networks

Anna Stramaglia (Corresponderende auteur)
, Jeroen J.A. Keiren
, Hans Zantema

Onderzoeksoutput: Hoofdstuk in Boek/Rapport/Congresprocedure › Conferentiebijdrage › Academic › peer review

1 Citaat (Scopus)

4 Downloads (Pure)

Samenvatting

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-2	Engels
Titel	Fundamentals of Software Engineering
Subtitel	9th International Conference, FSEN 2021, Virtual Event, May 19–21, 2021, Revised Selected Papers
Redacteuren	Hossein Hojjat, Mieke Massink
Plaats van productie	Cham
Uitgeverij	Springer
Pagina's	127-141
Aantal pagina's	15
ISBN van elektronische versie	978-3-030-89247-0
ISBN van geprinte versie	978-3-030-89246-3
DOI's	https://doi.org/10.1007/978-3-030-89247-0_9
Status	Gepubliceerd - 17 okt. 2021
Evenement	9th International Conference on Fundamentals of Software Engineering, FSEN 2021 - Virtual, Online Duur: 19 mei 2021 → 21 mei 2021

Publicatie series

Naam	Lecture Notes in Computer Science (LNCS)
Volume	12818
ISSN van geprinte versie	0302-9743
ISSN van elektronische versie	1611-3349

Congres

Congres	9th International Conference on Fundamentals of Software Engineering, FSEN 2021
Stad	Virtual, Online
Periode	19/05/21 → 21/05/21

Bibliografische nota

Publisher Copyright:
© IFIP International Federation for Information Processing 2021

Toegang tot document

10.1007/978-3-030-89247-0_9

pdfDefinitieve gepubliceerde versie, 416 KBLicentie: TAVERNE

Andere bestanden en links

Link naar publicatie in Scopus

Deadlock in packet switching networks
Stramaglia, A., Keiren, J. J. A. & Zantema, H., 15 jan. 2021, (CoRR).
Onderzoeksoutput: Werkdocument › Preprint › Academic

Bestand

Citeer dit

Stramaglia, A., Keiren, J. J. A., & Zantema, H. (2021). Deadlock in Packet Switching Networks. In H. Hojjat, & M. Massink (editors), Fundamentals of Software Engineering: 9th International Conference, FSEN 2021, Virtual Event, May 19–21, 2021, Revised Selected Papers (blz. 127-141). (Lecture Notes in Computer Science (LNCS); Vol. 12818). Springer. https://doi.org/10.1007/978-3-030-89247-0_9

@inproceedings{dc9b08baac124efd976280d4004aa8cf,

title = "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.",

keywords = "Packet switching network, Deadlock, Model checking",

author = "Anna Stramaglia and Keiren, \{Jeroen J.A.\} and Hans Zantema",

note = "Publisher Copyright: {\textcopyright} IFIP International Federation for Information Processing 2021; 9th International Conference on Fundamentals of Software Engineering, FSEN 2021 ; Conference date: 19-05-2021 Through 21-05-2021",

year = "2021",

month = oct,

day = "17",

doi = "10.1007/978-3-030-89247-0\_9",

language = "English",

isbn = "978-3-030-89246-3",

series = "Lecture Notes in Computer Science (LNCS)",

publisher = "Springer",

pages = "127--141",

editor = "Hossein Hojjat and Mieke Massink",

booktitle = "Fundamentals of Software Engineering",

address = "Germany",

}

Stramaglia, A , Keiren, JJA & Zantema, H 2021, Deadlock in Packet Switching Networks. in H Hojjat & M Massink (reds.), Fundamentals of Software Engineering: 9th International Conference, FSEN 2021, Virtual Event, May 19–21, 2021, Revised Selected Papers. Lecture Notes in Computer Science (LNCS), vol. 12818, Springer, Cham, blz. 127-141, 9th International Conference on Fundamentals of Software Engineering, FSEN 2021, Virtual, Online, 19/05/21. https://doi.org/10.1007/978-3-030-89247-0_9

Deadlock in Packet Switching Networks. / Stramaglia, Anna (Corresponderende auteur); Keiren, Jeroen J.A.; Zantema, Hans.
Fundamentals of Software Engineering: 9th International Conference, FSEN 2021, Virtual Event, May 19–21, 2021, Revised Selected Papers. reds. / Hossein Hojjat; Mieke Massink. Cham: Springer, 2021. blz. 127-141 (Lecture Notes in Computer Science (LNCS); Vol. 12818).

Onderzoeksoutput: Hoofdstuk in Boek/Rapport/Congresprocedure › Conferentiebijdrage › Academic › peer review

TY - GEN

T1 - Deadlock in Packet Switching Networks

AU - Stramaglia, Anna

AU - Keiren, Jeroen J.A.

AU - Zantema, Hans

PY - 2021/10/17

Y1 - 2021/10/17

N2 - 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.

AB - 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.

KW - Packet switching network

KW - Deadlock

KW - Model checking

UR - https://www.scopus.com/pages/publications/85118153294

U2 - 10.1007/978-3-030-89247-0_9

DO - 10.1007/978-3-030-89247-0_9

M3 - Conference contribution

SN - 978-3-030-89246-3

T3 - Lecture Notes in Computer Science (LNCS)

SP - 127

EP - 141

BT - Fundamentals of Software Engineering

A2 - Hojjat, Hossein

A2 - Massink, Mieke

PB - Springer

CY - Cham

T2 - 9th International Conference on Fundamentals of Software Engineering, FSEN 2021

Y2 - 19 May 2021 through 21 May 2021

ER -

Deadlock in Packet Switching Networks

Samenvatting

Publicatie series

Congres

Bibliografische nota

Toegang tot document

Andere bestanden en links

Vingerafdruk

Onderzoekersoutput

Deadlock in packet switching networks

Citeer dit