{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T08:45:17Z","timestamp":1742978717510,"version":"3.40.3"},"publisher-location":"Cham","reference-count":16,"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_17","type":"book-chapter","created":{"date-parts":[[2023,5,27]],"date-time":"2023-05-27T08:02:05Z","timestamp":1685174525000},"page":"307-323","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On the\u00a0Reversibility of\u00a0Circular Conservative Petri Nets"],"prefix":"10.1007","author":[{"given":"Raymond","family":"Devillers","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,5,28]]},"reference":[{"key":"17_CR1","doi-asserted-by":"crossref","unstructured":"Best, E., Esparza, J.: Existence of home states in petri nets is decidable. Inf. Process. Lett. 116(6), 423\u2013427 (2016). https:\/\/doi.org\/10.1016\/j.ipl.2016.01.011","DOI":"10.1016\/j.ipl.2016.01.011"},{"key":"17_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1007\/3-540-57163-9_13","volume-title":"Fundamentals of Computation Theory","author":"P Chrzastowski-Wachtel","year":"1993","unstructured":"Chrzastowski-Wachtel, P., Raczunas, M.: Liveness of weighted circuits and the Diophantine problem of Frobenius. In: \u00c9sik, Z. (ed.) FCT 1993. LNCS, vol. 710, pp. 171\u2013180. Springer, Heidelberg (1993). https:\/\/doi.org\/10.1007\/3-540-57163-9_13"},{"key":"17_CR3","doi-asserted-by":"publisher","unstructured":"Cohen, H.: A course in computational algebraic number theory. Graduate Texts in Mathematics, vol. 138. Springer, Heidelberg (1993). https:\/\/doi.org\/10.1007\/978-3-662-02945-9. http:\/\/www.worldcat.org\/oclc\/27810276","DOI":"10.1007\/978-3-662-02945-9"},{"key":"17_CR4","doi-asserted-by":"crossref","unstructured":"Czerwinski, W., Lasota, S., Lazic, R., Leroux, J., Mazowiecki, F.: The reachability problem for petri nets is not elementary. J. ACM 68(1), 1\u201328 (2021). https:\/\/doi.org\/10.1145\/3422822","DOI":"10.1145\/3422822"},{"key":"17_CR5","doi-asserted-by":"publisher","unstructured":"Czerwinski, W., Orlikowski, L.: Reachability in vector addition systems is Ackermann-complete. In: 62nd IEEE Annual Symposium on Foundations of Computer Science, FOCS 2021, Denver, CO, USA, 7-10 February 2022, pp. 1229\u20131240 (2021). https:\/\/doi.org\/10.1109\/FOCS52979.2021.00120","DOI":"10.1109\/FOCS52979.2021.00120"},{"key":"17_CR6","doi-asserted-by":"crossref","unstructured":"Devillers, R., Hujsa, T.: Analysis and synthesis of weighted marked graph Petri nets. In: Application and Theory of Petri Nets and Concurrency - 39th International Conference, PETRI NETS 2018, Bratislava, Slovakia, 24\u201329 June 2018, Proceedings, pp. 19\u201339 (2018)","DOI":"10.1007\/978-3-319-91268-4_2"},{"key":"17_CR7","unstructured":"de Frutos-Escrig, D., Johnen, C.: Decidability of home space property. Tech. Rep. 503, Laboratoire de Recherche en Informatique, Universit\u00e9 de Paris-Sud (1989)"},{"key":"17_CR8","doi-asserted-by":"publisher","unstructured":"Keller, R.M.: A fundamental theorem of asynchronous parallel computation. In: Sagamore Computer Conference, 20-23 August 1974, LNCS, vol. 24, pp. 102\u2013112 (1975). https:\/\/doi.org\/10.1007\/3-540-07135-0_113","DOI":"10.1007\/3-540-07135-0_113"},{"key":"17_CR9","doi-asserted-by":"crossref","unstructured":"Kosaraju, S.R.: Decidability of reachability in vector addition systems (preliminary version). In: Proceedings of the 14th Annual ACM Symposium on Theory of Computing, 5\u20137 May 1982, San Francisco, California, USA, pp. 267\u2013281 (1982)","DOI":"10.1145\/800070.802201"},{"key":"17_CR10","unstructured":"Lasota, S.: Improved Ackermannian lower bound for the petri nets reachability problem. In: Berenbrink, P., Monmege, B. (eds.) 39th International Symposium on Theoretical Aspects of Computer Science (STACS 2022). Leibniz International Proceedings in Informatics (LIPIcs), vol. 219, pp. 1\u201315. Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik, Dagstuhl, Germany (2022). https:\/\/drops.dagstuhl.de\/opus\/volltexte\/2022\/15856"},{"issue":"2","key":"17_CR11","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1137\/0205020","volume":"5","author":"YE Lien","year":"1976","unstructured":"Lien, Y.E.: Termination properties of generalized Petri nets. SIAM J. Comput. 5(2), 251\u2013265 (1976)","journal-title":"SIAM J. Comput."},{"key":"17_CR12","doi-asserted-by":"crossref","unstructured":"Mayr, E.W.: An algorithm for the general Petri net reachability problem. In: Proceedings of the 13th Annual ACM Symposium on Theory of Computing, 11\u201313 May 1981, Milwaukee, Wisconsin, USA, pp. 238\u2013246 (1981)","DOI":"10.1145\/800076.802477"},{"issue":"3","key":"17_CR13","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1137\/0213029","volume":"13","author":"EW Mayr","year":"1984","unstructured":"Mayr, E.W.: An algorithm for the general Petri net reachability problem. SIAM J. Comput. 13(3), 441\u2013460 (1984)","journal-title":"SIAM J. Comput."},{"key":"17_CR14","doi-asserted-by":"crossref","unstructured":"Raczunas, M., Chrzastowski-Wachtel, P.: A Diophantine problem of Frobenius in terms of the least common multiple. Discrete Math. 150(1-3), 347\u2013357 (1996). https:\/\/doi.org\/10.1016\/0012-365X(95)00199-7","DOI":"10.1016\/0012-365X(95)00199-7"},{"key":"17_CR15","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1016\/j.entcs.2008.12.042","volume":"223","author":"K Reinhardt","year":"2008","unstructured":"Reinhardt, K.: Reachability in Petri nets with inhibitor arcs. Electr. Notes Theor. Comput. Sci. 223, 239\u2013264 (2008)","journal-title":"Electr. Notes Theor. Comput. Sci."},{"key":"17_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"348","DOI":"10.1007\/3-540-55676-1_20","volume-title":"Application and Theory of Petri Nets 1992","author":"E Teruel","year":"1992","unstructured":"Teruel, E., Chrzastowski-Wachtel, P., Colom, J.M., Silva, M.: On weighted T-systems. In: Jensen, K. (ed.) ICATPN 1992. LNCS, vol. 616, pp. 348\u2013367. Springer, Heidelberg (1992). https:\/\/doi.org\/10.1007\/3-540-55676-1_20"}],"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_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,21]],"date-time":"2024-10-21T06:13:56Z","timestamp":1729491236000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-33620-1_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031336195","9783031336201"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-33620-1_17","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)"}}]}}