{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T21:47:34Z","timestamp":1742939254574,"version":"3.40.3"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030148119"},{"type":"electronic","value":"9783030148126"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","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":[[2019]]},"DOI":"10.1007\/978-3-030-14812-6_38","type":"book-chapter","created":{"date-parts":[[2019,4,9]],"date-time":"2019-04-09T23:44:24Z","timestamp":1554853464000},"page":"615-634","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["The Complexity of Synthesis for 43 Boolean Petri Net Types"],"prefix":"10.1007","author":[{"given":"Ronny","family":"Tredup","sequence":"first","affiliation":[]},{"given":"Christian","family":"Rosenke","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,3,6]]},"reference":[{"key":"38_CR1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-19345-3","volume-title":"Process Mining - Discovery, Conformance and Enhancement of Business Processes","author":"WMP van der Aalst","year":"2011","unstructured":"van der Aalst, W.M.P.: Process Mining - Discovery, Conformance and Enhancement of Business Processes. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-19345-3"},{"key":"38_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1007\/3-540-59293-8_207","volume-title":"TAPSOFT 1995: Theory and Practice of Software Development","author":"E Badouel","year":"1995","unstructured":"Badouel, E., Bernardinello, L., Darondeau, P.: Polynomial algorithms for the synthesis of bounded nets. In: Mosses, P.D., Nielsen, M., Schwartzbach, M.I. (eds.) CAAP 1995. LNCS, vol. 915, pp. 364\u2013378. Springer, Heidelberg (1995). https:\/\/doi.org\/10.1007\/3-540-59293-8_207"},{"issue":"1\u20132","key":"38_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). https:\/\/doi.org\/10.1016\/S0304-3975(96)00219-8","journal-title":"Theor. Comput. Sci."},{"key":"38_CR4","series-title":"Texts in Theoretical Computer Science. An EATCS Series","doi-asserted-by":"publisher","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. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-47967-4"},{"issue":"6","key":"38_CR5","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1007\/s001650200022","volume":"13","author":"\u00c9 Badouel","year":"2002","unstructured":"Badouel, \u00c9., Caillaud, B., Darondeau, P.: Distributing finite automata through Petri net synthesis. Formal Asp. Comput. 13(6), 447\u2013470 (2002). https:\/\/doi.org\/10.1007\/s001650200022","journal-title":"Formal Asp. Comput."},{"issue":"7","key":"38_CR6","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). https:\/\/doi.org\/10.1007\/BF01186645","journal-title":"Acta Informatica"},{"issue":"8","key":"38_CR7","doi-asserted-by":"publisher","first-page":"793","DOI":"10.1109\/43.644602","volume":"16","author":"J Cortadella","year":"1997","unstructured":"Cortadella, J., Kishinevsky, M., Kondratyev, A., Lavagno, L., Yakovlev, A.: A region-based theory for state assignment in speed-independent circuits. IEEE Trans. Comput.-Aided Des. Integr. Circuits Syst. 16(8), 793\u2013812 (1997). https:\/\/doi.org\/10.1109\/43.644602","journal-title":"IEEE Trans. Comput.-Aided Des. Integr. Circuits Syst."},{"issue":"4","key":"38_CR8","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1007\/BF00264611","volume":"27","author":"A Ehrenfeucht","year":"1990","unstructured":"Ehrenfeucht, A., Rozenberg, G.: Partial (set) 2-structures. Part I: basic notions and the representation problem. Acta Informatica 27(4), 315\u2013342 (1990). https:\/\/doi.org\/10.1007\/BF00264611","journal-title":"Acta Informatica"},{"issue":"1","key":"38_CR9","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1006\/inco.2002.3173","volume":"178","author":"M Goldmann","year":"2002","unstructured":"Goldmann, M., Russell, A.: The complexity of solving equations over finite groups. Inf. Comput. 178(1), 253\u2013262 (2002). https:\/\/doi.org\/10.1006\/inco.2002.3173","journal-title":"Inf. Comput."},{"issue":"1","key":"38_CR10","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). https:\/\/doi.org\/10.1007\/s00236-012-0170-2","journal-title":"Acta Informatica"},{"issue":"6","key":"38_CR11","doi-asserted-by":"publisher","first-page":"545","DOI":"10.1007\/BF01178907","volume":"32","author":"U Montanari","year":"1995","unstructured":"Montanari, U., Rossi, F.: Contextual nets. Acta Informatica 32(6), 545\u2013596 (1995). https:\/\/doi.org\/10.1007\/BF01178907","journal-title":"Acta Informatica"},{"issue":"4","key":"38_CR12","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). https:\/\/doi.org\/10.1007\/s00454-001-0047-6","journal-title":"Discret. Comput. Geom."},{"key":"38_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"310","DOI":"10.1007\/3-540-63139-9_43","volume-title":"Application and Theory of Petri Nets 1997","author":"M Pietkiewicz-Koutny","year":"1997","unstructured":"Pietkiewicz-Koutny, M.: Transition systems of elementary net systems with inhibitor arcs. In: Az\u00e9ma, P., Balbo, G. (eds.) ICATPN 1997. LNCS, vol. 1248, pp. 310\u2013327. Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/3-540-63139-9_43"},{"key":"38_CR14","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 1996","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"},{"issue":"1","key":"38_CR15","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1002\/net.3230070103","volume":"7","author":"RE Tarjan","year":"1977","unstructured":"Tarjan, R.E.: Finding optimum branchings. Networks 7(1), 25\u201335 (1977). https:\/\/doi.org\/10.1002\/net.3230070103","journal-title":"Networks"},{"key":"38_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1007\/BFb0046835","volume-title":"Petri Nets: Central Models and Their Properties","author":"PS Thiagarajan","year":"1986","unstructured":"Thiagarajan, P.S.: Elementary net systems. In: Brauer, W., Reisig, W., Rozenberg, G. (eds.) Petri Nets: Central Models and Their Properties. LNCS, vol. 254, pp. 26\u201359. Springer, Heidelberg (1986). https:\/\/doi.org\/10.1007\/BFb0046835"},{"key":"38_CR17","doi-asserted-by":"publisher","unstructured":"Tredup, R., Rosenke, C.: Narrowing down the hardness barrier of synthesizing elementary net systems. In: Schewe, S., Zhang, L. (eds.) 29th International Conference on Concurrency Theory, CONCUR 2018. LIPIcs, Beijing, China, 4\u20137 September 2018, vol. 118, pp. 16:1\u201316:15. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2018). https:\/\/doi.org\/10.4230\/LIPIcs.CONCUR.2018.16","DOI":"10.4230\/LIPIcs.CONCUR.2018.16"},{"key":"38_CR18","unstructured":"Tredup, R., Rosenke, C.: Towards completely characterizing the complexity of Boolean nets synthesis. CoRR abs\/1806.03703 (2018). http:\/\/arxiv.org\/abs\/1806.03703"},{"key":"38_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1007\/978-3-319-91268-4_3","volume-title":"Application and Theory of Petri Nets and Concurrency","author":"R Tredup","year":"2018","unstructured":"Tredup, R., Rosenke, C., Wolf, K.: Elementary net synthesis remains NP-complete even for extremely simple inputs. In: Khomenko, V., Roux, O.H. (eds.) PETRI NETS 2018. LNCS, vol. 10877, pp. 40\u201359. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-91268-4_3"}],"container-title":["Lecture Notes in Computer Science","Theory and Applications of Models of Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-14812-6_38","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T15:11:34Z","timestamp":1709824294000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-14812-6_38"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030148119","9783030148126"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-14812-6_38","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"6 March 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"TAMC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Theory and Applications of Models of Computation","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Kitakyushu","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Japan","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 April 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 April 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"tamc2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}