{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T04:13:58Z","timestamp":1743135238595,"version":"3.40.3"},"publisher-location":"Cham","reference-count":40,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030518301"},{"type":"electronic","value":"9783030518318"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-51831-8_4","type":"book-chapter","created":{"date-parts":[[2020,6,29]],"date-time":"2020-06-29T23:05:05Z","timestamp":1593471905000},"page":"69-88","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["On the High Complexity of Petri Nets $$\\omega $$-Languages"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6461-2941","authenticated-orcid":false,"given":"Olivier","family":"Finkel","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,6,30]]},"reference":[{"key":"4_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1007\/BFb0017144","volume-title":"Mathematical Foundations of Computer Science 1988","author":"H Carstensen","year":"1988","unstructured":"Carstensen, H.: Infinite behaviour of deterministic Petri nets. In: Chytil, M.P., Koubek, V., Janiga, L. (eds.) MFCS 1988. LNCS, vol. 324, pp. 210\u2013219. Springer, Heidelberg (1988). \n                    https:\/\/doi.org\/10.1007\/BFb0017144"},{"key":"4_CR2","unstructured":"Castro, J., Cucker, F.: Nondeterministic $$\\omega $$-computations and the analytical hierarchy. J. Math. Logik und Grundlagen d. Math 35, 333\u2013342 (1989)"},{"key":"4_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0304-3975(78)90002-6","volume":"6","author":"R Cohen","year":"1978","unstructured":"Cohen, R., Gold, A.: $$\\omega $$-computations on Turing machines. Theor. Comput. Sci. 6, 1\u201323 (1978)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"4_CR4","doi-asserted-by":"publisher","first-page":"56","DOI":"10.2307\/2694911","volume":"66","author":"J Duparc","year":"2001","unstructured":"Duparc, J.: Wadge hierarchy and Veblen hierarchy: part 1: Borel sets of finite rank. J. Symb. Logic 66(1), 56\u201386 (2001)","journal-title":"J. Symb. Logic"},{"issue":"3","key":"4_CR5","doi-asserted-by":"publisher","first-page":"1253","DOI":"10.1016\/S0304-3975(02)00567-4","volume":"290","author":"J Duparc","year":"2003","unstructured":"Duparc, J.: A hierarchy of deterministic context free $$\\omega $$-languages. Theor. Comput. Sci. 290(3), 1253\u20131300 (2003)","journal-title":"Theor. Comput. Sci."},{"issue":"1\u20132","key":"4_CR6","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/S0304-3975(00)00111-0","volume":"257","author":"J Duparc","year":"2001","unstructured":"Duparc, J., Finkel, O., Ressayre, J.P.: Computer science and the fine structure of Borel sets. Theor. Comput. Sci. 257(1\u20132), 85\u2013105 (2001)","journal-title":"Theor. Comput. Sci."},{"key":"4_CR7","unstructured":"Duparc, J., Finkel, O., Ressayre, J.P.: The Wadge hierarchy of Petri nets $$\\omega $$-languages. In: Special Volume in Honor of Victor Selivanov at the Occasion of his Sixtieth Birthday, Logic, Computation, Hierarchies, Ontos Mathematical Logic, vol. 4, pp. 109\u2013138. De Gruyter, Berlin (2014). \n                    http:\/\/hal.archives-ouvertes.fr\/hal-00743510"},{"issue":"1","key":"4_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0304-3975(93)90349-X","volume":"110","author":"J Engelfriet","year":"1993","unstructured":"Engelfriet, J., Hoogeboom, H.J.: X-automata on $$\\omega $$-words. Theor. Comput. Sci. 110(1), 1\u201351 (1993)","journal-title":"Theor. Comput. Sci."},{"key":"4_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1007\/3-540-65306-6_20","volume-title":"Lectures on Petri Nets I: Basic Models","author":"J Esparza","year":"1998","unstructured":"Esparza, J.: Decidability and complexity of Petri net problems\u2014An introduction. In: Reisig, W., Rozenberg, G. (eds.) ACPN 1996. LNCS, vol. 1491, pp. 374\u2013428. Springer, Heidelberg (1998). \n                    https:\/\/doi.org\/10.1007\/3-540-65306-6_20"},{"key":"4_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1007\/3-540-44802-0_26","volume-title":"Computer Science Logic","author":"O Finkel","year":"2001","unstructured":"Finkel, O.: An effective extension of the Wagner hierarchy to blind counter automata. In: Fribourg, L. (ed.) CSL 2001. LNCS, vol. 2142, pp. 369\u2013383. Springer, Heidelberg (2001). \n                    https:\/\/doi.org\/10.1007\/3-540-44802-0_26"},{"issue":"1\u20132","key":"4_CR11","doi-asserted-by":"publisher","first-page":"669","DOI":"10.1016\/S0304-3975(00)00405-9","volume":"262","author":"O Finkel","year":"2001","unstructured":"Finkel, O.: Topological properties of omega context free languages. Theor. Comput. Sci. 262(1\u20132), 669\u2013697 (2001)","journal-title":"Theor. Comput. Sci."},{"issue":"3","key":"4_CR12","doi-asserted-by":"publisher","first-page":"1385","DOI":"10.1016\/S0304-3975(02)00042-7","volume":"290","author":"O Finkel","year":"2003","unstructured":"Finkel, O.: Borel hierarchy and omega context free languages. Theor. Comput. Sci. 290(3), 1385\u20131405 (2003)","journal-title":"Theor. Comput. Sci."},{"issue":"5","key":"4_CR13","doi-asserted-by":"publisher","first-page":"813","DOI":"10.1017\/S0960129506005597","volume":"16","author":"O Finkel","year":"2006","unstructured":"Finkel, O.: Borel ranks and Wadge degrees of omega context free languages. Math. Struct. Comput. Sci. 16(5), 813\u2013840 (2006)","journal-title":"Math. Struct. Comput. Sci."},{"issue":"1","key":"4_CR14","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/s11786-008-0045-7","volume":"2","author":"O Finkel","year":"2008","unstructured":"Finkel, O.: Wadge degrees of infinitary rational relations. Math. Comput. Sci. 2(1), 85\u2013102 (2008). \n                    https:\/\/doi.org\/10.1007\/s11786-008-0045-7\n                    \n                  . Special Issue on Intensional Programming and Semantics in Honour of Bill Wadge on the Occasion of his 60th Cycle","journal-title":"Math. Comput. Sci."},{"issue":"2","key":"4_CR15","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1051\/ita\/2009001","volume":"43","author":"O Finkel","year":"2009","unstructured":"Finkel, O.: Highly undecidable problems for infinite computations. RAIRO-Theor. Inform. Appl. 43(2), 339\u2013364 (2009)","journal-title":"RAIRO-Theor. Inform. Appl."},{"issue":"4","key":"4_CR16","doi-asserted-by":"publisher","first-page":"1115","DOI":"10.2178\/jsl.7804050","volume":"78","author":"O Finkel","year":"2013","unstructured":"Finkel, O.: The determinacy of context-free games. J. Symb. Logic 78(4), 1115\u20131134 (2013)","journal-title":"J. Symb. Logic"},{"key":"4_CR17","unstructured":"Finkel, O.: Wadge degrees of $$\\omega $$-languages of Petri nets (2017). Preprint \n                    arXiv:1712.07945"},{"issue":"5","key":"4_CR18","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1016\/j.ipl.2013.12.007","volume":"114","author":"O Finkel","year":"2014","unstructured":"Finkel, O., Skrzypczak, M.: On the topological complexity of $$\\omega $$-languages of non-deterministic Petri nets. Inf. Process. Lett. 114(5), 229\u2013233 (2014)","journal-title":"Inf. Process. Lett."},{"key":"4_CR19","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1016\/0304-3975(78)90020-8","volume":"7","author":"S Greibach","year":"1978","unstructured":"Greibach, S.: Remarks on blind and partially blind one way multicounter machines. Theor. Comput. Sci. 7, 311\u2013324 (1978)","journal-title":"Theor. Comput. Sci."},{"key":"4_CR20","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1002\/9780470611647.ch4","volume-title":"Petri Nets: Fundamental Models, Verification and Applications","author":"S Haddad","year":"2009","unstructured":"Haddad, S.: Decidability and complexity of Petri net problems. In: Diaz, M. (ed.) Petri Nets: Fundamental Models, Verification and Applications, pp. 87\u2013122. Wiley-ISTE, Hoboken (2009)"},{"key":"4_CR21","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-4190-4","volume-title":"Classical Descriptive Set Theory","author":"AS Kechris","year":"1995","unstructured":"Kechris, A.S.: Classical Descriptive Set Theory. Springer, New York (1995). \n                    https:\/\/doi.org\/10.1007\/978-1-4612-4190-4"},{"issue":"3","key":"4_CR22","doi-asserted-by":"publisher","first-page":"915","DOI":"10.2307\/2274751","volume":"54","author":"AS Kechris","year":"1989","unstructured":"Kechris, A.S., Marker, D., Sami, R.L.: $${\\Pi }_1^1$$ Borel sets. J. Symb. Logic 54(3), 915\u2013920 (1989)","journal-title":"J. Symb. Logic"},{"issue":"4","key":"4_CR23","doi-asserted-by":"publisher","first-page":"376","DOI":"10.1007\/BF01691063","volume":"3","author":"L Landweber","year":"1969","unstructured":"Landweber, L.: Decision problems for $$\\omega $$-automata. Math. Syst. Theory 3(4), 376\u2013384 (1969)","journal-title":"Math. Syst. Theory"},{"key":"4_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"583","DOI":"10.1007\/3-540-58043-3_29","volume-title":"A Decade of Concurrency Reflections and Perspectives","author":"W Thomas","year":"1994","unstructured":"Thomas, W., Lescow, H.: Logical specifications of infinite computations. In: de Bakker, J.W., de Roever, W.-P., Rozenberg, G. (eds.) REX 1993. LNCS, vol. 803, pp. 583\u2013621. Springer, Heidelberg (1994). \n                    https:\/\/doi.org\/10.1007\/3-540-58043-3_29"},{"key":"4_CR25","volume-title":"Descriptive Set Theory","author":"YN Moschovakis","year":"1980","unstructured":"Moschovakis, Y.N.: Descriptive Set Theory. North-Holland Publishing Co., Amsterdam (1980)"},{"key":"4_CR26","series-title":"Studies in Logic and the Foundations of Mathematics","volume-title":"Classical Recursion Theory, Volume I","author":"P Odifreddi","year":"1989","unstructured":"Odifreddi, P.: Classical Recursion Theory, Volume I. Studies in Logic and the Foundations of Mathematics, vol. 125. North-Holland Publishing Co., Amsterdam (1989)"},{"key":"4_CR27","series-title":"Pure and Applied Mathematics","volume-title":"Infinite Words, Automata, Semigroups, Logic and Games","author":"D Perrin","year":"2004","unstructured":"Perrin, D., Pin, J.E.: Infinite Words, Automata, Semigroups, Logic and Games. Pure and Applied Mathematics, vol. 141. Elsevier, Amsterdam (2004)"},{"key":"4_CR28","doi-asserted-by":"publisher","DOI":"10.1007\/b98282","volume-title":"Lectures on Concurrency and Petri Nets: Advances in Petri Nets","author":"J Desel","year":"2004","unstructured":"Desel, J., Reisig, W., Rozenberg, G.: Lectures on Concurrency and Petri Nets: Advances in Petri Nets, vol. 3098. Springer, Heidelberg (2004). \n                    https:\/\/doi.org\/10.1007\/b98282"},{"key":"4_CR29","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1016\/S0304-3975(97)00301-0","volume":"191","author":"V Selivanov","year":"1998","unstructured":"Selivanov, V.: Fine hierarchy of regular $$\\omega $$-languages. Theor. Comput. Sci. 191, 37\u201359 (1998)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"4_CR30","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1051\/ita:2003008","volume":"37","author":"V Selivanov","year":"2003","unstructured":"Selivanov, V.: Wadge degrees of $$\\omega $$-languages of deterministic Turing machines. RAIRO-Theor. Inform. Appl. 37(1), 67\u201383 (2003)","journal-title":"RAIRO-Theor. Inform. Appl."},{"issue":"1\u20132","key":"4_CR31","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1016\/j.tcs.2008.06.031","volume":"405","author":"V Selivanov","year":"2008","unstructured":"Selivanov, V.: Fine hierarchies and m-reducibilities in theoretical computer science. Theor. Comput. Sci. 405(1\u20132), 116\u2013163 (2008)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"4_CR32","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1007\/s11786-008-0042-x","volume":"2","author":"V Selivanov","year":"2008","unstructured":"Selivanov, V.: Wadge reducibility and infinite computations. Math. Comput. Sci. 2(1), 5\u201336 (2008). \n                    https:\/\/doi.org\/10.1007\/s11786-008-0042-x\n                    \n                  . Special Issue on Intensional Programming and Semantics in Honour of Bill Wadge on the Occasion of his 60th Cycle","journal-title":"Math. Comput. Sci."},{"key":"4_CR33","unstructured":"Simonnet, P.: Automates et th\u00e9orie descriptive. Ph.D. thesis, Universit\u00e9 Paris VII (1992)"},{"key":"4_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/978-3-030-00250-3_10","volume-title":"Reachability Problems","author":"M Skrzypczak","year":"2018","unstructured":"Skrzypczak, M.: B\u00fcchi VASS recognise $$\\mathbf{\\Sigma }^{1}_{1}$$-complete $${\\omega }$$-languages. In: Potapov, I., Reynier, P.-A. (eds.) RP 2018. LNCS, vol. 11123, pp. 133\u2013145. Springer, Cham (2018). \n                    https:\/\/doi.org\/10.1007\/978-3-030-00250-3_10"},{"key":"4_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"629","DOI":"10.1007\/3-540-56503-5_62","volume-title":"STACS 93","author":"L Staiger","year":"1993","unstructured":"Staiger, L.: Recursive automata on infinite words. In: Enjalbert, P., Finkel, A., Wagner, K.W. (eds.) STACS 1993. LNCS, vol. 665, pp. 629\u2013639. Springer, Heidelberg (1993). \n                    https:\/\/doi.org\/10.1007\/3-540-56503-5_62"},{"key":"4_CR36","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1007\/978-3-642-59126-6_6","volume-title":"Handbook of Formal Languages","author":"L Staiger","year":"1997","unstructured":"Staiger, L.: $$\\omega $$-languages. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, pp. 339\u2013387. Springer, Heidelberg (1997). \n                    https:\/\/doi.org\/10.1007\/978-3-642-59126-6_6"},{"key":"4_CR37","series-title":"Formal Models and Semantics","first-page":"135","volume-title":"Handbook of Theoretical Computer Science, Volume B","author":"W Thomas","year":"1990","unstructured":"Thomas, W.: Automata on infinite objects. In: van Leeuwen, J. (ed.) Handbook of Theoretical Computer Science, Volume B. Formal Models and Semantics, pp. 135\u2013191. Elsevier, Amsterdam (1990)"},{"issue":"3","key":"4_CR38","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1016\/0304-3975(83)90115-9","volume":"25","author":"R Valk","year":"1983","unstructured":"Valk, R.: Infinite behaviour of Petri nets. Theor. Comput. Sci. 25(3), 311\u2013341 (1983)","journal-title":"Theor. Comput. Sci."},{"key":"4_CR39","unstructured":"Wadge, W.: Reducibility and determinateness in the Baire space. Ph.D. thesis, University of California, Berkeley (1983)"},{"issue":"2","key":"4_CR40","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1016\/S0019-9958(79)90653-3","volume":"43","author":"K Wagner","year":"1979","unstructured":"Wagner, K.: On $$\\omega $$-regular sets. Inf. Control 43(2), 123\u2013177 (1979)","journal-title":"Inf. Control"}],"container-title":["Lecture Notes in Computer Science","Application and Theory of Petri Nets and Concurrency"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-51831-8_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,10,11]],"date-time":"2020-10-11T08:13:29Z","timestamp":1602404009000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-51831-8_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030518301","9783030518318"],"references-count":40,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-51831-8_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"30 June 2020","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":"Paris","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 June 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 June 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"41","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"apn2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/conf-2020.petrinet.net\/","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":"56","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":"23","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":"41% - 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":"1.89","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":"The conference was held virtually due to the COVID-19 pandemic.","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)"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}