{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T13:26:39Z","timestamp":1742390799314},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540304951"},{"type":"electronic","value":"9783540324195"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11590156_27","type":"book-chapter","created":{"date-parts":[[2005,12,5]],"date-time":"2005-12-05T10:43:16Z","timestamp":1133779396000},"page":"335-347","source":"Crossref","is-referenced-by-count":15,"title":["Causal Closure for MSC Languages"],"prefix":"10.1007","author":[{"given":"Bharat","family":"Adsul","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Madhavan","family":"Mukund","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"K. Narayan","family":"Kumar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vasumathi","family":"Narayanan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"27_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, pp. 114\u2013129. Springer, Heidelberg (1999)"},{"issue":"7","key":"27_CR2","doi-asserted-by":"publisher","first-page":"623","DOI":"10.1109\/TSE.2003.1214326","volume":"29","author":"R. Alur","year":"2003","unstructured":"Alur, R., Etessami, K., Yannakakis, M.: Inference of message sequence graphs. IEEE Trans. Software Engg\u00a029(7), 623\u2013633 (2003)","journal-title":"IEEE Trans. Software Engg"},{"issue":"1","key":"27_CR3","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/j.tcs.2004.09.034","volume":"331","author":"R. Alur","year":"2005","unstructured":"Alur, R., Etessami, K., Yannakakis, M.: Realizability and Verification of MSC Graphs. Theor. Comput. Sci.\u00a0331(1), 97\u2013114 (2005)","journal-title":"Theor. Comput. Sci."},{"key":"27_CR4","volume-title":"Unified Modeling Language User Guide","author":"G. Booch","year":"1997","unstructured":"Booch, G., Jacobson, I., Rumbaugh, J.: Unified Modeling Language User Guide. Addison-Wesley, Reading (1997)"},{"key":"27_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/3-540-45510-8_5","volume-title":"Modeling and Verification of Parallel Processes","author":"B. Caillaud","year":"2001","unstructured":"Caillaud, B., Darondeau, P., H\u00e9lou\u00ebt, L., Lesventes, G.: HMSCS as partial specifications...with PNs as completions. In: Cassez, F., Jard, C., Rozoy, B., Dermot, M. (eds.) MOVEP 2000. LNCS, vol.\u00a02067, p. 125. Springer, Heidelberg (2001)"},{"key":"27_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1007\/978-3-540-30550-7_4","volume-title":"Developments in Language Theory","author":"B. Genest","year":"2004","unstructured":"Genest, B., Muscholl, A., Kuske, D.: A Kleene Theorem for a Class of Communicating Automata with Effective Algorithms. In: Calude, C.S., Calude, E., Dinneen, M.J. (eds.) DLT 2004. LNCS, vol.\u00a03340, pp. 30\u201348. Springer, Heidelberg (2004)"},{"key":"27_CR7","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, pp. 657\u2013668. Springer, Heidelberg (2002)"},{"key":"27_CR8","first-page":"31","volume-title":"Executable object modeling with statecharts","author":"D. Harel","year":"1997","unstructured":"Harel, D., Gery, E.: Executable object modeling with statecharts. In: Harel, D., Gery, E. (eds.) Executable object modeling with statecharts, pp. 31\u201342. IEEE Computer, Los Alamitos (July 1997)"},{"issue":"1","key":"27_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ic.2004.08.004","volume":"202","author":"J.G. Henriksen","year":"2005","unstructured":"Henriksen, J.G., Mukund, M., Narayan Kumar, K., Sohoni, M., Thiagarajan, P.S.: A Theory of Regular MSC Languages. Inf. Comp.\u00a0202(1), 1\u201338 (2005)","journal-title":"Inf. Comp."},{"key":"27_CR10","unstructured":"ITU-TS Recommendation Z.120: Message Sequence Chart (MSC). ITU-TS, Geneva (1997)"},{"key":"27_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/3-540-45694-5_13","volume-title":"CONCUR 2002 - Concurrency Theory","author":"M. Lohrey","year":"2002","unstructured":"Lohrey, M.: Safe realizability of high-level message sequence charts. In: Brim, L., Jan\u010dar, P., K\u0159et\u00ednsk\u00fd, M., Kucera, A. (eds.) CONCUR 2002. LNCS, vol.\u00a02421, pp. 177\u2013192. Springer, Heidelberg (2002)"},{"key":"27_CR12","first-page":"291","volume-title":"Proc SDL 1997","author":"S. Mauw","year":"1997","unstructured":"Mauw, S., Reniers, M.A.: High-level message sequence charts. In: Proc SDL 1997, pp. 291\u2013306. Elsevier, Amsterdam (1997)"},{"issue":"1","key":"27_CR13","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1016\/S0304-3975(01)00329-2","volume":"290","author":"M. Mukund","year":"2003","unstructured":"Mukund, M., Narayan Kumar, K., Sohoni, M.: Bounded time-stamping in message-passing systems. Theor. Comput. Sci.\u00a0290(1), 221\u2013239 (2003)","journal-title":"Theor. Comput. Sci."},{"key":"27_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1007\/3-540-48340-3_8","volume-title":"Mathematical Foundations of Computer Science 1999","author":"A. Muscholl","year":"1999","unstructured":"Muscholl, A., Peled, D.: Message sequence graphs and decision problems on Mazurkiewicz traces. In: Kuty\u0142owski, M., Wierzbicki, T., Pacholski, L. (eds.) MFCS 1999. LNCS, vol.\u00a01672, pp. 81\u201391. Springer, Heidelberg (1999)"},{"key":"27_CR15","doi-asserted-by":"crossref","unstructured":"Rudolph, E., Graubmann, P., Grabowski, J.: Tutorial on message sequence charts. Computer Networks and ISDN Systems \u2014 SDL and MSC\u00a028 (1996)","DOI":"10.1016\/0169-7552(95)00122-0"}],"container-title":["Lecture Notes in Computer Science","FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11590156_27.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T02:49:10Z","timestamp":1619491750000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11590156_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540304951","9783540324195"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/11590156_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}