{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T13:21:53Z","timestamp":1743081713145,"version":"3.40.3"},"publisher-location":"Cham","reference-count":14,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319537320"},{"type":"electronic","value":"9783319537337"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","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":[[2017]]},"DOI":"10.1007\/978-3-319-53733-7_24","type":"book-chapter","created":{"date-parts":[[2017,2,15]],"date-time":"2017-02-15T05:39:21Z","timestamp":1487137161000},"page":"325-337","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Merging Relations: A Way to Compact Petri Nets\u2019 Behaviors Uniformly"],"prefix":"10.1007","author":[{"given":"Giovanni","family":"Casu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"G. Michele","family":"Pinna","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,2,16]]},"reference":[{"key":"24_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1007\/978-3-319-07734-5_10","volume-title":"Application and Theory of Petri Nets and Concurrency","author":"G Casu","year":"2014","unstructured":"Casu, G., Pinna, G.M.: Flow unfolding of multi-clock nets. In: Ciardo, G., Kindler, E. (eds.) PETRI NETS 2014. LNCS, vol. 8489, pp. 170\u2013189. Springer, Heidelberg (2014). doi:\n                      10.1007\/978-3-319-07734-5_10"},{"issue":"2","key":"24_CR2","doi-asserted-by":"publisher","first-page":"669","DOI":"10.1007\/s10270-014-0423-3","volume":"14","author":"J Desel","year":"2015","unstructured":"Desel, J., Reisig, W.: The concepts of Petri nets. Softw. Syst. Model. 14(2), 669\u2013683 (2015)","journal-title":"Softw. Syst. Model."},{"issue":"6","key":"24_CR3","doi-asserted-by":"publisher","first-page":"575","DOI":"10.1007\/BF01463946","volume":"28","author":"J Engelfriet","year":"1991","unstructured":"Engelfriet, J.: Branching processes of Petri nets. Acta Informatica 28(6), 575\u2013591 (1991)","journal-title":"Acta Informatica"},{"issue":"3","key":"24_CR4","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1023\/A:1014746130920","volume":"20","author":"J Esparza","year":"2002","unstructured":"Esparza, J., R\u00f6mer, S., Vogler, W.: An improvement of McMillan\u2019s unfolding algorithm. Formal Methods Syst. Des. 20(3), 285\u2013310 (2002)","journal-title":"Formal Methods Syst. Des."},{"issue":"3","key":"24_CR5","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1007\/s10626-006-0001-0","volume":"17","author":"E Fabre","year":"2007","unstructured":"Fabre, E.: Trellis processes: a compact representation for runs of concurrent systems. Discrete Event Dyn. Syst. 17(3), 267\u2013306 (2007)","journal-title":"Discrete Event Dyn. Syst."},{"issue":"5","key":"24_CR6","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1007\/s00236-006-0023-y","volume":"43","author":"V Khomenko","year":"2006","unstructured":"Khomenko, V., Kondratyev, A., Koutny, M., Vogler, W.: Merged processes: a new condensed representation of Petri net behaviour. Acta Informatica 43(5), 307\u2013330 (2006)","journal-title":"Acta Informatica"},{"key":"24_CR7","unstructured":"Langerak, R.: Bundle event structures: a non-interleaving semantics for LOTOS. In: FORTE 1992. IFIP Transactions, vol. C-10, pp. 331\u2013346 (1993)"},{"key":"24_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1007\/BFb0013025","volume-title":"Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency","author":"A Mazurkiewicz","year":"1989","unstructured":"Mazurkiewicz, A.: Basic notions of trace theory. In: Bakker, J.W., Roever, W.-P., Rozenberg, G. (eds.) REX 1988. LNCS, vol. 354, pp. 285\u2013363. Springer, Heidelberg (1989). doi:\n                      10.1007\/BFb0013025"},{"key":"24_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1007\/3-540-56496-9_14","volume-title":"Computer Aided Verification","author":"KL McMillan","year":"1993","unstructured":"McMillan, K.L.: Using unfoldings to avoid the state explosion problem in the verification of asynchronous circuits. In: Bochmann, G., Probst, D.K. (eds.) CAV 1992. LNCS, vol. 663, pp. 164\u2013177. Springer, Heidelberg (1993). doi:\n                      10.1007\/3-540-56496-9_14"},{"key":"24_CR10","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-33278-4","volume-title":"Understanding Petri Nets - Modeling Techniques, Analysis Methods, Case Studies","author":"W Reisig","year":"2013","unstructured":"Reisig, W.: Understanding Petri Nets - Modeling Techniques, Analysis Methods, Case Studies. Springer, Heidelberg (2013)"},{"key":"24_CR11","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1007\/978-3-642-72822-8_29","volume-title":"Concurrency and Nets: Advances in Petri Nets","author":"E Smith","year":"1987","unstructured":"Smith, E., Reisig, W.: The semantics of a net is a net: an exercise in general net theory. In: Voss, K., Genrich, H.J., Rozenberg, G. (eds.) Concurrency and Nets: Advances in Petri Nets, pp. 461\u2013479. Springer, Heidelberg (1987)"},{"key":"24_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1007\/11539452_26","volume-title":"CONCUR 2005 \u2013 Concurrency Theory","author":"RJ Glabbeek","year":"2005","unstructured":"Glabbeek, R.J.: The individual and collective token interpretations of Petri nets. In: Abadi, M., Alfaro, L. (eds.) CONCUR 2005. LNCS, vol. 3653, pp. 323\u2013337. Springer, Heidelberg (2005). doi:\n                      10.1007\/11539452_26"},{"issue":"41","key":"24_CR13","doi-asserted-by":"publisher","first-page":"4111","DOI":"10.1016\/j.tcs.2009.06.014","volume":"410","author":"RJ Glabbeek van","year":"2009","unstructured":"van Glabbeek, R.J., Plotkin, G.D.: Configuration structures, event structures and Petri nets. Theor. Comput. Sci. 410(41), 4111\u20134159 (2009)","journal-title":"Theor. Comput. Sci."},{"key":"24_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1007\/3-540-17906-2_31","volume-title":"Petri Nets: Applications and Relationships to Other Models of Concurrency","author":"G Winskel","year":"1987","unstructured":"Winskel, G.: Event structures. In: Brauer, W., Reisig, W., Rozenberg, G. (eds.) ACPN 1986. LNCS, vol. 255, pp. 325\u2013392. Springer, Heidelberg (1987). doi:\n                      10.1007\/3-540-17906-2_31"}],"container-title":["Lecture Notes in Computer Science","Language and Automata Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-53733-7_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T01:45:13Z","timestamp":1558316713000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-53733-7_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319537320","9783319537337"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-53733-7_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]},"assertion":[{"value":"16 February 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"LATA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Language and Automata Theory and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Ume\u00e5","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Sweden","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2017","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 March 2017","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 March 2017","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"lata2017","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/grammars.grlmc.com\/LATA2017\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}