{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,9]],"date-time":"2026-05-09T03:57:53Z","timestamp":1778299073465,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540430025","type":"print"},{"value":"9783540452942","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-45294-x_22","type":"book-chapter","created":{"date-parts":[[2007,6,12]],"date-time":"2007-06-12T02:45:12Z","timestamp":1181616312000},"page":"256-267","source":"Crossref","is-referenced-by-count":22,"title":["Beyond Message Sequence Graphs"],"prefix":"10.1007","author":[{"given":"P.","family":"Madhusudan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"B.","family":"Meenakshi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,11,26]]},"reference":[{"key":"22_CR1","doi-asserted-by":"crossref","unstructured":"R. Alur, K. Etessami, and M. Yannakakis. Inference of message sequence charts. In Proc. 22nd Intl. Conf. on Software Engg., pages 304\u2013313, 2000.","DOI":"10.1145\/337180.337215"},{"key":"22_CR2","series-title":"Lect Notes Comput Sci","volume-title":"Model checking of message sequence charts","author":"R. Alur","year":"1999","unstructured":"R. Alur and M. Yannakakis. Model checking of message sequence charts. In Proc. CONCUR\u2019 99, vol. 1664 of LNCS. Springer-Verlag, 1999."},{"key":"22_CR3","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"496","DOI":"10.1007\/3-540-45319-9_34","volume-title":"Compositional message sequence charts","author":"E. Gunter","year":"2001","unstructured":"E. Gunter, A. Muscholl, and D. Peled. Compositional message sequence charts. In Proc. TACAS\u201901, vol. 2031 of LNCS, pages 496\u2013511. Springer-Verlag, 2001."},{"key":"22_CR4","series-title":"BRICS Report","volume-title":"Towards a theory of regular MSC languages","author":"J.G. Henriksen","year":"1999","unstructured":"J.G. Henriksen, M. Mukund, Narayan Kumar, and P.S. Thiagarajan. Towards a theory of regular MSC languages. BRICS Report RS-99-52, Department of Computer Science, Aarhus University, Denmark, 1999."},{"key":"22_CR5","series-title":"Lect Notes Comput Sci","volume-title":"On message sequence graphs and finitely generated regular MSC languages","author":"J.G. Henriksen","year":"2000","unstructured":"J.G. Henriksen, M. Mukund, Narayan Kumar, and P.S. Thiagarajan. On message sequence graphs and finitely generated regular MSC languages. In Proc. ICALP\u2019 00, vol. 1853 of LNCS. Springer-Verlag, 2000."},{"key":"22_CR6","series-title":"Lect Notes Comput Sci","volume-title":"Regular collections of Message Sequence Charts","author":"J.G. Henriksen","year":"2000","unstructured":"J.G. Henriksen, M. Mukund, Narayan Kumar, and P.S. Thiagarajan. Regular collections of Message Sequence Charts. In Proc. MFCS\u2019 00, vol. 1893 of LNCS. Springer-Verlag, 2000."},{"key":"22_CR7","series-title":"Lect Notes Comput Sci","volume-title":"Reasoning about sequential and branching behaviours of message sequence graphs","author":"P. Madhusudan","year":"2001","unstructured":"P. Madhusudan. Reasoning about sequential and branching behaviours of message sequence graphs. In Proc. ICALP\u2019 01, vol. 2076 of LNCS. Springer-Verlag, 2001."},{"key":"22_CR8","doi-asserted-by":"crossref","unstructured":"P. Madhusudan, B. Meenakshi. Beyond Message Sequence Graphs. Institute of Mathematical Sciences Technical Report, IMSc.\/2001\/09\/51. Available at http:\/\/www.imsc.ernet.in\/~madhuor\/~bmeena .","DOI":"10.1007\/3-540-45294-X_22"},{"key":"22_CR9","series-title":"Lect Notes Comput Sci","volume-title":"Reasoning about message passing in finite state environments","author":"B. Meenakshi","year":"2000","unstructured":"B. Meenakshi and R. Ramanujam. Reasoning about message passing in finite state environments. In Proc. ICALP\u2019 00, vol. 1853 of LNCS. Springer-Verlag, 2000."},{"key":"22_CR10","doi-asserted-by":"crossref","unstructured":"D. Peled. Specification and verification of message sequence charts. In Proc. IFIP FORTE\/PSTV, 2000.","DOI":"10.1007\/978-0-387-35533-7_9"},{"key":"22_CR11","doi-asserted-by":"crossref","unstructured":"E. Rudolph, P. Graubmann, and J. Grabowski. Tutorial on message sequence charts. In Computer Networks and ISDN Systems-SDL and MSC, Vol. 28, 1996.","DOI":"10.1016\/0169-7552(95)00122-0"},{"key":"22_CR12","doi-asserted-by":"crossref","unstructured":"W. Thomas. Automata on infinite objects. Handbook of Theoretical Computer Science, pages 165\u2013191, 1990.","DOI":"10.1016\/B978-0-444-88074-1.50009-3"},{"key":"22_CR13","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1007\/978-3-642-59126-6_7","volume":"III","author":"W. Thomas","year":"1997","unstructured":"W. Thomas. Languages, automata, and logic. Handbook of Formal Language Theory, III:389\u2013455, 1997.","journal-title":"Handbook of Formal Language Theory"},{"key":"22_CR14","doi-asserted-by":"crossref","unstructured":"P.S. Thiagarajan and I. Walukiewicz. An expressively complete linear time temporal logic for Mazurkiewicz traces. In Proc. 12th IEEE Conf. on Logic in Computer Science. IEEE Computer Society, 1997.","DOI":"10.1109\/LICS.1997.614946"}],"container-title":["Lecture Notes in Computer Science","FST TCS 2001: Foundations of Software Technology and Theoretical Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45294-X_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,17]],"date-time":"2025-01-17T05:53:41Z","timestamp":1737093221000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45294-X_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540430025","9783540452942"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/3-540-45294-x_22","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2001]]}}}