{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:48:03Z","timestamp":1742914083153,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":38,"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_4","type":"book-chapter","created":{"date-parts":[[2021,2,24]],"date-time":"2021-02-24T13:04:14Z","timestamp":1614171854000},"page":"75-100","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Efficient Synthesis of Weighted Marked Graphs with Circular Reachability Graph, and Beyond"],"prefix":"10.1007","author":[{"given":"Raymond","family":"Devillers","sequence":"first","affiliation":[]},{"given":"Evgeny","family":"Erofeev","sequence":"additional","affiliation":[]},{"given":"Thomas","family":"Hujsa","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,2,25]]},"reference":[{"key":"4_CR1","doi-asserted-by":"publisher","unstructured":"van der Aalst, W.M.P.: Process Mining - Data Science in Action. Second Edition. Springer (2016). https:\/\/doi.org\/10.1007\/978-3-662-49851-4","DOI":"10.1007\/978-3-662-49851-4"},{"key":"4_CR2","doi-asserted-by":"publisher","unstructured":"Petri Net Synthesis. TTCSAES. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-47967-4_14","DOI":"10.1007\/978-3-662-47967-4_14"},{"key":"4_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","key":"4_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. Theoret. Comput. Sci. 186(1), 107\u2013134 (1997). https:\/\/doi.org\/10.1016\/S0304-3975(96)00219-8","journal-title":"Theoret. Comput. Sci."},{"key":"4_CR5","unstructured":"Barylska, K., Best, E., Erofeev, E., Mikulski, L., Piatkowski, M.: On binary words being Petri net solvable. In: Proceedings of the International Workshop on Algorithms & Theories for the Analysis of Event Data, Brussels, Belgium, pp. 1\u201315 (2015)"},{"key":"4_CR6","doi-asserted-by":"publisher","unstructured":"Barylska, K., Best, E., Erofeev, E., Mikulski, L., Piatkowski, M.: Conditions for Petri net solvable binary words. T. Petri Nets Other Models Concurrency 11, 137\u2013159 (2016). https:\/\/doi.org\/10.1007\/978-3-662-53401-4_7","DOI":"10.1007\/978-3-662-53401-4_7"},{"issue":"1","key":"4_CR7","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/s00236-014-0209-7","volume":"52","author":"E Best","year":"2014","unstructured":"Best, E., Devillers, R.: Synthesis and reengineering of persistent systems. Acta Informatica 52(1), 35\u201360 (2014). https:\/\/doi.org\/10.1007\/s00236-014-0209-7","journal-title":"Acta Informatica"},{"issue":"3","key":"4_CR8","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1016\/j.ic.2016.06.006","volume":"253","author":"E Best","year":"2017","unstructured":"Best, E., Devillers, R.: Characterisation of the state spaces of marked graph Petri nets. Inf. Comput. 253(3), 399\u2013410 (2017)","journal-title":"Inf. Comput."},{"key":"4_CR9","doi-asserted-by":"crossref","unstructured":"Best, E., Devillers, R., Schlachter, U.: Bounded choice-free Petri net synthesis: Algorithmic issues. Acta Informatica (2017)","DOI":"10.1007\/s00236-017-0310-9"},{"issue":"2","key":"4_CR10","first-page":"199","volume":"28","author":"E Best","year":"2018","unstructured":"Best, E., Devillers, R., Schlachter, U., Wimmel, H.: Simultaneous Petri net synthesis. Sci. Ann. Comp. Sci. 28(2), 199\u2013236 (2018)","journal-title":"Sci. Ann. Comp. Sci."},{"key":"4_CR11","unstructured":"Best, E., Hujsa, T., Wimmel, H.: Sufficient conditions for the marked graph realisability of labelled transition systems. Theoretical Comput. Sci. 750, 101\u2013116 (2017)"},{"key":"4_CR12","doi-asserted-by":"publisher","unstructured":"Commoner, F., Holt, A., Even, S., Pnueli, A.: Marked directed graphs. J. Comput. Syst. Sci. 5(5), 511\u2013523 (1971). https:\/\/doi.org\/10.1016\/S0022-0000(71)80013_2","DOI":"10.1016\/S0022-0000(71)80013_2"},{"key":"4_CR13","doi-asserted-by":"publisher","unstructured":"Crespi-Reghizzi, S., Mandrioli, D.: A decidability theorem for a class of vector-addition systems. Inf. Process. Lett. 3(3), 78\u201380 (1975). https:\/\/doi.org\/10.1016\/0020-0190(75)90020_4","DOI":"10.1016\/0020-0190(75)90020_4"},{"key":"4_CR14","doi-asserted-by":"publisher","unstructured":"Delosme, J.M., Hujsa, T., Munier-Kordon, A.: Polynomial sufficient conditions of well-behavedness for weighted join-free and choice-free systems. In: 13th International Conference on Application of Concurrency to System Design, pp. 90\u201399, July 2013. https:\/\/doi.org\/10.1109\/ACSD.2013.12","DOI":"10.1109\/ACSD.2013.12"},{"key":"4_CR15","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511526558","volume-title":"Free Choice Petri Nets, Cambridge Tracts in Theoretical Computer Science","author":"J Desel","year":"1995","unstructured":"Desel, J., Esparza, J.: Free Choice Petri Nets, Cambridge Tracts in Theoretical Computer Science, vol. 40. Cambridge University Press, New York (1995)"},{"key":"4_CR16","doi-asserted-by":"crossref","unstructured":"Devillers, R.: Products of transition systems and additions of Petri Nets. In: Desel, J., Yakovlev, A. (eds) Proceedings of the 16th International Conference on Application of Concurrency to System Design (ACSD 2016), pp. 65\u201373 (2016)","DOI":"10.1109\/ACSD.2016.10"},{"issue":"4","key":"4_CR17","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1007\/s00236-017-0300-y","volume":"55","author":"R Devillers","year":"2017","unstructured":"Devillers, R.: Factorisation of transition systems. Acta Informatica 55(4), 339\u2013362 (2017). https:\/\/doi.org\/10.1007\/s00236-017-0300-y","journal-title":"Acta Informatica"},{"key":"4_CR18","doi-asserted-by":"publisher","unstructured":"Devillers, R.: Articulation of transition systems and its application to Petri net synthesis. In: Application and Theory of Petri Nets and Concurrency - 40th International Conference, Aachen, Germany, 23\u201328 June, 2019, Proceedings, pp. 113\u2013126 (2019). https:\/\/doi.org\/10.1007\/978-3-030-21571-2_8","DOI":"10.1007\/978-3-030-21571-2_8"},{"key":"4_CR19","doi-asserted-by":"crossref","unstructured":"Devillers, R., Erofeev, E., Hujsa, T.: Synthesis of weighted marked graphs from constrained labelled transition systems. In: Proceedings of the International Workshop on Algorithms & Theories for the Analysis of Event Data, Satellite event of the Conferences: Petri Nets and ACSD, Bratislava, Slovakia, pp. 75\u201390 (2018)","DOI":"10.1007\/978-3-662-60651-3_7"},{"key":"4_CR20","doi-asserted-by":"crossref","unstructured":"Devillers, R., Erofeev, E., Hujsa, T.: Synthesis of weighted marked graphs from circular labelled transition systems. In: Proceedings of the International Workshop on Algorithms & Theories for the Analysis of Event Data, Satellite event of the conferences: Petri Nets and ACSD, Aachen, Germany, pp. 6\u201322, June 2019","DOI":"10.1007\/978-3-662-60651-3_7"},{"key":"4_CR21","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). https:\/\/doi.org\/10.1007\/978-3-319-91268-4_2"},{"key":"4_CR22","doi-asserted-by":"crossref","unstructured":"Devillers, R., Hujsa, T.: Analysis and synthesis of weighted marked graph Petri nets: Exact and approximate methods. Fundamenta Informaticae (2019)","DOI":"10.1007\/978-3-319-91268-4_2"},{"key":"4_CR23","doi-asserted-by":"publisher","unstructured":"Devillers, R., Schlachter, U.: Factorisation of Petri net solvable transition systems. In: Application and Theory of Petri Nets and Concurrency - 39th International Conference, Bratislava, Slovakia, 24\u201329 June, 2018, Proceedings, pp. 82\u201398 (2018). https:\/\/doi.org\/10.1007\/978-3-319-91268-4_5","DOI":"10.1007\/978-3-319-91268-4_5"},{"key":"4_CR24","unstructured":"Erofeev, E., Barylska, K., Mikulski, L., Piatkowski, M.: Generating all minimal Petri net unsolvable binary words. In: Proceedings of the Prague Stringology Conference 2016, Prague, Czech Republic, pp. 33\u201346 (2016)"},{"key":"4_CR25","unstructured":"Erofeev, E., Wimmel, H.: Reachability graphs of two-transition Petri nets. In: Proceedings of the International Workshop on Algorithms & Theories for the Analysis of Event Data, Zaragoza, Spain, pp. 39\u201354 (2017)"},{"key":"4_CR26","unstructured":"Hujsa, T.: Contribution to the study of weighted Petri nets. Ph.D. thesis, Pierre and Marie Curie University, Paris, France (2014)"},{"key":"4_CR27","doi-asserted-by":"crossref","unstructured":"Hujsa, T., Delosme, J.M., Munier-Kordon, A.: On the reversibility of well-behaved weighted choice-free systems. In: Ciardo, G., Kindler, E. (eds.) Application and Theory of Petri Nets and Concurrency, pp. 334\u2013353. Springer (2014)","DOI":"10.1007\/978-3-319-07734-5_18"},{"key":"4_CR28","doi-asserted-by":"publisher","unstructured":"Hujsa, T., Delosme, J.M., Munier-Kordon, A.: Polynomial sufficient conditions of well-behavedness and home markings in subclasses of weighted Petri nets. ACM Trans. Embed. Comput. Syst. 13(4s), 141:1\u2013141:25 (2014). https:\/\/doi.org\/10.1145\/2627349","DOI":"10.1145\/2627349"},{"key":"4_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1007\/978-3-319-57861-3_16","volume-title":"Application and Theory of Petri Nets and Concurrency","author":"T Hujsa","year":"2017","unstructured":"Hujsa, T., Devillers, R.: On liveness and deadlockability in subclasses of weighted petri nets. In: van der Aalst, W., Best, E. (eds.) PETRI NETS 2017. LNCS, vol. 10258, pp. 267\u2013287. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-57861-3_16"},{"key":"4_CR30","doi-asserted-by":"publisher","unstructured":"Hujsa, T., Devillers, R.: On deadlockability, liveness and reversibility in subclasses of weighted Petri nets. Fundam. Inform. 161(4), 383\u2013421 (2018) https:\/\/doi.org\/10.3233\/FI-2018-1708","DOI":"10.3233\/FI-2018-1708"},{"issue":"4","key":"4_CR31","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1007\/BF02579150","volume":"4","author":"N Karmarkar","year":"1984","unstructured":"Karmarkar, N.: A new polynomial-time algorithm for linear programming. Combinatorica 4(4), 373\u2013395 (1984). https:\/\/doi.org\/10.1007\/BF02579150","journal-title":"Combinatorica"},{"issue":"2","key":"4_CR32","doi-asserted-by":"publisher","first-page":"532","DOI":"10.1016\/j.ejor.2008.07.037","volume":"197","author":"O Marchetti","year":"2009","unstructured":"Marchetti, O., Munier-Kordon, A.: A sufficient condition for the liveness of Weighted Event Graphs. Eur. J. Oper. Res. 197(2), 532\u2013540 (2009)","journal-title":"Eur. J. Oper. Res."},{"issue":"4","key":"4_CR33","doi-asserted-by":"publisher","first-page":"541","DOI":"10.1109\/5.24143","volume":"77","author":"T Murata","year":"1989","unstructured":"Murata, T.: Petri nets: properties, analysis and applications. Proc. IEEE 77(4), 541\u2013580 (1989)","journal-title":"Proc. IEEE"},{"key":"4_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1007\/3-540-65306-6_19","volume-title":"Lectures on Petri Nets I: Basic Models","author":"M Silva","year":"1998","unstructured":"Silva, M., Terue, E., Colom, J.M.: Linear algebraic and linear programming techniques for the analysis of place\/transition net systems. In: Reisig, W., Rozenberg, G. (eds.) ACPN 1996. LNCS, vol. 1491, pp. 309\u2013373. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/3-540-65306-6_19"},{"key":"4_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"348","DOI":"10.1007\/3-540-55676-1_20","volume-title":"Application and Theory of Petri Nets 1992","author":"E Teruel","year":"1992","unstructured":"Teruel, E., Chrzastowski-Wachtel, P., Colom, J.M., Silva, M.: On weighted T-systems. In: Jensen, K. (ed.) ICATPN 1992. LNCS, vol. 616, pp. 348\u2013367. Springer, Heidelberg (1992). https:\/\/doi.org\/10.1007\/3-540-55676-1_20"},{"issue":"1","key":"4_CR36","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., Silva, M.: 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). https:\/\/doi.org\/10.1109\/3468.553226","journal-title":"IEEE Trans. Syst. Man Cybern. Part A"},{"issue":"1&2","key":"4_CR37","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1016\/0304-3975(95)00124-7","volume":"153","author":"E Teruel","year":"1996","unstructured":"Teruel, E., Silva, M.: Structure theory of Equal Conflict systems. Theoret. Comput. Sci. 153(1&2), 271\u2013300 (1996)","journal-title":"Theoret. Comput. Sci."},{"key":"4_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1007\/978-3-030-30806-3_16","volume-title":"Reachability Problems","author":"R Tredup","year":"2019","unstructured":"Tredup, R.: Synthesis of Structurally Restricted b-bounded Petri Nets: Complexity Results. In: Filiot, E., Jungers, R., Potapov, I. (eds.) RP 2019. LNCS, vol. 11674, pp. 202\u2013217. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-30806-3_16"}],"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_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,18]],"date-time":"2022-12-18T20:58:29Z","timestamp":1671397109000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-63079-2_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783662630785","9783662630792"],"references-count":38,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-63079-2_4","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"}}]}}