{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,11]],"date-time":"2024-09-11T12:57:26Z","timestamp":1726059446881},"publisher-location":"Berlin, Heidelberg","reference-count":28,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662606506"},{"type":"electronic","value":"9783662606513"}],"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-662-60651-3_7","type":"book-chapter","created":{"date-parts":[[2019,11,20]],"date-time":"2019-11-20T01:04:25Z","timestamp":1574211865000},"page":"172-191","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Synthesis of Weighted Marked Graphs from Constrained Labelled Transition Systems: A Geometric Approach"],"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":[[2019,11,21]]},"reference":[{"issue":"4","key":"7_CR1","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"},{"issue":"1&2","key":"7_CR2","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":"7_CR3","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). \nhttps:\/\/doi.org\/10.1007\/978-3-319-57861-3_16"},{"key":"7_CR4","series-title":"Cambridge Tracts in Theoretical Computer Science","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511526558","volume-title":"Free Choice Petri Nets","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)"},{"issue":"1","key":"7_CR5","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)","journal-title":"IEEE Trans. Syst. Man Cybern. Part A"},{"key":"7_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"334","DOI":"10.1007\/978-3-319-07734-5_18","volume-title":"Application and Theory of Petri Nets and Concurrency","author":"T Hujsa","year":"2014","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.) PETRI NETS 2014. LNCS, vol. 8489, pp. 334\u2013353. Springer, Cham (2014). \nhttps:\/\/doi.org\/10.1007\/978-3-319-07734-5_18"},{"issue":"5","key":"7_CR7","doi-asserted-by":"publisher","first-page":"511","DOI":"10.1016\/S0022-0000(71)80013-2","volume":"5","author":"F Commoner","year":"1971","unstructured":"Commoner, F., Holt, A., Even, S., Pnueli, A.: Marked directed graphs. J. Comput. Syst. Sci. 5(5), 511\u2013523 (1971)","journal-title":"J. Comput. Syst. Sci."},{"key":"7_CR8","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). \nhttps:\/\/doi.org\/10.1007\/3-540-55676-1_20"},{"key":"7_CR9","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1016\/j.tcs.2017.10.006","volume":"750","author":"E Best","year":"2017","unstructured":"Best, E., Hujsa, T., Wimmel, H.: Sufficient conditions for the marked graph realisability of labelled transition systems. Theoret. Comput. Sci. 750, 101\u2013116 (2017)","journal-title":"Theoret. Comput. Sci."},{"key":"7_CR10","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). \nhttps:\/\/doi.org\/10.1007\/978-3-319-91268-4_2"},{"key":"7_CR11","doi-asserted-by":"crossref","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","DOI":"10.1109\/ACSD.2013.12"},{"issue":"4s","key":"7_CR12","doi-asserted-by":"publisher","first-page":"141:1","DOI":"10.1145\/2627349","volume":"13","author":"T Hujsa","year":"2014","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)","journal-title":"ACM Trans. Embed. Comput. Syst."},{"key":"7_CR13","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, ATAED 2015, Brussels, Belgium, pp. 1\u201315 (2015)"},{"key":"7_CR14","first-page":"137","volume":"11","author":"K Barylska","year":"2016","unstructured":"Barylska, K., Best, E., Erofeev, E., Mikulski, L., Piatkowski, M.: Conditions for Petri net solvable binary words. Trans. Petri Nets Other Models Concurr. 11, 137\u2013159 (2016)","journal-title":"Trans. Petri Nets Other Models Concurr."},{"key":"7_CR15","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":"7_CR16","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 2017, Zaragoza, Spain, pp. 39\u201354 (2017)"},{"issue":"1","key":"7_CR17","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.: Synthesis and reengineering of persistent systems. Acta Inf. 52(1), 35\u201360 (2015)","journal-title":"Acta Inf."},{"issue":"1","key":"7_CR18","doi-asserted-by":"publisher","first-page":"83","DOI":"10.3233\/FI-2016-1376","volume":"146","author":"T Hujsa","year":"2016","unstructured":"Hujsa, T., Delosme, J.M., Munier-Kordon, A.: On liveness and reversibility of equal-conflict Petri nets. Fundamenta Informaticae 146(1), 83\u2013119 (2016)","journal-title":"Fundamenta Informaticae"},{"key":"7_CR19","unstructured":"Hujsa, T.: Contribution to the study of weighted Petri nets. Ph.D. thesis, Pierre and Marie Curie University, Paris, France (2014)"},{"key":"7_CR20","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, Bratislava, Slovakia, pp. 75\u201390 (2018)"},{"issue":"3","key":"7_CR21","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1016\/0020-0190(75)90020-4","volume":"3","author":"S Crespi-Reghizzi","year":"1975","unstructured":"Crespi-Reghizzi, S., Mandrioli, D.: A decidability theorem for a class of vector-addition systems. Inf. Process. Lett. 3(3), 78\u201380 (1975)","journal-title":"Inf. Process. Lett."},{"key":"7_CR22","doi-asserted-by":"crossref","unstructured":"Devillers, R.: Products of transition systems and additions of Petri nets. In: Desel, J., Yakovlev, A. (eds.) Proceedings of 16th International Conference on Application of Concurrency to System Design (ACSD 2016), pp. 65\u201373 (2016)","DOI":"10.1109\/ACSD.2016.10"},{"key":"7_CR23","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, 339\u2013362 (2017)","journal-title":"Acta Informatica"},{"key":"7_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/978-3-319-39086-4_4","volume-title":"Application and Theory of Petri Nets and Concurrency","author":"E Best","year":"2016","unstructured":"Best, E., Erofeev, E., Schlachter, U., Wimmel, H.: Characterising Petri net solvable binary words. In: Kordon, F., Moldt, D. (eds.) PETRI NETS 2016. LNCS, vol. 9698, pp. 39\u201358. Springer, Cham (2016). \nhttps:\/\/doi.org\/10.1007\/978-3-319-39086-4_4"},{"issue":"1","key":"7_CR25","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/BF01949705","volume":"3","author":"JP Doignon","year":"1973","unstructured":"Doignon, J.P.: Convexity in cristallographical lattices. J. Geom. 3(1), 71\u201385 (1973)","journal-title":"J. Geom."},{"key":"7_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1007\/3-540-07135-0_113","volume-title":"Parallel Processing","author":"RM Keller","year":"1975","unstructured":"Keller, R.M.: A fundamental theorem of asynchronous parallel computation. In: Feng, T. (ed.) Parallel Processing. LNCS, vol. 24, pp. 102\u2013112. Springer, Heidelberg (1975). \nhttps:\/\/doi.org\/10.1007\/3-540-07135-0_113"},{"key":"7_CR27","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. Springer, Heidelberg (2015). \nhttps:\/\/doi.org\/10.1007\/978-3-662-47967-4"},{"key":"7_CR28","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-10669-9","volume-title":"Discrete, Continuous, and Hybrid Petri Nets","author":"R David","year":"2010","unstructured":"David, R., Alla, H.: Discrete, Continuous, and Hybrid Petri Nets, 2nd edn. Springer, Heidelberg (2010). \nhttps:\/\/doi.org\/10.1007\/978-3-642-10669-9","edition":"2"}],"container-title":["Lecture Notes in Computer Science","Transactions on Petri Nets and Other Models of Concurrency XIV"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-60651-3_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,11,20]],"date-time":"2019-11-20T01:11:08Z","timestamp":1574212268000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-60651-3_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783662606506","9783662606513"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-60651-3_7","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":"21 November 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}