{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,21]],"date-time":"2025-11-21T12:28:06Z","timestamp":1763728086275,"version":"3.37.3"},"reference-count":41,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"2","license":[{"start":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T00:00:00Z","timestamp":1648771200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T00:00:00Z","timestamp":1648771200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T00:00:00Z","timestamp":1648771200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100001821","name":"Vienna Science and Technology Fund","doi-asserted-by":"publisher","award":["ICT19-045"],"award-info":[{"award-number":["ICT19-045"]}],"id":[{"id":"10.13039\/501100001821","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Independent Research Fund Denmark (DFF) project Quantitative Analysis and Synthesis of Network Protocols"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE\/ACM Trans. Networking"],"published-print":{"date-parts":[[2022,4]]},"DOI":"10.1109\/tnet.2021.3126572","type":"journal-article","created":{"date-parts":[[2021,11,18]],"date-time":"2021-11-18T21:53:36Z","timestamp":1637272416000},"page":"766-781","source":"Crossref","is-referenced-by-count":6,"title":["Automata-Theoretic Approach to Verification of MPLS Networks Under Link Failures"],"prefix":"10.1109","volume":"30","author":[{"given":"Ingo van","family":"Duijn","sequence":"first","affiliation":[{"name":"Department of Computer Science, Aalborg University, Aalborg, Denmark"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peter Gjol","family":"Jensen","sequence":"additional","affiliation":[{"name":"Department of Computer Science, Aalborg University, Aalborg, Denmark"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jesper Stenbjerg","family":"Jensen","sequence":"additional","affiliation":[{"name":"Department of Computer Science, Aalborg University, Aalborg, Denmark"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Troels Beck","family":"Krogh","sequence":"additional","affiliation":[{"name":"Department of Computer Science, Aalborg University, Aalborg, Denmark"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jonas Sand","family":"Madsen","sequence":"additional","affiliation":[{"name":"Department of Computer Science, Aalborg University, Aalborg, Denmark"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7798-1711","authenticated-orcid":false,"given":"Stefan","family":"Schmid","sequence":"additional","affiliation":[{"name":"Faculty of Computer Science, University of Vienna, Vienna, Austria"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5551-6547","authenticated-orcid":false,"given":"Jiri","family":"Srba","sequence":"additional","affiliation":[{"name":"Department of Computer Science, Aalborg University, Aalborg, Denmark"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marc Tom","family":"Thorgersen","sequence":"additional","affiliation":[{"name":"Department of Computer Science, Aalborg University, Aalborg, Denmark"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/2934872.2934909"},{"key":"ref2","first-page":"217","article-title":"Efficient network reachability analysis using a succinct control plane representation","volume-title":"Proc. 12th USENIX Symp. Oper. Syst. Design Implement. (OSDI)","author":"Fayaz"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2009.2020981"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.17487\/rfc5286"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2014.6848157"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.17487\/rfc8001"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/MNET.2004.1301021"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/3387514.3405900"},{"key":"ref9","first-page":"201","article-title":"Tiramisu: Fast multilayer network verification","volume-title":"Proc. 17th USENIX Symp. Netw. Syst. Design Implement. (NSDI)","author":"Abhashkumar"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/2535838.2535862"},{"key":"ref11","first-page":"99","article-title":"Metha: Network verifiers need to be correct too!","volume-title":"Proc. NSDI","author":"Birkner"},{"key":"ref12","first-page":"469","article-title":"A general approach to network configuration analysis","volume-title":"Proc. 12nd USENIX Symp. Netw. Syst. Design Implement. (NSDI)","author":"Fogel"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/3098822.3098834"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/2934872.2934876"},{"key":"ref15","first-page":"953","article-title":"Plankton: Scalable network configuration verification through model checking","volume-title":"Proc. 17th USENIX Symp. Netw. Syst. Design Implement. (NSDI)","author":"Prabhu"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/2983990.2984012"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/3386367.3431308"},{"key":"ref18","first-page":"113","article-title":"Header space analysis: Static checking for networks","volume-title":"Proc. 9th USENIX Conf. Netw. Syst. Design Implement. (NSDI)","author":"Kazemian"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2018.8486261"},{"key":"ref20","first-page":"579","article-title":"NetComplete: Practical network-wide configuration synthesis with autocompletion","volume-title":"Proc. 15th USENIX Symp. Netw. Syst. Design Implement. (NSDI)","author":"El-Hassany"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-63390-9_14"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1145\/2043164.2018470"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1145\/2342441.2342452"},{"key":"ref24","first-page":"87","article-title":"Libra: Divide and conquer to verify forwarding tables in huge networks","volume-title":"Proc. 11th USENIX Symp. Netw. Syst. Design Implement. (NSDI)","author":"Zeng"},{"key":"ref25","first-page":"1","article-title":"WNetKAT: A weighted SDN programming and verification language","volume-title":"Proc. 20th Int. Conf. Princ. Distrib. Syst. (OPODIS)","author":"Larsen"},{"key":"ref26","first-page":"1","article-title":"Undecidable problems for probabilistic network programming","volume-title":"Proc. MFCS","volume":"83","author":"Kahn"},{"article-title":"Model-checking pushdown systems","year":"2002","author":"Schwoon","key":"ref27"},{"volume-title":"Human Error to Blame in Minnesota 911 Outage","year":"2018","author":"Tribune","key":"ref28"},{"volume-title":"Google Routing Blunder Sent Japan\u2019s Internet Dark on Friday","year":"2017","author":"Chirgwin","key":"ref29"},{"key":"ref30","article-title":"Why (and how) networks should run themselves","author":"Feamster","year":"2017","journal-title":"arXiv:1710.11583"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1145\/3281411.3281432"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2012.2187924"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-49498-1_12"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/COMST.2021.3063980"},{"volume-title":"Introduction to the Theory of Computation","year":"2006","author":"Sipser","key":"ref35"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4613-8928-6_19"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1007\/10722167_20"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1145\/363347.363387"},{"key":"ref39","first-page":"529","article-title":"Canonical regular expressions and minimal state graphs for definite events","volume":"12","author":"Brzozowski","year":"1962","journal-title":"Math. Theory Automata"},{"article-title":"Experiments for automata theoretic approach to verification of MPLS networks under link failures","year":"2020","author":"Jensen","key":"ref40"},{"volume-title":"Show Route Forwarding-Table, Technical Documentation","year":"2018","key":"ref41"}],"container-title":["IEEE\/ACM Transactions on Networking"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/90\/9758081\/09619760.pdf?arnumber=9619760","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,12]],"date-time":"2024-01-12T00:45:57Z","timestamp":1705020357000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9619760\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,4]]},"references-count":41,"journal-issue":{"issue":"2"},"URL":"https:\/\/doi.org\/10.1109\/tnet.2021.3126572","relation":{},"ISSN":["1063-6692","1558-2566"],"issn-type":[{"type":"print","value":"1063-6692"},{"type":"electronic","value":"1558-2566"}],"subject":[],"published":{"date-parts":[[2022,4]]}}}