{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,7]],"date-time":"2025-10-07T08:45:03Z","timestamp":1759826703250,"version":"3.40.3"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031336195"},{"type":"electronic","value":"9783031336201"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-3-031-33620-1_7","type":"book-chapter","created":{"date-parts":[[2023,5,27]],"date-time":"2023-05-27T08:02:05Z","timestamp":1685174525000},"page":"123-144","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Taking Complete Finite Prefixes to\u00a0High Level, Symbolically"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7934-820X","authenticated-orcid":false,"given":"Nick","family":"W\u00fcrdemann","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1470-5074","authenticated-orcid":false,"given":"Thomas","family":"Chatain","sequence":"additional","affiliation":[]},{"given":"Stefan","family":"Haar","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,5,28]]},"reference":[{"key":"7_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"495","DOI":"10.1007\/10722167_37","volume-title":"Computer Aided Verification","author":"PA Abdulla","year":"2000","unstructured":"Abdulla, P.A., Iyer, S.P., Nyl\u00e9n, A.: Unfoldings of unbounded Petri nets. In: Emerson, E.A., Sistla, A.P. (eds.) CAV 2000. LNCS, vol. 1855, pp. 495\u2013507. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/10722167_37"},{"key":"7_CR2","unstructured":"Best, E., Grahlmann, B.: Programming Environment based on Petri nets - Documentation and User Guide Version 1.4 (1995). https:\/\/uol.de\/f\/2\/dept\/informatik\/ag\/parsys\/PEP1.4_man.ps.gz?v=1346500853"},{"key":"7_CR3","unstructured":"Chatain, T.: Symbolic unfoldings of high-level Petri nets and application to supervision of distributed systems, Ph. D. thesis, Universit \u00e9 de Rennes (2006). https:\/\/www.sudoc.fr\/246936924"},{"key":"7_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/978-3-642-13675-7_11","volume-title":"Applications and Theory of Petri Nets","author":"T Chatain","year":"2010","unstructured":"Chatain, T., Fabre, E.: Factorization properties of symbolic unfoldings of colored Petri nets. In: Lilius, J., Penczek, W. (eds.) PETRI NETS 2010. LNCS, vol. 6128, pp. 165\u2013184. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-13675-7_11"},{"key":"7_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"326","DOI":"10.1007\/978-3-540-30232-2_21","volume-title":"Formal Techniques for Networked and Distributed Systems \u2013 FORTE 2004","author":"T Chatain","year":"2004","unstructured":"Chatain, T., Jard, C.: Symbolic diagnosis of partially observable concurrent systems. In: de Frutos-Escrig, D., N\u00fa\u00f1ez, M. (eds.) FORTE 2004. LNCS, vol. 3235, pp. 326\u2013342. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-30232-2_21"},{"key":"7_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/11767589_8","volume-title":"Petri Nets and Other Models of Concurrency - ICATPN 2006","author":"T Chatain","year":"2006","unstructured":"Chatain, T., Jard, C.: Complete finite prefixes of symbolic unfoldings of safe time Petri nets. In: Donatelli, S., Thiagarajan, P.S. (eds.) ICATPN 2006. LNCS, vol. 4024, pp. 125\u2013145. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11767589_8"},{"key":"7_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/978-3-540-27793-4_10","volume-title":"Applications and Theory of Petri Nets 2004","author":"J Desel","year":"2004","unstructured":"Desel, J., Juh\u00e1s, G., Neumair, C.: Finite unfoldings of unbounded Petri nets. In: Cortadella, J., Reisig, W. (eds.) ICATPN 2004. LNCS, vol. 3099, pp. 157\u2013176. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-27793-4_10"},{"key":"7_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/3-540-45711-9_12","volume-title":"Formal and Natural Computing","author":"H Ehrig","year":"2002","unstructured":"Ehrig, H., Hoffmann, K., Padberg, J., Baldan, P., Heckel, R.: High-level net processes. In: Brauer, W., Ehrig, H., Karhum\u00e4ki, J., Salomaa, A. (eds.) Formal and Natural Computing. LNCS, vol. 2300, pp. 191\u2013219. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45711-9_12"},{"issue":"6","key":"7_CR9","doi-asserted-by":"publisher","first-page":"575","DOI":"10.1007\/BF01463946","volume":"28","author":"J Engelfriet","year":"1991","unstructured":"Engelfriet, J.: Branching processes of Petri nets. Acta Informatica 28(6), 575\u2013591 (1991). https:\/\/doi.org\/10.1007\/BF01463946","journal-title":"Acta Informatica"},{"issue":"3","key":"7_CR10","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1023\/A:1014746130920","volume":"20","author":"J Esparza","year":"2002","unstructured":"Esparza, J., R\u00f6mer, S., Vogler, W.: An improvement of McMillan\u2019s unfolding algorithm. Formal Methods Syst. Des. 20(3), 285\u2013310 (2002). https:\/\/doi.org\/10.1023\/A:1014746130920","journal-title":"Formal Methods Syst. Des."},{"key":"7_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"706","DOI":"10.1007\/978-3-540-71209-1_55","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"F Herbreteau","year":"2007","unstructured":"Herbreteau, F., Sutre, G., Tran, T.Q.: Unfolding concurrent well-structured transition systems. In: Grumberg, O., Huth, M. (eds.) TACAS 2007. LNCS, vol. 4424, pp. 706\u2013720. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-71209-1_55"},{"key":"7_CR12","doi-asserted-by":"publisher","unstructured":"Jensen, K.: Coloured Petri nets - basic concepts, analysis methods and practical use - volume 1, Second Edition. Monographs in Theoretical Computer Science. An EATCS Series. Springer, Heidelberg (1996). https:\/\/doi.org\/10.1007\/978-3-662-03241-1","DOI":"10.1007\/978-3-662-03241-1"},{"key":"7_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"458","DOI":"10.1007\/3-540-36577-X_34","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"V Khomenko","year":"2003","unstructured":"Khomenko, V., Koutny, M.: Branching processes of high-level Petri nets. In: Garavel, H., Hatcliff, J. (eds.) TACAS 2003. LNCS, vol. 2619, pp. 458\u2013472. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/3-540-36577-X_34"},{"issue":"1","key":"7_CR14","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/BF01384314","volume":"6","author":"KL McMillan","year":"1995","unstructured":"McMillan, K.L.: A technique of state space search based on unfolding. Formal Methods Syst. Des. 6(1), 45\u201365 (1995). https:\/\/doi.org\/10.1007\/BF01384314","journal-title":"Formal Methods Syst. Des."},{"key":"7_CR15","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/0304-3975(81)90112-2","volume":"13","author":"M Nielsen","year":"1981","unstructured":"Nielsen, M., Plotkin, G.D., Winskel, G.: Petri nets, event structures and domains, part I. Theor. Comput. Sci. 13, 85\u2013108 (1981). https:\/\/doi.org\/10.1016\/0304-3975(81)90112-2","journal-title":"Theor. Comput. Sci."},{"key":"7_CR16","unstructured":"Presburger, M.: \u00fcber die Vollst\u00e4ndigkeit eines gewissen Systems der Arithmetik ganzer Zahlen, in welchem die Addition als einzige Operation hervortritt. In: Proc. Comptes-rendus du I Congr\u00e9s des Math\u00e9maticiens des Pays Slaves, Varsovie 1929, pp. 92\u2013101 (1930)"},{"key":"7_CR17","doi-asserted-by":"publisher","unstructured":"Reisig, W.: Understanding petri nets - modeling techniques, analysis methods, case studies. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-33278-4","DOI":"10.1007\/978-3-642-33278-4"},{"key":"7_CR18","doi-asserted-by":"crossref","unstructured":"W\u00fcrdemann, N., Chatain, T., Haar, S.: Taking complete finite prefixes to high level, symbolically (Full Version) (2023). https:\/\/hal.inria.fr\/hal-04029490","DOI":"10.1007\/978-3-031-33620-1_7"}],"container-title":["Lecture Notes in Computer Science","Application and Theory of Petri Nets and Concurrency"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-33620-1_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,17]],"date-time":"2023-06-17T23:08:49Z","timestamp":1687043329000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-33620-1_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031336195","9783031336201"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-33620-1_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"28 May 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"PETRI NETS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Applications and Theory of Petri Nets and Concurrency","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Lisbon","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Portugal","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 June 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 June 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"44","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"apn2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/petrinets2023.deec.fct.unl.pt\/","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":"47","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":"21","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":"0","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":"45% - 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":"4","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":"5","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)"}}]}}