{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,25]],"date-time":"2025-10-25T22:36:33Z","timestamp":1761431793823,"version":"build-2065373602"},"publisher-location":"Cham","reference-count":42,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783032087065"},{"type":"electronic","value":"9783032087072"}],"license":[{"start":{"date-parts":[[2025,10,26]],"date-time":"2025-10-26T00:00:00Z","timestamp":1761436800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,10,26]],"date-time":"2025-10-26T00:00:00Z","timestamp":1761436800000},"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-08707-2_3","type":"book-chapter","created":{"date-parts":[[2025,10,25]],"date-time":"2025-10-25T22:33:39Z","timestamp":1761431619000},"page":"49-61","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["TAPAAL HyperLTL: A Tool for\u00a0Checking Hyperproperties of\u00a0Petri Nets"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0006-8122-7160","authenticated-orcid":false,"given":"Bruno Maria Ren\u00e9","family":"Gonzalez","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9320-9991","authenticated-orcid":false,"given":"Peter Gj\u00f8l","family":"Jensen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7798-1711","authenticated-orcid":false,"given":"Stefan","family":"Schmid","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5551-6547","authenticated-orcid":false,"given":"Ji\u0159\u00ed","family":"Srba","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8038-2453","authenticated-orcid":false,"given":"Martin","family":"Zimmermann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,10,26]]},"reference":[{"issue":"1","key":"3_CR1","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1145\/151646.151649","volume":"15","author":"M Abadi","year":"1993","unstructured":"Abadi, M., Lamport, L.: Composing specifications. ACM Trans. Program. Lang. Syst. 15(1), 73\u2013132 (1993)","journal-title":"ACM Trans. Program. Lang. Syst."},{"issue":"6","key":"3_CR2","doi-asserted-by":"publisher","first-page":"1207","DOI":"10.1017\/S0960129511000193","volume":"21","author":"G Barthe","year":"2011","unstructured":"Barthe, G., D\u2019Argenio, P.R., Rezk, T.: Secure information flow by self-composition. Math. Struct. Comput. Sci. 21(6), 1207\u20131252 (2011)","journal-title":"Math. Struct. Comput. Sci."},{"key":"3_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"694","DOI":"10.1007\/978-3-030-81685-8_33","volume-title":"Computer Aided Verification","author":"J Baumeister","year":"2021","unstructured":"Baumeister, J., Coenen, N., Bonakdarpour, B., Finkbeiner, B., S\u00e1nchez, C.: A temporal logic for asynchronous hyperproperties. In: Silva, A., Leino, K.R.M. (eds.) CAV 2021. LNCS, vol. 12759, pp. 694\u2013717. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-81685-8_33"},{"key":"3_CR4","doi-asserted-by":"crossref","unstructured":"Beutner, R., Finkbeiner, B.: Prophecy variables for hyperproperty verification. In: CSF 2022, pp. 471\u2013485. IEEE (2022)","DOI":"10.1109\/CSF54842.2022.9919658"},{"key":"3_CR5","doi-asserted-by":"crossref","unstructured":"Beutner, R., Finkbeiner, B.: AutoHyper: explicit-state model checking for HyperLTL. In: TACAS 2023, Part I. LNCS, vol. 13993, pp. 145\u2013163. Springer (2023)","DOI":"10.1007\/978-3-031-30823-9_8"},{"key":"3_CR6","doi-asserted-by":"crossref","unstructured":"Beutner, R., Finkbeiner, B.: Non-deterministic planning for hyperproperty verification. In: ICAPS 2024, pp. 25\u201330. AAAI Press (2024)","DOI":"10.1609\/icaps.v34i1.31457"},{"key":"3_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"483","DOI":"10.1007\/3-540-44919-1_31","volume-title":"Applications and Theory of Petri Nets 2003","author":"J Billington","year":"2003","unstructured":"Billington, J., et al.: The Petri Net markup language: concepts, technology, and tools. In: van der Aalst, W.M.P., Best, E. (eds.) ICATPN 2003. LNCS, vol. 2679, pp. 483\u2013505. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/3-540-44919-1_31"},{"key":"3_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/978-3-319-91268-4_8","volume-title":"Application and Theory of Petri Nets and Concurrency","author":"F B\u00f8nneland","year":"2018","unstructured":"B\u00f8nneland, F., Dyhr, J., Jensen, P.G., Johannsen, M., Srba, J.: Simplification of CTL formulae for efficient model checking of Petri nets. In: Khomenko, V., Roux, O.H. (eds.) PETRI NETS 2018. LNCS, vol. 10877, pp. 143\u2013163. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-91268-4_8"},{"key":"3_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1007\/978-3-642-14295-6_5","volume-title":"Computer Aided Verification","author":"R Brayton","year":"2010","unstructured":"Brayton, R., Mishchenko, A.: ABC: an academic industrial-strength verification tool. In: Touili, T., Cook, B., Jackson, P. (eds.) CAV 2010. LNCS, vol. 6174, pp. 24\u201340. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-14295-6_5"},{"issue":"2","key":"3_CR10","doi-asserted-by":"publisher","first-page":"779","DOI":"10.1109\/TNET.2016.2614247","volume":"25","author":"M Chiesa","year":"2017","unstructured":"Chiesa, M., Kindler, G., Schapira, M.: Traffic engineering with equal-cost-multipath: an algorithmic perspective. IEEE\/ACM Trans. Netw. 25(2), 779\u2013792 (2017)","journal-title":"IEEE\/ACM Trans. Netw."},{"key":"3_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1007\/3-540-45657-0_29","volume-title":"Computer Aided Verification","author":"A Cimatti","year":"2002","unstructured":"Cimatti, A., et al.: NuSMV 2: an OpenSource tool for symbolic model checking. In: Brinksma, E., Larsen, K.G. (eds.) CAV 2002. LNCS, vol. 2404, pp. 359\u2013364. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45657-0_29"},{"key":"3_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1007\/BFb0025774","volume-title":"Logics of Programs","author":"EM Clarke","year":"1982","unstructured":"Clarke, E.M., Emerson, E.A.: Design and synthesis of synchronization skeletons using branching time temporal logic. In: Kozen, D. (ed.) Logic of Programs 1981. LNCS, vol. 131, pp. 52\u201371. Springer, Heidelberg (1982). https:\/\/doi.org\/10.1007\/BFb0025774"},{"key":"3_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/978-3-642-54792-8_15","volume-title":"Principles of Security and Trust","author":"MR Clarkson","year":"2014","unstructured":"Clarkson, M.R., Finkbeiner, B., Koleini, M., Micinski, K.K., Rabe, M.N., S\u00e1nchez, C.: Temporal logics for hyperproperties. In: Abadi, M., Kremer, S. (eds.) POST 2014. LNCS, vol. 8414, pp. 265\u2013284. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-642-54792-8_15"},{"issue":"6","key":"3_CR14","doi-asserted-by":"publisher","first-page":"1157","DOI":"10.3233\/JCS-2009-0393","volume":"18","author":"MR Clarkson","year":"2010","unstructured":"Clarkson, M.R., Schneider, F.B.: Hyperproperties. J. Comput. Secur. 18(6), 1157\u20131210 (2010)","journal-title":"J. Comput. Secur."},{"key":"3_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/978-3-030-25540-4_7","volume-title":"Computer Aided Verification","author":"N Coenen","year":"2019","unstructured":"Coenen, N., Finkbeiner, B., S\u00e1nchez, C., Tentrup, L.: Verifying hyperliveness. In: Dillig, I., Tasiran, S. (eds.) CAV 2019, Part I. LNCS, vol. 11561, pp. 121\u2013139. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-25540-4_7"},{"issue":"2\/3","key":"3_CR16","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1007\/BF00121128","volume":"1","author":"C Courcoubetis","year":"1992","unstructured":"Courcoubetis, C., Vardi, M.Y., Wolper, P., Yannakakis, M.: Memory-efficient algorithms for the verification of temporal properties. Formal Methods Syst. Des. 1(2\/3), 275\u2013288 (1992)","journal-title":"Formal Methods Syst. Des."},{"key":"3_CR17","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":"3_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"657","DOI":"10.1007\/978-3-030-90870-6_35","volume-title":"Formal Methods","author":"O Dobe","year":"2021","unstructured":"Dobe, O., \u00c1brah\u00e1m, E., Bartocci, E., Bonakdarpour, B.: HyperProb: a model checker for probabilistic hyperproperties. In: Huisman, M., P\u0103s\u0103reanu, C., Zhan, N. (eds.) FM 2021. LNCS, vol. 13047, pp. 657\u2013666. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-90870-6_35"},{"issue":"1","key":"3_CR19","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1109\/49.265708","volume":"12","author":"DA Dunn","year":"1994","unstructured":"Dunn, D.A., Grover, W.D., MacGregor, M.H.: Comparison of k-shortest paths and maximum flow routing for network facility restoration. IEEE J. Sel. Areas Commun. 12(1), 88\u201399 (1994)","journal-title":"IEEE J. Sel. Areas Commun."},{"key":"3_CR20","unstructured":"E\u00e9n, N., Mishchenko, A., Brayton, R.K.: Efficient implementation of property directed reachability. In: FMCAD 2011, pp. 125\u2013134. FMCAD Inc. (2011)"},{"issue":"1","key":"3_CR21","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1145\/4904.4999","volume":"33","author":"EA Emerson","year":"1986","unstructured":"Emerson, E.A., Halpern, J.Y.: \u201cSometimes\u2019\u2019 and \u201cNot Never\u2019\u2019 revisited: on branching versus linear time temporal logic. J. ACM 33(1), 151\u2013178 (1986)","journal-title":"J. ACM"},{"key":"3_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1007\/978-3-319-21690-4_3","volume-title":"Computer Aided Verification","author":"B Finkbeiner","year":"2015","unstructured":"Finkbeiner, B., Rabe, M.N., S\u00e1nchez, C.: Algorithms for model checking HyperLTL and HyperCTL$$^*$$. In: Kroening, D., P\u0103s\u0103reanu, C.S. (eds.) CAV 2015, Part I. Algorithms for model checking HyperLTL and HyperCTL, vol. 9206, pp. 30\u201348. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-21690-4_3"},{"key":"3_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1007\/3-540-45608-2_6","volume-title":"Foundations of Security Analysis and Design","author":"R Focardi","year":"2001","unstructured":"Focardi, R., Gorrieri, R.: Classification of security properties. In: Focardi, R., Gorrieri, R. (eds.) FOSAD 2000. LNCS, vol. 2171, pp. 331\u2013396. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-45608-2_6"},{"key":"3_CR24","doi-asserted-by":"crossref","unstructured":"Fortz, B., Thorup, M.: Internet traffic engineering by optimizing OSPF weights. In: INFOCOM 2000, pp. 519\u2013528. IEEE Computer Society (2000)","DOI":"10.1109\/INFCOM.2000.832225"},{"key":"3_CR25","unstructured":"Gonzalez, B.M.R., Jensen, P.G., Schmid, S., Srba, J., Zimmermann, M.: Reproducibility package for \u201cTAPAAL HyperLTL: a tool for checking hyperproperties of Petri net, July 2025. https:\/\/doi.org\/10.5281\/zenodo.15854993"},{"key":"3_CR26","doi-asserted-by":"crossref","unstructured":"Hsu, T.-H., Bonakdarpour, B., Finkbeiner, B., S\u00e1nchez, C.: Bounded model checking for asynchronous hyperproperties. In: TACAS 2023, Part I. LNCS, vol. 13993, pp. 29\u201346. Springer (2023)","DOI":"10.1007\/978-3-031-30823-9_2"},{"key":"3_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1007\/978-3-030-72016-2_6","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"T-H Hsu","year":"2021","unstructured":"Hsu, T.-H., S\u00e1nchez, C., Bonakdarpour, B.: Bounded model checking for hyperproperties. In: TACAS 2021, Part I. LNCS, vol. 12651, pp. 94\u2013112. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-72016-2_6"},{"key":"3_CR28","first-page":"307","volume":"11","author":"JF Jensen","year":"2016","unstructured":"Jensen, J.F., Nielsen, T., Oestergaard, L.K., Srba, J.: TAPAAL and reachability analysis of P\/T nets. Trans. Petri Nets Other Model. Concurr. 11, 307\u2013318 (2016)","journal-title":"Trans. Petri Nets Other Model. Concurr."},{"key":"3_CR29","doi-asserted-by":"crossref","unstructured":"Jensen, P.G.,\u00a0Srba, J., Ulrik, N.J., Virenfeldt, S.M.: Automata-driven partial order reduction and guided search for LTL model checking. In: Proceedings of the 23rd International Conference on Verification, Model Checking, and Abstract Interpretation (VMCAI 2022). LNCS, vol. 13182, pp. 151\u2013173. Springer (2022)","DOI":"10.1007\/978-3-030-94583-1_8"},{"issue":"9","key":"3_CR30","doi-asserted-by":"publisher","first-page":"1765","DOI":"10.1109\/JSAC.2011.111002","volume":"29","author":"S Knight","year":"2011","unstructured":"Knight, S., Nguyen, H.X., Falkner, N., Bowden, R., Roughan, M.: The internet topology zoo. IEEE J. Sel. Areas Commun. 29(9), 1765\u20131775 (2011)","journal-title":"IEEE J. Sel. Areas Commun."},{"key":"3_CR31","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":"3_CR32","unstructured":"Mascle, C., Zimmermann, M.: The keys to decidable HyperLTL satisfiability: small models or very simple formulas. In: CSL 2020. LIPIcs, vol. 152, pp. 29:1\u201329:16. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2020)"},{"issue":"1","key":"3_CR33","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1109\/32.481534","volume":"22","author":"J McLean","year":"1996","unstructured":"McLean, J.: A general theory of composition for a class of \u201cpossibilistic\u2019\u2019 properties. IEEE Trans. Software Eng. 22(1), 53\u201367 (1996)","journal-title":"IEEE Trans. Software Eng."},{"key":"3_CR34","unstructured":"Petri, C.A.: Kommunikation mit Automaten. Ph.D. thesis, Darmstadt (1962)"},{"key":"3_CR35","doi-asserted-by":"crossref","unstructured":"Pnueli, A.: The temporal logic of programs. In: FOCS 1977, pp. 46\u201357. IEEE (1977)","DOI":"10.1109\/SFCS.1977.32"},{"key":"3_CR36","unstructured":"Rabe, M.N.: A temporal logic approach to Information-flow control. Ph.D. thesis, Saarland University (2016)"},{"key":"3_CR37","unstructured":"IEEE Computer Society: IEEE standard VHDL language reference manual. IEEE Std 1076\u20131987, pp. 1\u2013218 (1988)"},{"key":"3_CR38","unstructured":"IEEE\u00a0Computer Society: IEEE standard for Verilog hardware description language. IEEE Std 1364-2005 (Revision of IEEE Std 1364-2001), pp. 1\u2013590 (2006)"},{"key":"3_CR39","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"352","DOI":"10.1007\/11547662_24","volume-title":"Static Analysis","author":"T Terauchi","year":"2005","unstructured":"Terauchi, T., Aiken, A.: Secure information flow as a safety problem. In: Hankin, C., Siveroni, I. (eds.) SAS 2005. LNCS, vol. 3672, pp. 352\u2013367. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11547662_24"},{"key":"3_CR40","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1007\/3-540-48294-6_20","volume-title":"Static Analysis","author":"D Volpano","year":"1999","unstructured":"Volpano, D.: Safety versus Secrecy. In: Cortesi, A., Fil\u00e9, G. (eds.) SAS 1999. LNCS, vol. 1694, pp. 303\u2013311. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-48294-6_20"},{"key":"3_CR41","unstructured":"Winter, S., Zimmermann, M.: Prophecies all the way: game-based model-checking for HyperQPTL beyond $$\\forall ^*\\exists ^*$$. arXiv:2504.08575 (2025). Accepted for publication at CONCUR 2025"},{"key":"3_CR42","doi-asserted-by":"crossref","unstructured":"Zakinthinos, A., Lee, E.S.: A general theory of security properties. In: SCP 1997, pp. 94\u2013102. IEEE Computer Society (1997)","DOI":"10.1109\/SECPRI.1997.601322"}],"container-title":["Lecture Notes in Computer Science","Automated Technology for Verification and Analysis"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-08707-2_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,25]],"date-time":"2025-10-25T22:33:44Z","timestamp":1761431624000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-08707-2_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,10,26]]},"ISBN":["9783032087065","9783032087072"],"references-count":42,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-08707-2_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2025,10,26]]},"assertion":[{"value":"26 October 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ATVA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Automated Technology for Verification and Analysis","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Bengaluru","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"India","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":"27 October 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31 October 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"atva2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/conf.researchr.org\/home\/atva-2025","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}