{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,10]],"date-time":"2026-02-10T19:04:57Z","timestamp":1770750297149,"version":"3.50.0"},"publisher-location":"Cham","reference-count":27,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032111753","type":"print"},{"value":"9783032111760","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,11,23]],"date-time":"2025-11-23T00:00:00Z","timestamp":1763856000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,11,23]],"date-time":"2025-11-23T00:00:00Z","timestamp":1763856000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026]]},"DOI":"10.1007\/978-3-032-11176-0_25","type":"book-chapter","created":{"date-parts":[[2025,11,22]],"date-time":"2025-11-22T20:11:24Z","timestamp":1763842284000},"page":"437-447","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Explicit Model Checking Engine for\u00a0Reachability Analysis of\u00a0Colored Petri Nets"],"prefix":"10.1007","author":[{"given":"Emil Normann","family":"Brandt","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jens Emil Fink","family":"H\u00f8jriis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kira St\u00e6hr","family":"Pedersen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ji\u0159\u00ed","family":"Srba","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,11,23]]},"reference":[{"key":"25_CR1","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1007\/978-3-031-67695-6_3","volume-title":"TOOLympics Challenge 2023","author":"N Amat","year":"2025","unstructured":"Amat, N.: Behind the scene of the model checking contest, analysis of results from 2018 to 2023. In: Beyer, D., Hartmanns, A., Kordon, F. (eds.) TOOLympics Challenge 2023, pp. 52\u201389. Springer Nature Switzerland, Cham (2025)"},{"key":"25_CR2","doi-asserted-by":"publisher","first-page":"2741","DOI":"10.1080\/00207540412331312688","volume":"42","author":"B Berthomieu","year":"2004","unstructured":"Berthomieu, B., Ribet, P.O., Vernadat, F.: The tool TINA \u2013 construction of abstract state spaces for Petri nets and time Petri nets. Int. J. Prod. Res. 42, 2741\u20132756 (2004)","journal-title":"Int. J. Prod. Res."},{"issue":"3\u20134","key":"25_CR3","first-page":"297","volume":"189","author":"A Bilgram","year":"2023","unstructured":"Bilgram, A., Jensen, P., Pedersen, T., Srba, J., Taankvist, P.: Methods for efficient unfolding of colored Petri nets. Fund. Inform. 189(3\u20134), 297\u2013320 (2023)","journal-title":"Fund. Inform."},{"key":"25_CR4","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1007\/978-3-030-89716-1_5","volume-title":"Reachability Problems","author":"A Bilgram","year":"2021","unstructured":"Bilgram, A., Jensen, P.G., Pedersen, T., Srba, J., Taankvist, P.H.: Improvements in unfolding of colored Petri nets. In: Bell, P.C., Totzke, P., Potapov, I. (eds.) Reachability Problems, pp. 69\u201384. Springer International Publishing, Cham (2021)"},{"key":"25_CR5","doi-asserted-by":"crossref","unstructured":"Billington, J., et al.: The Petri net markup language: concepts, technology, and tools. In: 24th International Conference on Applications and Theory of Petri Nets, pp. 483\u2013505. LNCS, Springer (2003)","DOI":"10.1007\/3-540-44919-1_31"},{"key":"25_CR6","doi-asserted-by":"publisher","unstructured":"Brandt, E.N., H\u00f8jriis, J.E.F., Pedersen, K.S., Srba, J.: Reproducibility package for \"Explicit Model Checking Engine for Reachability Analysis of Colored Petri Nets\" (2025). https:\/\/doi.org\/10.5281\/zenodo.17077809","DOI":"10.5281\/zenodo.17077809"},{"key":"25_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1007\/978-3-030-31304-3_19","volume-title":"Computational Methods in Systems Biology","author":"J Chodak","year":"2019","unstructured":"Chodak, J., Heiner, M.: Spike \u2013 Reproducible simulation experiments with configuration file branching. In: Bortolussi, L., Sanguinetti, G. (eds.) CMSB 2019. LNCS, vol. 11773, pp. 315\u2013321. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-31304-3_19"},{"key":"25_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"426","DOI":"10.1007\/978-3-030-51831-8_23","volume-title":"Application and Theory of Petri Nets and Concurrency","author":"S Dal Zilio","year":"2020","unstructured":"Dal Zilio, S.: MCC: a tool for unfolding colored petri nets in PNML format. In: Janicki, R., Sidorova, N., Chatain, T. (eds.) PETRI NETS 2020. LNCS, vol. 12152, pp. 426\u2013435. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-51831-8_23"},{"key":"25_CR9","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.: 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"},{"issue":"2","key":"25_CR10","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1023\/A:1008743212620","volume":"16","author":"J Esparza","year":"2000","unstructured":"Esparza, J., Melzer, S.: Verification of safety properties using integer programming: beyond the state equation. Form. Methods Syst. Des. 16(2), 159\u2013189 (2000). https:\/\/doi.org\/10.1023\/A:1008743212620","journal-title":"Form. Methods Syst. Des."},{"key":"25_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"398","DOI":"10.1007\/978-3-642-31131-4_22","volume-title":"Application and Theory of Petri Nets","author":"M Heiner","year":"2012","unstructured":"Heiner, M., Herajy, M., Liu, F., Rohr, C., Schwarick, M.: Snoopy \u2013 a unifying petri net tool. In: Haddad, S., Pomello, L. (eds.) PETRI NETS 2012. LNCS, vol. 7347, pp. 398\u2013407. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-31131-4_22"},{"key":"25_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1007\/978-3-642-38697-8_21","volume-title":"Application and Theory of Petri Nets and Concurrency","author":"M Heiner","year":"2013","unstructured":"Heiner, M., Rohr, C., Schwarick, M.: MARCIE \u2013 model checking and reachability analysis done efficiently. In: Colom, J.-M., Desel, J. (eds.) PETRI NETS 2013. LNCS, vol. 7927, pp. 389\u2013399. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-38697-8_21"},{"key":"25_CR13","unstructured":"H\u00f8jriis, J.E.F., Brandt, E.N., St\u00e6hr\u00a0Pedersen, K.: Github with source code of the explicit engine in verifypn (2025). https:\/\/github.com\/TAPAAL\/verifypn"},{"key":"25_CR14","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"},{"issue":"3","key":"25_CR15","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1016\/0304-3975(81)90049-9","volume":"14","author":"K Jensen","year":"1981","unstructured":"Jensen, K.: Coloured Petri nets and the invariant-method. Theoret. Comput. Sci. 14(3), 317\u2013336 (1981). https:\/\/doi.org\/10.1016\/0304-3975(81)90049-9","journal-title":"Theoret. Comput. Sci."},{"issue":"3\u20134","key":"25_CR16","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1007\/s10009-007-0038-x","volume":"9","author":"K Jensen","year":"2007","unstructured":"Jensen, K., Kristensen, L.M., Wells, L.: Coloured Petri nets and CPN tools for modelling and validation of concurrent systems. Int. J. Softw. Tools Technol. Transf. 9(3\u20134), 213\u2013254 (2007)","journal-title":"Int. J. Softw. Tools Technol. Transf."},{"key":"25_CR17","doi-asserted-by":"publisher","unstructured":"Jensen, P., Larsen, K., Srba, J.: PTrie: data structure for compressing and storing sets via prefix sharing. In: Proceedings of the 14th International Colloquium on Theoretical Aspects of Computing (ICTAC\u201917). LNCS, vol. 10580, pp. 248\u2013265. Springer (2017). https:\/\/doi.org\/10.1007\/978-3-319-67729-3_15","DOI":"10.1007\/978-3-319-67729-3_15"},{"key":"25_CR18","unstructured":"Klostergaard, A.H.: Efficient Unfolding and Approximation of Colored Petri Nets with Inhibitor Arcs. Master\u2019s thesis, AAU (2018). https:\/\/projekter.aau.dk\/projekter\/files\/281079031\/main.pdf"},{"key":"25_CR19","unstructured":"Kordon, F., et al.: Complete Results for the 2024 Edition of the Model Checking Contest (2024). https:\/\/mcc.lip6.fr\/2024\/results.php"},{"key":"25_CR20","unstructured":"Kordon, F., et al.: Complete Results for the 2025 Edition of the Model Checking Contest (2025). https:\/\/mcc.lip6.fr\/2025\/results.php"},{"key":"25_CR21","unstructured":"Marechal, A.: Token ring CPN model, available at https:\/\/mcc.lip6.fr\/2024\/models.php"},{"key":"25_CR22","doi-asserted-by":"crossref","unstructured":"McMillan, K.L.: Using unfoldings to avoid the state explosion problem in the verification of asynchronous circuits. In: Computer Aided Verification, pp. 164\u2013177. Springer (1993)","DOI":"10.1007\/3-540-56496-9_14"},{"issue":"4","key":"25_CR23","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":"25_CR24","unstructured":"Petri, C.A.: Kommunikation mit automaten (1962). https:\/\/api.semanticscholar.org\/CorpusID:117254333"},{"key":"25_CR25","doi-asserted-by":"crossref","unstructured":"Thierry-Mieg, Y.: Symbolic model-checking using its-tools. In: Tools and Algorithms for the Construction and Analysis of Systems, pp. 231\u2013237. Springer, Berlin, Heidelberg (2015)","DOI":"10.1007\/978-3-662-46681-0_20"},{"key":"25_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1007\/978-3-642-02424-5_18","volume-title":"Applications and Theory of Petri Nets","author":"M Westergaard","year":"2009","unstructured":"Westergaard, M., Evangelista, S., Kristensen, L.M.: ASAP: An extensible platform for state space analysis. In: Franceschinis, G., Wolf, K. (eds.) PETRI NETS 2009. LNCS, vol. 5606, pp. 303\u2013312. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-02424-5_18"},{"key":"25_CR27","doi-asserted-by":"crossref","unstructured":"Wolf, K.: Petri net model checking with LoLA 2. In: Application and Theory of Petri Nets and Concurrency, pp. 351\u2013362. Springer, Cham (2018)","DOI":"10.1007\/978-3-319-91268-4_18"}],"container-title":["Lecture Notes in Computer Science","Theoretical Aspects of Computing \u2013 ICTAC 2025"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-11176-0_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,2,10]],"date-time":"2026-02-10T11:09:37Z","timestamp":1770721777000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-11176-0_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,11,23]]},"ISBN":["9783032111753","9783032111760"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-11176-0_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,11,23]]},"assertion":[{"value":"23 November 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICTAC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Colloquium on Theoretical Aspects of Computing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Marrakesh","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Morocco","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 November 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 November 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ictac2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ictac2025.digital-hub.sh\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}