{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,12]],"date-time":"2025-10-12T20:18:00Z","timestamp":1760300280901},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030308056"},{"type":"electronic","value":"9783030308063"}],"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-30806-3_16","type":"book-chapter","created":{"date-parts":[[2019,9,6]],"date-time":"2019-09-06T09:08:36Z","timestamp":1567760916000},"page":"202-217","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Synthesis of Structurally Restricted b-bounded Petri Nets: Complexity Results"],"prefix":"10.1007","author":[{"given":"Ronny","family":"Tredup","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,9,6]]},"reference":[{"key":"16_CR1","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). \n                    https:\/\/doi.org\/10.1007\/3-540-59293-8_207"},{"key":"16_CR2","series-title":"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. An EATCS Series. Springer, Heidelberg (2015). \n                    https:\/\/doi.org\/10.1007\/978-3-662-47967-4"},{"key":"16_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1007\/978-3-540-47919-2_8","volume-title":"Petri Nets: Central Models and Their Properties","author":"E Best","year":"1987","unstructured":"Best, E.: Structure theory of petri nets: the free choice hiatus. In: Brauer, W., Reisig, W., Rozenberg, G. (eds.) ACPN 1986. LNCS, vol. 254, pp. 168\u2013205. Springer, Heidelberg (1987). \n                    https:\/\/doi.org\/10.1007\/978-3-540-47919-2_8"},{"key":"16_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/978-3-319-04921-2_13","volume-title":"Language and Automata Theory and Applications","author":"E Best","year":"2014","unstructured":"Best, E., Devillers, R.: Characterisation of the state spaces of live and bounded marked graph petri nets. In: Dediu, A.-H., Mart\u00edn-Vide, C., Sierra-Rodr\u00edguez, J.-L., Truthe, B. (eds.) LATA 2014. LNCS, vol. 8370, pp. 161\u2013172. Springer, Cham (2014). \n                    https:\/\/doi.org\/10.1007\/978-3-319-04921-2_13"},{"issue":"2\u20133","key":"16_CR5","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/s00236-015-0219-0","volume":"52","author":"E Best","year":"2014","unstructured":"Best, E., Devillers, R.R.: State space axioms for t-systems. Acta Inf. 52(2\u20133), 133\u2013152 (2014). \n                    https:\/\/doi.org\/10.1007\/s00236-015-0219-0","journal-title":"Acta Inf."},{"issue":"1","key":"16_CR6","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/s00236-014-0209-7","volume":"52","author":"E Best","year":"2015","unstructured":"Best, E., Devillers, R.R.: Synthesis and reengineering of persistent systems. Acta Inf. 52(1), 35\u201360 (2015). \n                    https:\/\/doi.org\/10.1007\/s00236-014-0209-7","journal-title":"Acta Inf."},{"key":"16_CR7","doi-asserted-by":"publisher","unstructured":"Best, E., Devillers, R.R.: Synthesis of bounded choice-free petri nets. In: CONCUR. LIPIcs, vol. 42, pp. 128\u2013141. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2015). \n                    https:\/\/doi.org\/10.4230\/LIPIcs.CONCUR.2015.128","DOI":"10.4230\/LIPIcs.CONCUR.2015.128"},{"issue":"1&2","key":"16_CR8","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1016\/0304-3975(94)00231-7","volume":"147","author":"A Cheng","year":"1995","unstructured":"Cheng, A., Esparza, J., Palsberg, J.: Complexity results for 1-safe nets. Theor. Comput. Sci. 147(1&2), 117\u2013136 (1995). \n                    https:\/\/doi.org\/10.1016\/0304-3975(94)00231-7","journal-title":"Theor. Comput. Sci."},{"key":"16_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/978-3-319-91268-4_2","volume-title":"Application and Theory of Petri Nets and Concurrency","author":"R Devillers","year":"2018","unstructured":"Devillers, R., Hujsa, T.: Analysis and synthesis of weighted marked graph petri nets. In: Khomenko, V., Roux, O.H. (eds.) PETRI NETS 2018. LNCS, vol. 10877, pp. 19\u201339. Springer, Cham (2018). \n                    https:\/\/doi.org\/10.1007\/978-3-319-91268-4_2"},{"issue":"3","key":"16_CR10","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1016\/0022-0000(88)90013-X","volume":"37","author":"RR Howell","year":"1988","unstructured":"Howell, R.R., Rosier, L.E.: Completeness results for conflict-free vector replacement systems. J. Comput. Syst. Sci. 37(3), 349\u2013366 (1988). \n                    https:\/\/doi.org\/10.1016\/0022-0000(88)90013-X","journal-title":"J. Comput. Syst. Sci."},{"issue":"4","key":"16_CR11","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). \n                    https:\/\/doi.org\/10.1007\/s00454-001-0047-6","journal-title":"Discret. Comput. Geom."},{"key":"16_CR12","doi-asserted-by":"publisher","unstructured":"Schlachter, U.: Bounded petri net synthesis from modal transition systems is undecidable. In: CONCUR. LIPIcs, vol. 59, pp. 15:1\u201315:14. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2016). \n                    https:\/\/doi.org\/10.4230\/LIPIcs.CONCUR.2016.15","DOI":"10.4230\/LIPIcs.CONCUR.2016.15"},{"key":"16_CR13","doi-asserted-by":"publisher","unstructured":"Schlachter, U., Wimmel, H.: k-bounded petri net synthesis from modal transition systems. In: CONCUR. LIPIcs, vol. 85, pp. 6:1\u20136:15. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2017). \n                    https:\/\/doi.org\/10.4230\/LIPIcs.CONCUR.2017.6","DOI":"10.4230\/LIPIcs.CONCUR.2017.6"},{"issue":"1","key":"16_CR14","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1109\/3468.553226","volume":"27","author":"E Teruel","year":"1997","unstructured":"Teruel, E., Colom, J.M., Su\u00e1rez, M.S.: Choice-free petri nets: a model for deterministic concurrent systems with bulk services and arrivals. IEEE Trans. Syst. Man Cybern. Part A 27(1), 73\u201383 (1997). \n                    https:\/\/doi.org\/10.1109\/3468.553226","journal-title":"IEEE Trans. Syst. Man Cybern. Part A"},{"key":"16_CR15","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). \n                    https:\/\/doi.org\/10.1007\/978-3-030-21571-2_9"},{"key":"16_CR16","doi-asserted-by":"crossref","unstructured":"Turau, V.: Algorithmische Graphentheorie, (2. Aufl). Oldenbourg (2004)","DOI":"10.1524\/9783486593778"}],"container-title":["Lecture Notes in Computer Science","Reachability Problems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-30806-3_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,6]],"date-time":"2019-09-06T09:10:32Z","timestamp":1567761032000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-30806-3_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030308056","9783030308063"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-30806-3_16","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 September 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"RP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Reachability Problems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Brussels","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Belgium","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":"11 September 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 September 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"rp2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/sites.uclouvain.be\/rp2019\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}