{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:44:07Z","timestamp":1725486247344},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540433668"},{"type":"electronic","value":"9783540459316"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45931-6_21","type":"book-chapter","created":{"date-parts":[[2007,6,9]],"date-time":"2007-06-09T00:53:52Z","timestamp":1181350432000},"page":"295-309","source":"Crossref","is-referenced-by-count":2,"title":["Bounded MSC Communication"],"prefix":"10.1007","author":[{"given":"Markus","family":"Lohrey","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anca","family":"Muscholl","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,3,15]]},"reference":[{"key":"21_CR1","doi-asserted-by":"crossref","unstructured":"B. Genest, and A. Muscholl. Pattern Matchingand Membership for Hierarchical Message Sequence Charts. To appear in Proc. of LATIN 2002.","DOI":"10.1007\/3-540-45995-2_31"},{"key":"21_CR2","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"675","DOI":"10.1007\/3-540-45022-X_57","volume-title":"Proc. of ICALP\u201900","author":"J. G. Henriksen","year":"2000","unstructured":"J. G. Henriksen, M. Mukund, K. N. Kumar, and P. Thiagarajan. On message sequence graphs and finitely generated regular MSC languages. In Proc. of ICALP\u201900, LNCS 1853, pp. 675\u2013686, 2000."},{"key":"21_CR3","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"675","DOI":"10.1007\/3-540-45022-X_57","volume-title":"Proc. of MFCS\u201900","author":"J. G. Henriksen","year":"2000","unstructured":"J. G. Henriksen, M. Mukund, K. N. Kumar, and P. Thiagarajan. Regular collections of message sequence charts. In Proc. of MFCS\u201900, LNCS 1893, pp. 675\u2013686, 2000."},{"key":"21_CR4","unstructured":"E. L. Lawler. Combinatorial Optimization: Networks and Matroids. Holt, Rinehart and Winston, 1976."},{"key":"21_CR5","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"332","DOI":"10.1007\/3-540-45315-6_22","volume-title":"Proc. of FoSSaCS\u201901","author":"R. Morin","year":"2001","unstructured":"R. Morin. On regular message sequence chart languages and relationships to Mazurkiewicz trace theory. In Proc. of FoSSaCS\u201901, LNCS 2030, pp. 332\u2013346, 2001."},{"key":"21_CR6","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"521","DOI":"10.1007\/3-540-44618-4_37","volume-title":"Proc. of CONCUR\u201900","author":"M. Mukund","year":"2000","unstructured":"M. Mukund, K. N. Kumar, and M. A. Sohoni. Synthesizingdistributed finite-state systems from MSCs. In Proc. of CONCUR\u201900, LNCS 1877, pp. 521\u2013535, 2000."},{"key":"21_CR7","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"226","DOI":"10.1007\/BFb0053553","volume-title":"Proc. of FoSSaCS\u201998","author":"A. Muscholl","year":"1998","unstructured":"A. Muscholl, D. Peled, and Z. Su. Decidingprop erties for message sequence charts. In Proc. of FoSSaCS\u201998, LNCS 1378, pp. 226\u2013242, 1998."},{"key":"21_CR8","unstructured":"C. H. Papadimitriou. Computational Complexity. Addison Wesley, 1994."},{"issue":"3","key":"21_CR9","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1137\/0204020","volume":"4","author":"R. Sethi","year":"1975","unstructured":"R. Sethi. Complete register allocation problems. SIAM Journal on Computing, 4(3):226\u2013248, 1975.","journal-title":"SIAM Journal on Computing"},{"key":"21_CR10","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"535","DOI":"10.1007\/3-540-19488-6_140","volume-title":"Proc. of ICALP\u201988","author":"K. Simon","year":"1988","unstructured":"K. Simon. On minimum flow and transitive reduction. In Proc. of ICALP\u201988, LNCS 317, pp. 535\u2013546, 1988."}],"container-title":["Lecture Notes in Computer Science","Foundations of Software Science and Computation Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45931-6_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,28]],"date-time":"2019-04-28T19:19:35Z","timestamp":1556479175000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45931-6_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540433668","9783540459316"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/3-540-45931-6_21","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}