{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T13:54:51Z","timestamp":1742392491162},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540422877"},{"type":"electronic","value":"9783540482246"}],"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_65","type":"book-chapter","created":{"date-parts":[[2007,10,28]],"date-time":"2007-10-28T02:29:04Z","timestamp":1193538544000},"page":"797-808","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":38,"title":["Realizability and Verification of MSC Graphs"],"prefix":"10.1007","author":[{"given":"Rajeev","family":"Alur","sequence":"first","affiliation":[]},{"given":"Kousha","family":"Etessami","sequence":"additional","affiliation":[]},{"given":"Mihalis","family":"Yannakakis","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,7,4]]},"reference":[{"key":"65_CR1","doi-asserted-by":"crossref","unstructured":"R. Alur, K. Etessami, and M. Yannakakis. Inference of message sequence charts. In Proc. of 22nd Int. Conf. on Software Engineering, 2000.","DOI":"10.1145\/337180.337215"},{"issue":"2","key":"65_CR2","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. Software Concepts and Tools, 17(2):70\u201377, 1996.","journal-title":"Software Concepts and Tools"},{"key":"65_CR3","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1007\/3-540-48320-9_10","volume-title":"Concurrency Theory, Tenth Intl. Conference","author":"R. Alur","year":"1999","unstructured":"R. Alur and M. Yannakakis. Model checking of message sequence charts. In Concurrency Theory, Tenth Intl. Conference, LNCS 1664, pages 114\u2013129, 1999."},{"key":"65_CR4","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"118","DOI":"10.1007\/BFb0054168","volume-title":"Proc. 4th TACAS","author":"H. Ben-Abdallah","year":"1998","unstructured":"H. Ben-Abdallah and S. Leue. MESA: Support for scenario-based design of concurrent systems. In Proc. 4th TACAS, LNCS 1384, pages 118\u2013135, 1998."},{"key":"65_CR5","unstructured":"G. Booch, I. Jacobson, and J. Rumbaugh. Unified Modeling Language User Guide. Addison Wesley, 1997."},{"key":"65_CR6","doi-asserted-by":"crossref","unstructured":"H. Ben-Abdallah and S. Leue. Syntactic detection of process divergence and non-local choice in message sequence charts. In Proc. 2nd TACAS, 1997.","DOI":"10.1007\/BFb0035393"},{"key":"65_CR7","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"675","DOI":"10.1007\/3-540-45022-X_57","volume-title":"Proc. 27th ICALP","author":"J. Henriksen","year":"2000","unstructured":"J. Henriksen, M. Mukund, K. Narayan Kumar, and P.S. Thiagarajan. On message sequence graphs and finitely generated regular MSC languages. In Proc. 27th ICALP, LNCS 1853, pp. 675\u2013686, 2000."},{"issue":"1","key":"65_CR8","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1002\/bltj.2034","volume":"2","author":"G.J. Holzmann","year":"1997","unstructured":"G.J. Holzmann, D.A. Peled, and M.H. Redberg. Design tools for for requirements engineering. Lucent Bell Labs Technical Journal, 2(1):86\u201395, 1997.","journal-title":"Lucent Bell Labs Technical Journal"},{"key":"65_CR9","doi-asserted-by":"crossref","unstructured":"A. Muscholl, D. Peled, and Z. Su. Deciding properties of message sequence charts. In Foundations of Software Science and Computation Structures, 1998.","DOI":"10.1007\/BFb0053553"},{"key":"65_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":"65_CR11","doi-asserted-by":"crossref","unstructured":"T.J. Schaefer. The complexity of satisfiability problems. In Proc. 10th ACM Symp. on Theory of Computing, pages 216\u2013226, 1978.","DOI":"10.1145\/800133.804350"},{"key":"65_CR12","unstructured":"[12]ITU-T recommendation Z.120. Message Sequence Charts (MSC\u201996), 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_65","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T10:46:55Z","timestamp":1558262815000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-48224-5_65"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540422877","9783540482246"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/3-540-48224-5_65","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]},"assertion":[{"value":"4 July 2001","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}