{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T03:56:27Z","timestamp":1743134187910,"version":"3.40.3"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031077265"},{"type":"electronic","value":"9783031077272"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-07727-2_14","type":"book-chapter","created":{"date-parts":[[2022,6,1]],"date-time":"2022-06-01T01:12:12Z","timestamp":1654045932000},"page":"249-267","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Kaki: Concurrent Update Synthesis for\u00a0Regular Policies via\u00a0Petri Games"],"prefix":"10.1007","author":[{"given":"Nicklas S.","family":"Johansen","sequence":"first","affiliation":[]},{"given":"Lasse B.","family":"K\u00e6r","sequence":"additional","affiliation":[]},{"given":"Andreas L.","family":"Madsen","sequence":"additional","affiliation":[]},{"given":"Kristian \u00d8.","family":"Nielsen","sequence":"additional","affiliation":[]},{"given":"Ji\u0159\u00ed","family":"Srba","sequence":"additional","affiliation":[]},{"given":"Rasmus G.","family":"Tollund","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,6,1]]},"reference":[{"key":"14_CR1","doi-asserted-by":"publisher","unstructured":"Cao, Z., Wang, Z., Zegura, E.W.: Performance of hashing-based schemes for internet load balancing. In: Proceedings IEEE INFOCOM 2000, The Conference on Computer Communications, Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies, Reaching the Promised Land of Communications, Tel Aviv, Israel, 26\u201330 March 2000, pp. 332\u2013341. IEEE Computer Society (2000). https:\/\/doi.org\/10.1109\/INFCOM.2000.832203","DOI":"10.1109\/INFCOM.2000.832203"},{"key":"14_CR2","doi-asserted-by":"crossref","unstructured":"Christesen, N., Glavind, M., Schmid, S., Srba, J.: Latte: Improving the latency of transiently consistent network update schedules. In: IFIP PERFORMANCE 2020. Performance Evaluation Review, vol. 48, no. 3, pp. 14\u201326. ACM (2020)","DOI":"10.1145\/3453953.3453957"},{"key":"14_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"492","DOI":"10.1007\/978-3-642-28756-5_36","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"A David","year":"2012","unstructured":"David, A., Jacobsen, L., Jacobsen, M., J\u00f8rgensen, K.Y., M\u00f8ller, M.H., Srba, J.: TAPAAL 2.0: integrated development environment for Timed-Arc Petri Nets. In: Flanagan, C., K\u00f6nig, B. (eds.) TACAS 2012. LNCS, vol. 7214, pp. 492\u2013497. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-28756-5_36"},{"key":"14_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1007\/978-3-030-76983-3_7","volume-title":"Application and Theory of Petri Nets and Concurrency","author":"M Didriksen","year":"2021","unstructured":"Didriksen, M., et al.: Automatic synthesis of transiently correct network updates via petri games. In: Buchs, D., Carmona, J. (eds.) PETRI NETS 2021. LNCS, vol. 12734, pp. 118\u2013137. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-76983-3_7"},{"key":"14_CR5","doi-asserted-by":"publisher","unstructured":"Didriksen, M., et al.: Artefact for: automatic synthesis of transiently correct network updates via petri games, February 2021. https:\/\/doi.org\/10.5281\/zenodo.4501982","DOI":"10.5281\/zenodo.4501982"},{"key":"14_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1007\/978-3-030-53291-8_5","volume-title":"Computer Aided Verification","author":"B Finkbeiner","year":"2020","unstructured":"Finkbeiner, B., Gieseking, M., Hecking-Harbusch, J., Olderog, E.-R.: AdamMC: a model checker for petri nets with transits against flow-LTL. In: Lahiri, S.K., Wang, C. (eds.) CAV 2020. LNCS, vol. 12225, pp. 64\u201376. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-53291-8_5"},{"issue":"2","key":"14_CR7","doi-asserted-by":"publisher","first-page":"1435","DOI":"10.1109\/COMST.2018.2876749","volume":"21","author":"K Foerster","year":"2019","unstructured":"Foerster, K., Schmid, S., Vissicchio, S.: Survey of consistent software-defined network updates. IEEE Commun. Surv. Tutor. 21(2), 1435\u20131461 (2019)","journal-title":"IEEE Commun. Surv. Tutor."},{"key":"14_CR8","doi-asserted-by":"crossref","unstructured":"Hopps, C., et al.: Analysis of an equal-cost multi-path algorithm. Tech. rep., RFC 2992, November 2000","DOI":"10.17487\/rfc2992"},{"key":"14_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1007\/978-3-662-53401-4_16","volume-title":"Transactions on Petri Nets and Other Models of Concurrency XI","author":"JF Jensen","year":"2016","unstructured":"Jensen, J.F., Nielsen, T., Oestergaard, L.K., Srba, J.: TAPAAL and reachability analysis of P\/T nets. In: Koutny, M., Desel, J., Kleijn, J. (eds.) Transactions on Petri Nets and Other Models of Concurrency XI. LNCS, vol. 9930, pp. 307\u2013318. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53401-4_16"},{"key":"14_CR10","doi-asserted-by":"crossref","unstructured":"Jensen, P., Larsen, K., Srba, J.: Real-time strategy synthesis for timed-arc Petri net games via discretization. In: Proceedings of the 23rd International SPIN Symposium on Model Checking of Software (SPIN\u201916). LNCS, vol. 9641, pp. 129\u2013146. Springer-Verlag (2016)","DOI":"10.1007\/978-3-319-32582-8_9"},{"key":"14_CR11","doi-asserted-by":"publisher","DOI":"10.5281\/zenodo.6379555","author":"N Johansen","year":"2022","unstructured":"Johansen, N., K\u00e6r, L., Madsen, A., Nielsen, K., Srba, J., Tollund, R.: Artefact for Kaki: Concurrent update synthesis for regular policies via Petri games (2022). https:\/\/doi.org\/10.5281\/zenodo.6379555","journal-title":"Artefact for Kaki: Concurrent update synthesis for regular policies via Petri games"},{"key":"14_CR12","doi-asserted-by":"publisher","unstructured":"Knight, S., Nguyen, H.X., Falkner, N., Bowden, R.A., Roughan, M.: The internet topology zoo. IEEE J. Sel. Areas Commun. 29(9), 1765\u20131775 (2011), https:\/\/doi.org\/10.1109\/JSAC.2011.111002","DOI":"10.1109\/JSAC.2011.111002"},{"key":"14_CR13","doi-asserted-by":"crossref","unstructured":"Liu, A.X., Meiners, C.R., Torng, E.: TCAM razor: a systematic approach towards minimizing packet classifiers in TCAMs. IEEE\/ACM Trans. Netw. 18(2), 490\u2013500 (2010), http:\/\/doi.acm.org\/10.1145\/1816262.1816274","DOI":"10.1109\/TNET.2009.2030188"},{"issue":"1","key":"14_CR14","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1145\/2964791.2901476","volume":"44","author":"A Ludwig","year":"2016","unstructured":"Ludwig, A., Dudycz, S., Rost, M., Schmid, S.: Transiently secure network updates. ACM SIGMETRICS Perform. Eval. Rev. 44(1), 273\u2013284 (2016)","journal-title":"ACM SIGMETRICS Perform. Eval. Rev."},{"key":"14_CR15","doi-asserted-by":"publisher","unstructured":"Ludwig, A., Marcinkowski, J., Schmid, S.: Scheduling loop-free network updates: It\u2019s good to relax! In: Georgiou, C., Spirakis, P.G. (eds.) Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing, PODC 2015, Donostia-San Sebasti\u00e1n, Spain, 21\u201323 July 2015. pp. 13\u201322. ACM (2015). https:\/\/doi.org\/10.1145\/2767386.2767412","DOI":"10.1145\/2767386.2767412"},{"key":"14_CR16","doi-asserted-by":"publisher","unstructured":"Ludwig, A., Rost, M., Foucard, D., Schmid, S.: Good network updates for bad packets: waypoint enforcement beyond destination-based routing policies. In: Katz-Bassett, E., Heidemann, J.S., Godfrey, B., Feldmann, A. (eds.) Proceedings of the 13th ACM Workshop on Hot Topics in Networks, HotNets-XIII, Los Angeles, CA, USA, 27\u201328 October 2014. pp. 15:1\u201315:7. ACM (2014). https:\/\/doi.org\/10.1145\/2670518.2673873","DOI":"10.1145\/2670518.2673873"},{"key":"14_CR17","doi-asserted-by":"publisher","unstructured":"McClurg, J., Hojjat, H., \u010cern\u00fd, P., Foster, N.: Efficient synthesis of network updates. SIGPLAN Not. 50(6), 196\u2013207 (2015). https:\/\/doi.org\/10.1145\/2813885.2737980","DOI":"10.1145\/2813885.2737980"},{"issue":"4","key":"14_CR18","doi-asserted-by":"publisher","first-page":"541","DOI":"10.1109\/5.24143","volume":"77","author":"T Murata","year":"1989","unstructured":"Murata, T.: Petri nets: properties, analysis and applications. Proc. IEEE 77(4), 541\u2013580 (1989)","journal-title":"Proc. IEEE"},{"key":"14_CR19","doi-asserted-by":"publisher","unstructured":"Pere\u00edni, P., Kuzniar, M., Canini, M., Kosti\u0107, D.: ESPRES: transparent SDN update scheduling. In: Proceedings of the Third Workshop on Hot Topics in Software Defined Networking, pp. 73\u201378. HotSDN 2014, Association for Computing Machinery, New York, NY, USA (2014).https:\/\/doi.org\/10.1145\/2620728.2620747","DOI":"10.1145\/2620728.2620747"},{"key":"14_CR20","doi-asserted-by":"crossref","unstructured":"Reitblatt, M., Foster, N., Rexford, J., Schlesinger, C., Walker, D.: Abstractions for network update. In: Eggert, L., Ott, J., Padmanabhan, V.N., Varghese, G. (eds.) ACM SIGCOMM 2012 Conference, Helsinki, Finland, pp. 323\u2013334. ACM (2012)","DOI":"10.1145\/2377677.2377748"},{"key":"14_CR21","doi-asserted-by":"publisher","unstructured":"Schneider, T., Birkner, R., Vanbever, L.: Snowcap: synthesizing network-wide configuration updates. In: Kuipers, F.A., Caesar, M.C. (eds.) ACM SIGCOMM 2021 Conference, Virtual Event, USA, 23\u201327 August 2021, pp. 33\u201349. ACM (2021). https:\/\/doi.org\/10.1145\/3452296.3472915","DOI":"10.1145\/3452296.3472915"},{"key":"14_CR22","doi-asserted-by":"crossref","unstructured":"Vissicchio, S., Cittadini, L.: FLIP the (flow) table: fast lightweight policy-preserving SDN updates. In: 35th Annual IEEE International Conference on Computer Communications, INFOCOM 2016, San Francisco, CA, USA, 10\u201314 April 2016, pp. 1\u20139. IEEE (2016)","DOI":"10.1109\/INFOCOM.2016.7524419"}],"container-title":["Lecture Notes in Computer Science","Integrated Formal Methods"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-07727-2_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,7]],"date-time":"2022-06-07T19:20:30Z","timestamp":1654629630000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-07727-2_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031077265","9783031077272"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-07727-2_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"1 June 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IFM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Integrated Formal Methods","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Lugano","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Switzerland","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 June 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 June 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ifm2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.ifmconference.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"46","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"14","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"30% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Also includes: 1 abstract of an invited talk, 2 invited papers, 7 extended abstracts of presentations accepted at PhD symposium","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}