{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,12]],"date-time":"2025-10-12T20:12:50Z","timestamp":1760299970221,"version":"3.41.0"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319912677"},{"type":"electronic","value":"9783319912684"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","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":[[2018]]},"DOI":"10.1007\/978-3-319-91268-4_3","type":"book-chapter","created":{"date-parts":[[2018,5,7]],"date-time":"2018-05-07T16:27:38Z","timestamp":1525710458000},"page":"40-59","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["Elementary Net Synthesis Remains NP-Complete Even for Extremely Simple Inputs"],"prefix":"10.1007","author":[{"given":"Ronny","family":"Tredup","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christian","family":"Rosenke","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Karsten","family":"Wolf","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,5,8]]},"reference":[{"key":"3_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1007\/3-540-45594-9_14","volume-title":"Business Process Management","author":"A Agostini","year":"2000","unstructured":"Agostini, A., De Michelis, G.: Improving flexibility of workflow management systems. In: van der Aalst, W., Desel, J., Oberweis, A. (eds.) Business Process Management. LNCS, vol. 1806, pp. 218\u2013234. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/3-540-45594-9_14"},{"issue":"7","key":"3_CR2","doi-asserted-by":"publisher","first-page":"647","DOI":"10.1007\/BF01186645","volume":"32","author":"E Badouel","year":"1995","unstructured":"Badouel, E., Darondeau, P.: Trace nets and process automata. Acta Informatica 32(7), 647\u2013679 (1995)","journal-title":"Acta Informatica"},{"issue":"1\u20132","key":"3_CR3","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1016\/S0304-3975(96)00219-8","volume":"186","author":"E Badouel","year":"1997","unstructured":"Badouel, E., Bernardinello, L., Darondeau, P.: The synthesis problem for elementary net systems is NP-complete. Theor. Comput. Sci. 186(1\u20132), 107\u2013134 (1997)","journal-title":"Theor. Comput. Sci."},{"key":"3_CR4","series-title":"Texts in Theoretical Computer Science. An EATCS Series","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-662-47967-4","volume-title":"Petri Net Synthesis","author":"E Badouel","year":"2015","unstructured":"Badouel, E., Bernardinello, L., Darondeau, P.: Petri Net Synthesis. Texts in Theoretical Computer Science. An EATCS Series, pp. 1\u2013325. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-47967-4. ISBN 978-3-662-47966-7"},{"key":"3_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/978-3-319-39086-4_4","volume-title":"Application and Theory of Petri Nets and Concurrency","author":"E Best","year":"2016","unstructured":"Best, E., Erofeev, E., Schlachter, U., Wimmel, H.: Characterising Petri net solvable binary words. In: Kordon, F., Moldt, D. (eds.) PETRI NETS 2016. LNCS, vol. 9698, pp. 39\u201358. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-39086-4_4"},{"key":"3_CR6","unstructured":"Cortadella, J.: Private correspondence (2017)"},{"key":"3_CR7","doi-asserted-by":"crossref","unstructured":"Cortadella, J., Kishinevsky, M., Kondratyev, A., Lavagno, L., Yakovlev, A.: Complete state encoding based on the theory of regions. In: International Symposium on Advanced Research in Asynchronous Circuits and Systems, pp. 36\u201347. IEEE (1996)","DOI":"10.1109\/ASYNC.1996.494436"},{"issue":"2","key":"3_CR8","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1016\/0304-3975(94)90112-0","volume":"135","author":"K Hiraishi","year":"1994","unstructured":"Hiraishi, K.: Some complexity results on TS and elementary net systems. Theor. Comput. Sci. 135(2), 361\u2013376 (1994)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"3_CR9","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1007\/s00236-012-0170-2","volume":"50","author":"J Kleijn","year":"2013","unstructured":"Kleijn, J., Koutny, M., Pietkiewicz-Koutny, M., Rozenberg, G.: Step semantics of Boolean nets. Acta Informatica 50(1), 15\u201339 (2013)","journal-title":"Acta Informatica"},{"issue":"4","key":"3_CR10","doi-asserted-by":"publisher","first-page":"573","DOI":"10.1007\/s00454-001-0047-6","volume":"26","author":"C Moore","year":"2001","unstructured":"Moore, C., Robson, J.M.: Hard tiling problems with simple tiles. Discret. Comput. Geom. 26(4), 573\u2013590 (2001)","journal-title":"Discret. Comput. Geom."},{"key":"3_CR11","unstructured":"Rosenke, C., Tredup, R.: The hardness of synthesizing elementary net systems from highly restricted inputs. arXiv:1711.00220 (2017)"},{"key":"3_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1007\/3-540-60922-9_42","volume-title":"STACS 96","author":"V Schmitt","year":"1996","unstructured":"Schmitt, V.: Flip-flop nets. In: Puech, C., Reischuk, R. (eds.) STACS 1996. LNCS, vol. 1046, pp. 515\u2013528. Springer, Heidelberg (1996). https:\/\/doi.org\/10.1007\/3-540-60922-9_42"},{"key":"3_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1007\/3-540-65307-4_49","volume-title":"Lectures on Petri Nets II: Applications","author":"AV Yakovlev","year":"1998","unstructured":"Yakovlev, A.V., Koelmans, A.M.: Petri nets and digital hardware design. In: Reisig, W., Rozenberg, G. (eds.) ACPN 1996. LNCS, vol. 1492, pp. 154\u2013236. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/3-540-65307-4_49"},{"key":"3_CR14","unstructured":"OMG. Business Process Model and Notation (BPMN). Object Management Group (2016)"},{"key":"3_CR15","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-79142-0","volume-title":"Business Process Engineering, Reference Models for Industrial Enterprises","author":"A-W Scheer","year":"1994","unstructured":"Scheer, A.-W.: Business Process Engineering, Reference Models for Industrial Enterprises. Springer, Heidelberg (1994). https:\/\/doi.org\/10.1007\/978-3-642-79142-0"},{"key":"3_CR16","unstructured":"UML. Unified Modeling Language (UML). Object Management Group (2016)"}],"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-319-91268-4_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,4]],"date-time":"2025-07-04T08:54:39Z","timestamp":1751619279000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-91268-4_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319912677","9783319912684"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-91268-4_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"8 May 2018","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":"Bratislava","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Slovakia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 June 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 June 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"39","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"apn2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/interes.institute\/petrinets2018\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}