{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:48:14Z","timestamp":1742914094440,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540330561"},{"type":"electronic","value":"9783540330578"}],"license":[{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11691372_32","type":"book-chapter","created":{"date-parts":[[2006,3,28]],"date-time":"2006-03-28T09:22:26Z","timestamp":1143537746000},"page":"455-458","source":"Crossref","is-referenced-by-count":4,"title":["MSCan\u00a0\u2013 A Tool for Analyzing MSC Specifications"],"prefix":"10.1007","author":[{"given":"Benedikt","family":"Bollig","sequence":"first","affiliation":[]},{"given":"Carsten","family":"Kern","sequence":"additional","affiliation":[]},{"given":"Markus","family":"Schl\u00fctter","sequence":"additional","affiliation":[]},{"given":"Volker","family":"Stolz","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"32_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1007\/3-540-48320-9_10","volume-title":"CONCUR\u201999. Concurrency Theory","author":"R. Alur","year":"1999","unstructured":"Alur, R., Yannakakis, M.: Model checking of message sequence charts. In: Baeten, J.C.M., Mauw, S. (eds.) CONCUR 1999. LNCS, vol.\u00a01664, p. 114. Springer, Heidelberg (1999)"},{"key":"32_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0035393","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"H. Ben-Abdallah","year":"1997","unstructured":"Ben-Abdallah, H., Leue, S.: Syntactic detection of process divergence and nonlocal choice in message sequence charts. In: Brinksma, E. (ed.) TACAS 1997. LNCS, vol.\u00a01217. Springer, Heidelberg (1997)"},{"key":"32_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1007\/BFb0054168","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"H. Ben-Abdallah","year":"1998","unstructured":"Ben-Abdallah, H., Leue, S.: MESA: Support for scenario-based design of concurrent systems. In: Steffen, B. (ed.) TACAS 1998. LNCS, vol.\u00a01384, p. 118. Springer, Heidelberg (1998)"},{"key":"32_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"429","DOI":"10.1007\/978-3-540-31980-1_28","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"B. Genest","year":"2005","unstructured":"Genest, B.: Compositional message sequence charts (CMSCs) are better to implement than mSCs. In: Halbwachs, N., Zuck, L.D. (eds.) TACAS 2005. LNCS, vol.\u00a03440, pp. 429\u2013444. Springer, Heidelberg (2005)"},{"key":"32_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"657","DOI":"10.1007\/3-540-45465-9_56","volume-title":"Automata, Languages and Programming","author":"B. Genest","year":"2002","unstructured":"Genest, B., Muscholl, A., Seidl, H., Zeitoun, M.: Infinite-state high-level mSCs: Model-checking and realizability. In: Widmayer, P., Triguero, F., Morales, R., Hennessy, M., Eidenbenz, S., Conejo, R. (eds.) ICALP 2002. LNCS, vol.\u00a02380, p. 657. Springer, Heidelberg (2002)"},{"key":"32_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"496","DOI":"10.1007\/3-540-45319-9_34","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"E.L. Gunter","year":"2001","unstructured":"Gunter, E.L., Muscholl, A., Peled, D.A.: Compositional message sequence charts. In: Margaria, T., Yi, W. (eds.) TACAS 2001. LNCS, vol.\u00a02031, p. 496. Springer, Heidelberg (2001)"},{"key":"32_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"675","DOI":"10.1007\/3-540-45022-X_57","volume-title":"Automata, Languages and Programming","author":"J.G. Henriksen","year":"2000","unstructured":"Henriksen, J.G., Mukund, M., Narayan Kumar, K., Thiagarajan, P.S.: On message sequence graphs and finitely generated regular MSC languages. In: Welzl, E., Montanari, U., Rolim, J.D.P. (eds.) ICALP 2000. LNCS, vol.\u00a01853, p. 675. Springer, Heidelberg (2000)"},{"key":"32_CR8","unstructured":"ITU-TS Recommendation Z.120: Message Sequence Chart 1999 (MSC 1999) (1999)"},{"key":"32_CR9","unstructured":"Neukirchen, H.: MSC 2000 Parser. CS Dept., University of G\u00f6ttingen (2000)"},{"key":"32_CR10","unstructured":"Grappa (Version 1.2), \n                    \n                      http:\/\/www.research.att.com\/~john\/Grappa\/"},{"key":"32_CR11","unstructured":"MSCan, \n                    \n                      http:\/\/www-i2.informatik.rwth-aachen.de\/MSCan\/"},{"key":"32_CR12","unstructured":"MSC Execute, \n                    \n                      http:\/\/www-i2.informatik.rwth-aachen.de\/MSCExecute\/"}],"container-title":["Lecture Notes in Computer Science","Tools and Algorithms for the Construction and Analysis of Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11691372_32","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T13:33:49Z","timestamp":1558272829000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11691372_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540330561","9783540330578"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/11691372_32","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}