{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,30]],"date-time":"2026-04-30T03:25:33Z","timestamp":1777519533382,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540418658","type":"print"},{"value":"9783540453192","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-45319-9_34","type":"book-chapter","created":{"date-parts":[[2007,7,16]],"date-time":"2007-07-16T11:50:47Z","timestamp":1184586647000},"page":"496-511","source":"Crossref","is-referenced-by-count":35,"title":["Compositional Message Sequence Charts"],"prefix":"10.1007","author":[{"given":"Elsa L.","family":"Gunter","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anca","family":"Muscholl","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Doron A.","family":"Peled","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,3,23]]},"reference":[{"key":"34_CR1","doi-asserted-by":"crossref","unstructured":"R. Alur, K. Etessami, and M. Yannakakis. Inference of message sequence charts. In Proc. of the 22nd Int. Conf. on Software Engineering, pp. 304\u2013313, ACM, 2000.","DOI":"10.1145\/337180.337215"},{"issue":"2","key":"34_CR2","first-page":"70","volume":"17","author":"R. Alur","year":"1996","unstructured":"R. Alur, G. H. Holzmann, and D. A. Peled. An analyzer for message sequence charts. Software Concepts and Tools, 17(2):70\u201377, 1996.","journal-title":"Software Concepts and Tools"},{"key":"34_CR3","series-title":"Lect Notes Comput Sci","volume-title":"Proc. Of CONCUR\u201999","author":"R. Alur","year":"1999","unstructured":"R. Alur and M. Yannakakis. Model checking of message sequence charts. In Proc. Of CONCUR\u201999, LNCS no. 1664, 1999."},{"key":"34_CR4","volume-title":"Introduction to algorithms","author":"T. H. Cormen","year":"1999","unstructured":"T. H. Cormen, C. E. Leiserson, and R. L. Rivest. Introduction to algorithms. MIT Press, Cambridge, Massachusetts, 1999."},{"issue":"2","key":"34_CR5","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1006\/inco.1994.1035","volume":"110","author":"P. Godefroid","year":"1994","unstructured":"P. Godefroid and P. Wolper. A partial approach to model checking. Information and Computation, 110(2):305\u2013326, 1994.","journal-title":"Information and Computation"},{"key":"34_CR6","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1007\/3-540-49059-0_28","volume-title":"Proc. of Tools and Algorithms for the Construction and Analysis of Systems (TACAS\u201999), Amsterdam, The Netherlands","author":"E. Gunter","year":"1999","unstructured":"E. Gunter and D. Peled. Path exploration tool. In Proc. of Tools and Algorithms for the Construction and Analysis of Systems (TACAS\u201999), Amsterdam, The Netherlands, LNCS 1579, pages 405\u2013419, 1999. Springer."},{"key":"34_CR7","unstructured":"L. H\u00e9lou\u00ebt and P. Le Maigat. Decomposition of Message Sequence Charts. In Proc. of the 2nd Workshop on SDL and MSC (SAM2000), pp. 46\u201360, 2000."},{"key":"34_CR8","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, 2000","author":"J. G. Henriksen","year":"2000","unstructured":"J. G. Henriksen, M. Mukund, K. Narayan Kumar, and P. Thiagarajan. On message sequence graphs and finitely generated regular MSC languages. In Proc. Of ICALP\u201900, 2000, LNCS no. 1853, pp. 675\u2013686, 2000."},{"key":"34_CR9","unstructured":"ITU-T Recommendation Z. 120, Message Sequence Chart (MSC), 1996."},{"key":"34_CR10","doi-asserted-by":"crossref","unstructured":"S. Mauw and M. Reniers. High-level message sequence charts. In SDL\u201997: Time for Testing-SDL, MSC and Trends. Proc. of the SDL Forum\u201997, pp. 291\u2013306, 1997.","DOI":"10.1016\/B978-044482816-3\/50020-4"},{"key":"34_CR11","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1007\/3-540-48340-3_8","volume-title":"Proc. MFCS\u201999","author":"A. Muscholl","year":"1999","unstructured":"A. Muscholl and D. Peled. Message sequence graphs and decision problems on Mazurkiewicz traces. In Proc. MFCS\u201999, LNCS no. 1672, pp. 81\u201391, 1999."},{"key":"34_CR12","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. Deciding properties of message sequence charts. In Proc. of FoSSaCS\u201998, LNCS no. 1378, pp. 226\u2013242, 1998."},{"key":"34_CR13","unstructured":"A. Muscholl and D. Peled. High-level message sequence charts and finite-state communication protocols. Submitted."},{"key":"34_CR14","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1007\/3-540-56922-7_34","volume-title":"Proc. of CAV\u2019 93","author":"D. Peled","year":"1993","unstructured":"D. Peled. All from One, One for All: on Model Checking Using Representatives. In Proc. of CAV\u2019 93, LNCS no. 697, pp. 409\u2013423, 1993."},{"key":"34_CR15","unstructured":"A. Tanenbaum, Computer Networks, Prentice Hall, 1988."}],"container-title":["Lecture Notes in Computer Science","Tools and Algorithms for the Construction and Analysis of Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45319-9_34","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,17]],"date-time":"2019-02-17T19:02:40Z","timestamp":1550430160000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45319-9_34"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540418658","9783540453192"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/3-540-45319-9_34","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2001]]}}}