{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T09:46:59Z","timestamp":1743155219138,"version":"3.40.3"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030215705"},{"type":"electronic","value":"9783030215712"}],"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-21571-2_10","type":"book-chapter","created":{"date-parts":[[2019,6,10]],"date-time":"2019-06-10T23:04:17Z","timestamp":1560207857000},"page":"148-168","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Fixed Parameter Tractability and Polynomial Time Results for the Synthesis of b-bounded Petri Nets"],"prefix":"10.1007","author":[{"given":"Ronny","family":"Tredup","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,5,31]]},"reference":[{"key":"10_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":"10_CR2","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"},{"key":"10_CR3","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 \u201995: 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":"10_CR4","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":"10_CR5","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":"Eric 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":"10_CR6","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1007\/s001650200022","volume":"13","author":"E Badouel","year":"2002","unstructured":"Badouel, E., 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."},{"key":"10_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-29709-0_1","volume-title":"Perspectives of Systems Informatics","author":"E Best","year":"2012","unstructured":"Best, E., Darondeau, P.: Petri net distributability. In: Clarke, E., Virbitskaite, I., Voronkov, A. (eds.) PSI 2011. LNCS, vol. 7162, pp. 1\u201318. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-29709-0_1"},{"key":"10_CR8","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). https:\/\/doi.org\/10.1007\/978-3-319-04921-2_13"},{"issue":"8","key":"10_CR9","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. CAD Integr. Circ. Syst. 16(8), 793\u2013812 (1997). https:\/\/doi.org\/10.1109\/43.644602","journal-title":"IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems"},{"key":"10_CR10","series-title":"Texts in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4471-5559-1","volume-title":"Fundamentals of Parameterized Complexity","author":"Rodney G. Downey","year":"2013","unstructured":"Downey, R.G., Fellows, M.R.: Fundamentals of Parameterized Complexity. Texts in Computer Science. Springer, London (2013). https:\/\/doi.org\/10.1007\/978-1-4471-5559-1"},{"issue":"1","key":"10_CR11","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":"2","key":"10_CR12","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 transition systems and elementary net systems. Theor. Comput. Sci. 135(2), 361\u2013376 (1994). https:\/\/doi.org\/10.1016\/0304-3975(94)90112-0","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"10_CR13","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1023\/A:1008271916548","volume":"7","author":"LE Holloway","year":"1997","unstructured":"Holloway, L.E., Krogh, B.H., Giua, A.: A survey of Petri net methods for controlled discrete event systems. Discret. Event Dyn. Syst. 7(2), 151\u2013190 (1997). https:\/\/doi.org\/10.1023\/A:1008271916548","journal-title":"Discret. Event Dyn. Syst."},{"key":"10_CR14","unstructured":"Schlachter, U.: (2019, private correspondance)"},{"key":"10_CR15","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). https:\/\/doi.org\/10.4230\/LIPIcs.CONCUR.2017.6","DOI":"10.4230\/LIPIcs.CONCUR.2017.6"},{"key":"10_CR16","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"},{"issue":"1","key":"10_CR17","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":"10_CR18","doi-asserted-by":"crossref","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)","DOI":"10.1007\/978-3-030-21571-2_9"},{"key":"10_CR19","doi-asserted-by":"publisher","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). https:\/\/doi.org\/10.4230\/LIPIcs.CONCUR.2018.16","DOI":"10.4230\/LIPIcs.CONCUR.2018.16"},{"key":"10_CR20","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":"10_CR21","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","Application and Theory of Petri Nets and Concurrency"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-21571-2_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T12:59:39Z","timestamp":1710248379000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-21571-2_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030215705","9783030215712"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-21571-2_10","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":"31 May 2019","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":"Aachen","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","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":"23 June 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 June 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"40","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"apn2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.petrinets2019.de\/","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":"41","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":"3","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":"56% - 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":"4.4","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)"}}]}}