{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,9]],"date-time":"2026-01-09T03:28:07Z","timestamp":1767929287157,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540422877","type":"print"},{"value":"9783540482246","type":"electronic"}],"license":[{"start":{"date-parts":[[2001,1,1]],"date-time":"2001-01-01T00:00:00Z","timestamp":978307200000},"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":[[2001]]},"DOI":"10.1007\/3-540-48224-5_66","type":"book-chapter","created":{"date-parts":[[2007,10,28]],"date-time":"2007-10-28T06:29:04Z","timestamp":1193552944000},"page":"809-820","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":20,"title":["Reasoning about Sequential and Branching Behaviours of Message Sequence Graphs"],"prefix":"10.1007","author":[{"given":"P.","family":"Madhusudan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,7,4]]},"reference":[{"issue":"2","key":"66_CR1","first-page":"70","volume":"17","author":"R. Alur","year":"1996","unstructured":"R. Alur, G.J. Holzmann, and D. Peled. An analyzer for message sequence charts. In Software Concepts and Tools, volume 17(2), pages 70\u201377, 1996.","journal-title":"Software Concepts and Tools"},{"key":"66_CR2","series-title":"Lect Notes Comput Sci","volume-title":"Proc. CONCUR\u2019 99","author":"R. Alur","year":"1999","unstructured":"R. Alur and M. Yannakakis. Model checking of message sequence charts. In Proc. CONCUR\u2019 99, volume 1664 of LNCS. Springer-Verlag, 1999."},{"key":"66_CR3","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1002\/malq.19600060105","volume":"6","author":"J. R. B\u00fcchi","year":"1960","unstructured":"J. R. B\u00fcchi. Weak second-order arithmetic and finite automata. In Z. Math. Logik Grundl. Math., volume 6, pages 66\u201392, 1960.","journal-title":"Z. Math. Logik Grundl. Math."},{"key":"66_CR4","first-page":"1","volume-title":"Proc. Internat. Congr. Logic, Method and Philos. Sci.","author":"J.R. B\u00fcchi","year":"1962","unstructured":"J.R. B\u00fcchi. On a decision method in restricted second order arithmetic. In Proc. Internat. Congr. Logic, Method and Philos. Sci. 1960, pages 1\u201312, Stanford, 1962. Stanford University Press."},{"key":"66_CR5","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"194","DOI":"10.1007\/3-540-61440-0_128","volume-title":"Proc. 23rd ICALP","author":"D. Caucal","year":"1996","unstructured":"D. Caucal. On infinite transition graphs having a decidable monadic theory. In Proc. 23rd ICALP, volume 1099 of LNCS, pages 194\u2013205. Springer-Verlag, 1996."},{"key":"66_CR6","doi-asserted-by":"publisher","first-page":"21","DOI":"10.2307\/1993511","volume":"98","author":"C.C. Elgot","year":"1961","unstructured":"C.C. Elgot. Decision problems of finite automata and related arithmetics. In Trans. Amer. Math. Soc., volume 98, pages 21\u201352, 1961.","journal-title":"Trans. Amer. Math. Soc."},{"key":"66_CR7","series-title":"BRICS Report RS-99-52","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":"66_CR8","series-title":"Lect Notes Comput Sci","volume-title":"Proc. ICALP\u2019 00","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, volume 1853 of LNCS. Springer-Verlag, 2000."},{"key":"66_CR9","series-title":"Lect Notes Comput Sci","volume-title":"Proc. MFCS\u2019 00","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, LNCS. Springer-Verlag, 2000."},{"key":"66_CR10","unstructured":"ITU-TS Recommendation Z.120. Message sequence chart (MSC). ITU-TS, 1997."},{"key":"66_CR11","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"652","DOI":"10.1007\/BFb0030632","volume-title":"Proc. TAPSOFT\u2019 97","author":"V. Levin","year":"1997","unstructured":"V. Levin and D. Peled. Verification of message sequence charts via template matching. In Proc. TAPSOFT\u2019 97, volume 1214 of LNCS, pages 652\u2013666. Springer-Verlag, 1997."},{"key":"66_CR12","doi-asserted-by":"crossref","unstructured":"P. Madhusudan. Reasoning about Sequential and Branching properties of Message Sequence Graphs Technical Report IMSC\/2001\/04\/22, Institute of Mathematical Sciences, Chennai, India, 2001.","DOI":"10.1007\/3-540-48224-5_66"},{"key":"66_CR13","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\u2019 99","author":"A. Muscholl","year":"1999","unstructured":"A. Muscholl and D. Peled. Message sequence charts and decision problems on Mazurkiewicz traces. In Proc. MFCS\u2019 99, volume 1672 of LNCS, pages 81\u201391. Springer-Verlag, 1999."},{"key":"66_CR14","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"226","DOI":"10.1007\/BFb0053553","volume-title":"Proc. FOSSACS\u2019 98","author":"A. Muscholl","year":"1998","unstructured":"A. Muscholl, D. Peled, and Z. Su. Deciding properties of message sequence charts. In Proc. FOSSACS\u2019 98, volume 1378 of LNCS, pages 226\u2013242. Springer-Verlag, 1998."},{"key":"66_CR15","series-title":"Lect Notes Comput Sci","volume-title":"Proc. ICALP\u2019 00","author":"B. Meenakshi","year":"2000","unstructured":"B. Meenakshi and R. Ramanujam. Reasoning about message passing in finite state environments. In Proc. ICALP\u2019 00, LNCS. Springer-Verlag, 2000."},{"key":"66_CR16","doi-asserted-by":"crossref","unstructured":"E. Rudolph, P. Graubmann, and J. Grabowski. Tutorial on message sequence charts. In Computer Networks and ISDN Systems\u2014SDL and MSC, Volume 28, 1996.","DOI":"10.1016\/0169-7552(95)00122-0"},{"key":"66_CR17","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":"66_CR18","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":"66_CR19","series-title":"Lect Notes Comput Sci","volume-title":"Proc. 12th IEEE Conf. on Logic in Computer Science","author":"P.S. Thiagarajan","year":"1997","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, LNCS. Springer-Verlag, 1997."},{"key":"66_CR20","series-title":"Lect Notes Comput Sci","volume-title":"Proc. STACS\u2019 96","author":"I. Walukiewicz","year":"1996","unstructured":"I. Walukiewicz. Monadic second order logic on tree-like structures. In Proc. STACS\u2019 96, volume 1046 of LNCS. Springer-Verlag, 1996."}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-48224-5_66","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,14]],"date-time":"2023-05-14T15:08:41Z","timestamp":1684076921000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-48224-5_66"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540422877","9783540482246"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/3-540-48224-5_66","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2001]]},"assertion":[{"value":"4 July 2001","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}