{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,12]],"date-time":"2025-10-12T20:22:41Z","timestamp":1760300561220,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662630785"},{"type":"electronic","value":"9783662630792"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"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":[[2021]]},"DOI":"10.1007\/978-3-662-63079-2_5","type":"book-chapter","created":{"date-parts":[[2021,2,24]],"date-time":"2021-02-24T13:04:14Z","timestamp":1614171854000},"page":"101-125","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["The Complexity of Synthesizing $$\\textsf {nop}$$-Equipped Boolean Petri Nets from g-Bounded Inputs"],"prefix":"10.1007","author":[{"given":"Ronny","family":"Tredup","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,2,25]]},"reference":[{"issue":"1\u20132","key":"5_CR1","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":"5_CR2","doi-asserted-by":"crossref","unstructured":"Badouel, E., Bernardinello, L., Darondeau, P.: Petri Net Synthesis. Texts in Theoretical Computer Science. An EATCS Series, Springer (2015)","DOI":"10.1007\/978-3-662-47967-4"},{"issue":"7","key":"5_CR3","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 Inf. 32(7), 647\u2013679 (1995)","journal-title":"Acta Inf."},{"key":"5_CR4","unstructured":"Cortadella, J.: Private correspondance (2017)"},{"issue":"1","key":"5_CR5","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 Inf. 50(1), 15\u201339 (2013)","journal-title":"Acta Inf."},{"issue":"6","key":"5_CR6","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 Inf. 32(6), 545\u2013596 (1995)","journal-title":"Acta Inf."},{"issue":"4","key":"5_CR7","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. Discrete Comput. Geom. 26(4), 573\u2013590 (2001)","journal-title":"Discrete Comput. Geom."},{"key":"5_CR8","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":"5_CR9","doi-asserted-by":"crossref","unstructured":"Rozenberg, G., Engelfriet, J.: Elementary net systems. In: Petri Nets. Lecture Notes in Computer Science, vol. 1491, pp. 12\u2013121. Springer (1996)","DOI":"10.1007\/3-540-65306-6_14"},{"key":"5_CR10","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":"5_CR11","unstructured":"Tredup, R.: The complexity of synthesizing $${\\sf nop}$$equipped boolean nets from $$g$$-bounded inputs (technical report), to appear in CoRR (2019)"},{"key":"5_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/978-3-030-21571-2_9","volume-title":"Application and Theory of Petri Nets and Concurrency","author":"R Tredup","year":"2019","unstructured":"Tredup, R.: Hardness results for the synthesis of b-bounded Petri Nets. In: Donatelli, S., Haar, S. (eds.) PETRI NETS 2019. LNCS, vol. 11522, pp. 127\u2013147. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-21571-2_9"},{"key":"5_CR13","doi-asserted-by":"publisher","first-page":"20","DOI":"10.4204\/EPTCS.304.2","volume":"304","author":"R Tredup","year":"2019","unstructured":"Tredup, R.: Tracking down the bad guys: reset and set make feasibility for flip-flop net derivatives NP-complete. ICE. EPTCS 304, 20\u201337 (2019)","journal-title":"ICE. EPTCS"},{"key":"5_CR14","unstructured":"Tredup, R., Rosenke, C.: Narrowing down the hardness barrier of synthesizing elementary net systems. In: CONCUR. LIPIcs, vol. 118, pp. 16:1\u201316:15. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2018)"},{"key":"5_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"615","DOI":"10.1007\/978-3-030-14812-6_38","volume-title":"Theory and Applications of Models of Computation","author":"R Tredup","year":"2019","unstructured":"Tredup, R., Rosenke, C.: The complexity of synthesis for 43 Boolean Petri Net types. In: Gopal, T.V., Watada, J. (eds.) TAMC 2019. LNCS, vol. 11436, pp. 615\u2013634. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-14812-6_38"},{"key":"5_CR16","unstructured":"Tredup, R., Rosenke, C.: On the hardness of synthesizing Boolean nets. In: ATAED@Petri Nets\/ACSD. CEUR Workshop Proceedings, vol. 2371, pp. 71\u201386. CEUR-WS.org (2019)"},{"key":"5_CR17","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","Transactions on Petri Nets and Other Models of Concurrency XV"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-63079-2_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,3,27]],"date-time":"2021-03-27T18:02:57Z","timestamp":1616868177000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-63079-2_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783662630785","9783662630792"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-63079-2_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"25 February 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}