{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T15:26:07Z","timestamp":1759332367677,"version":"3.40.3"},"publisher-location":"Cham","reference-count":17,"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_15","type":"book-chapter","created":{"date-parts":[[2020,6,29]],"date-time":"2020-06-29T23:05:05Z","timestamp":1593471905000},"page":"303-323","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["Structural Reductions Revisited"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7775-1978","authenticated-orcid":false,"given":"Yann","family":"Thierry-Mieg","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,6,30]]},"reference":[{"key":"15_CR1","doi-asserted-by":"publisher","unstructured":"Berthelot, G.: Checking properties of nets using transformation. In: Rozenberg, G. (ed.) APN 1985. LNCS, vol. 222, pp. 19\u201340. Springer, Heidelberg (1985). \nhttps:\/\/doi.org\/10.1007\/BFb0016204","DOI":"10.1007\/BFb0016204"},{"issue":"2","key":"15_CR2","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/s10009-019-00519-1","volume":"22","author":"B Berthomieu","year":"2019","unstructured":"Berthomieu, B., Le Botlan, D., Dal Zilio, S.: Counting Petri net markings from reduction equations. Int. J. Softw. Tools Technol. Transf. 22(2), 163\u2013181 (2019). \nhttps:\/\/doi.org\/10.1007\/s10009-019-00519-1","journal-title":"Int. J. Softw. Tools Technol. Transf."},{"key":"15_CR3","doi-asserted-by":"crossref","unstructured":"Best, E., Schlachter, U.: Analysis of Petri nets and transition systems. In: ICE. EPTCS, vol. 189, pp. 53\u201367 (2015)","DOI":"10.4204\/EPTCS.189.6"},{"key":"15_CR4","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). \nhttps:\/\/doi.org\/10.1007\/978-3-319-91268-4_8"},{"key":"15_CR5","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1016\/j.jlamp.2018.09.002","volume":"102","author":"FM B\u00f8nneland","year":"2019","unstructured":"B\u00f8nneland, F.M., Dyhr, J., Jensen, P.G., Johannsen, M., Srba, J.: Stubborn versus structural reductions for Petri nets. J. Log. Algebr. Meth. Program. 102, 46\u201363 (2019)","journal-title":"J. Log. Algebr. Meth. Program."},{"key":"15_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1007\/10722167_15","volume-title":"Computer Aided Verification","author":"E Clarke","year":"2000","unstructured":"Clarke, E., Grumberg, O., Jha, S., Lu, Y., Veith, H.: Counterexample-guided abstraction refinement. In: Emerson, E.A., Sistla, A.P. (eds.) CAV 2000. LNCS, vol. 1855, pp. 154\u2013169. Springer, Heidelberg (2000). \nhttps:\/\/doi.org\/10.1007\/10722167_15"},{"issue":"4","key":"15_CR7","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1016\/0140-3664(88)90085-0","volume":"11","author":"M D\u2019Anna","year":"1988","unstructured":"D\u2019Anna, M., Trigila, S.: Concurrent system analysis using Petri nets: an optimized algorithm for finding net invariants. Comput. Commun. 11(4), 215\u2013220 (1988)","journal-title":"Comput. Commun."},{"issue":"2","key":"15_CR8","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. Formal Methods Syst. Des. 16(2), 159\u2013189 (2000)","journal-title":"Formal Methods Syst. Des."},{"key":"15_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1007\/11562948_17","volume-title":"Automated Technology for Verification and Analysis","author":"S Evangelista","year":"2005","unstructured":"Evangelista, S., Haddad, S., Pradat-Peyre, J.-F.: Syntactical colored petri nets reductions. In: Peled, D.A., Tsay, Y.-K. (eds.) ATVA 2005. LNCS, vol. 3707, pp. 202\u2013216. Springer, Heidelberg (2005). \nhttps:\/\/doi.org\/10.1007\/11562948_17"},{"key":"15_CR10","unstructured":"Garc\u00eda-Vall\u00e9s, F., Colom, J.M.: Implicit places in net systems. In: PNPM, pp. 104\u2013113. IEEE Computer Society (1999)"},{"issue":"1","key":"15_CR11","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1142\/S0129626406002502","volume":"16","author":"S Haddad","year":"2006","unstructured":"Haddad, S., Pradat-Peyre, J.: New efficient Petri nets reductions for parallel programs verification. Parallel Process. Lett. 16(1), 101\u2013116 (2006)","journal-title":"Parallel Process. Lett."},{"key":"15_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1007\/978-3-319-77935-5_20","volume-title":"NASA Formal Methods","author":"A Laarman","year":"2018","unstructured":"Laarman, A.: Stubborn transaction reduction. In: Dutle, A., Mu\u00f1oz, C., Narkawicz, A. (eds.) NFM 2018. LNCS, vol. 10811, pp. 280\u2013298. Springer, Cham (2018). \nhttps:\/\/doi.org\/10.1007\/978-3-319-77935-5_20"},{"issue":"12","key":"15_CR13","doi-asserted-by":"publisher","first-page":"717","DOI":"10.1145\/361227.361234","volume":"18","author":"RJ Lipton","year":"1975","unstructured":"Lipton, R.J.: Reduction: a method of proving properties of parallel programs. Commun. ACM 18(12), 717\u2013721 (1975)","journal-title":"Commun. ACM"},{"key":"15_CR14","doi-asserted-by":"publisher","first-page":"198","DOI":"10.1016\/j.ins.2015.08.037","volume":"363","author":"G Liu","year":"2016","unstructured":"Liu, G., Barkaoui, K.: A survey of siphons in Petri nets. Inf. Sci. 363, 198\u2013220 (2016)","journal-title":"Inf. Sci."},{"key":"15_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/978-3-540-78800-3_24","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"L de Moura","year":"2008","unstructured":"de Moura, L., Bj\u00f8rner, N.: Z3: an efficient SMT solver. In: Ramakrishnan, C.R., Rehof, J. (eds.) TACAS 2008. LNCS, vol. 4963, pp. 337\u2013340. Springer, Heidelberg (2008). \nhttps:\/\/doi.org\/10.1007\/978-3-540-78800-3_24"},{"key":"15_CR16","doi-asserted-by":"publisher","first-page":"412","DOI":"10.1109\/TAC.1977.1101509","volume":"22","author":"T Murata","year":"1977","unstructured":"Murata, T.: State equation, controllability, and maximal matchings of Petri nets. IEEE Trans. Autom. Control 22, 412\u2013416 (1977)","journal-title":"IEEE Trans. Autom. Control"},{"key":"15_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1007\/978-3-642-19835-9_19","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"H Wimmel","year":"2011","unstructured":"Wimmel, H., Wolf, K.: Applying CEGAR to the Petri net state equation. In: Abdulla, P.A., Leino, K.R.M. (eds.) TACAS 2011. LNCS, vol. 6605, pp. 224\u2013238. Springer, Heidelberg (2011). \nhttps:\/\/doi.org\/10.1007\/978-3-642-19835-9_19"}],"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_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,6,30]],"date-time":"2020-06-30T01:22:46Z","timestamp":1593480166000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-51831-8_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030518301","9783030518318"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-51831-8_15","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"}]}}