{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:09:08Z","timestamp":1761610148665,"version":"build-2065373602"},"reference-count":14,"publisher":"Elsevier BV","issue":"7","license":[{"start":{"date-parts":[[2002,5,1]],"date-time":"2002-05-01T00:00:00Z","timestamp":1020211200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2002,5,1]],"date-time":"2002-05-01T00:00:00Z","timestamp":1020211200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2013,7,29]],"date-time":"2013-07-29T00:00:00Z","timestamp":1375056000000},"content-version":"vor","delay-in-days":4107,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/3.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Electronic Notes in Theoretical Computer Science"],"published-print":{"date-parts":[[2002,5]]},"DOI":"10.1016\/s1571-0661(04)80484-5","type":"journal-article","created":{"date-parts":[[2004,9,28]],"date-time":"2004-09-28T15:29:25Z","timestamp":1096385365000},"page":"51-64","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":7,"title":["Specification and Verification using Message Sequence Charts"],"prefix":"10.1016","volume":"65","author":[{"given":"Doron","family":"Peled","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"2","key":"10.1016\/S1571-0661(04)80484-5_NEWBIB1","first-page":"70","article-title":"An analyzer for message sequence charts","volume":"17","author":"Alur","year":"1996","journal-title":"Software Concepts and Tools"},{"key":"10.1016\/S1571-0661(04)80484-5_NEWBIB2","doi-asserted-by":"crossref","unstructured":"R. alur and D. Peled and W. Penczek, Model Checking of Causality Properties, Logic in Computer Science 1995, San Diego, CA, 90-100.","DOI":"10.1109\/LICS.1995.523247"},{"key":"10.1016\/S1571-0661(04)80484-5_NEWBIB3","doi-asserted-by":"crossref","unstructured":"R. Alur and M. Yannakakis. Model checking of message sequence charts. In Proc. of CONCUR'99, LNCS 1664, 114\u2013129, 1999.","DOI":"10.1007\/3-540-48320-9_10"},{"key":"10.1016\/S1571-0661(04)80484-5_NEWBIB4","first-page":"496","article-title":"Compositional Message Sequence Charts","author":"Gunter","year":"2001","journal-title":"Tools and Algorithms for the Construction and Analysis of Systems (TACAS)"},{"year":"1992","series-title":"Design and Validation of Computer Protocols","author":"Holzmann","key":"10.1016\/S1571-0661(04)80484-5_NEWBIB5"},{"key":"10.1016\/S1571-0661(04)80484-5_NEWBIB6","unstructured":"ITU-T Recommendation Z.120, Message Sequence Chart (MSC), 1996."},{"year":"1994","series-title":"Computer-Aided Verification of Coordinating Processes: The Automata-Theoretic Approach","author":"Kurshan","key":"10.1016\/S1571-0661(04)80484-5_NEWBIB7"},{"key":"10.1016\/S1571-0661(04)80484-5_NEWBIB8","doi-asserted-by":"crossref","unstructured":"P. Madhusudan. Reasoning about sequential and branching behaviours of message sequence graphs. In Proc. of ICALP'01, LNCS 2076, 809\u2013820, 2001.","DOI":"10.1007\/3-540-48224-5_66"},{"key":"10.1016\/S1571-0661(04)80484-5_NEWBIB9","doi-asserted-by":"crossref","unstructured":"A. Mazurkiewicz, Basic notions of trace theory, REX workshop 1988, 285\u2013363, LNCS 354, Springer, 1988.","DOI":"10.1007\/BFb0013025"},{"key":"10.1016\/S1571-0661(04)80484-5_NEWBIB10","doi-asserted-by":"crossref","unstructured":"A. Muscholl and D. Peled. Message sequence graphs and decision problems on Mazurkiewicz In Proc. MFCS'99, LNCS 1672, 81\u201391, 1999.","DOI":"10.1007\/3-540-48340-3_8"},{"key":"10.1016\/S1571-0661(04)80484-5_NEWBIB11","doi-asserted-by":"crossref","unstructured":"A. Muscholl, D. Peled, and Z. Su. Deciding properties of message sequence charts. In Proc. of FoSSaCS'98, LNCS 1378, 226\u2013242, 1998.","DOI":"10.1007\/BFb0053553"},{"key":"10.1016\/S1571-0661(04)80484-5_NEWBIB12","series-title":"The Book of Traces","first-page":"167","article-title":"Recognizable trace languages","author":"Ochmanski","year":"1995"},{"key":"10.1016\/S1571-0661(04)80484-5_NEWBIB13","doi-asserted-by":"crossref","unstructured":"D. Peled. Specification and verification of message sequence charts. In Proc. of FORTE\/PSTV 2000, 2000.","DOI":"10.1007\/978-0-387-35533-7_9"},{"key":"10.1016\/S1571-0661(04)80484-5_NEWBIB14","unstructured":"M. Y. Vardi, P. Wolper, An automata-theoretic approach to automatic program verification, Proceedings of the 1st Annual Symposium on Logic in Computer Science IEEE, 1986, 332\u2013344."}],"container-title":["Electronic Notes in Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066104804845?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066104804845?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:04:26Z","timestamp":1761609866000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571066104804845"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,5]]},"references-count":14,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2002,5]]}},"alternative-id":["S1571066104804845"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0661(04)80484-5","relation":{},"ISSN":["1571-0661"],"issn-type":[{"type":"print","value":"1571-0661"}],"subject":[],"published":{"date-parts":[[2002,5]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Specification and Verification using Message Sequence Charts","name":"articletitle","label":"Article Title"},{"value":"Electronic Notes in Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S1571-0661(04)80484-5","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2002 Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}