{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,9]],"date-time":"2025-10-09T20:52:36Z","timestamp":1760043156543,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540744061"},{"type":"electronic","value":"9783540744078"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-74407-8_12","type":"book-chapter","created":{"date-parts":[[2007,8,18]],"date-time":"2007-08-18T14:30:48Z","timestamp":1187447448000},"page":"166-180","source":"Crossref","is-referenced-by-count":6,"title":["Causal Message Sequence Charts"],"prefix":"10.1007","author":[{"given":"Thomas","family":"Gazagnaire","sequence":"first","affiliation":[]},{"given":"Blaise","family":"Genest","sequence":"additional","affiliation":[]},{"given":"Lo\u00efc","family":"H\u00e9lou\u00ebt","sequence":"additional","affiliation":[]},{"given":"P. S.","family":"Thiagarajan","sequence":"additional","affiliation":[]},{"given":"Shaofa","family":"Yang","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"12_CR1","doi-asserted-by":"crossref","unstructured":"Ahuja, M., Kshemkalyani, A.D., Carlson, T.: A basic unit of computation in distributed sytems. In: Proc. of ICDS 1990, pp. 12\u201319 (1990)","DOI":"10.1109\/ICDCS.1990.89327"},{"key":"12_CR2","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)"},{"key":"12_CR3","unstructured":"Brand, D., Zafiropoulo, P.: On communicating finite state machines. Technical Report RZ1053, IBM Zurich Research Lab (1981)"},{"volume-title":"The Book of Traces","year":"1995","key":"12_CR4","unstructured":"Diekert, V., Rozenberg, G. (eds.): The Book of Traces. World Scientific, Singapore (1995)"},{"issue":"6","key":"12_CR5","doi-asserted-by":"publisher","first-page":"920","DOI":"10.1016\/j.ic.2006.01.005","volume":"204","author":"B. Genest","year":"2006","unstructured":"Genest, B., Kuske, D., Muscholl, A.: A Kleene theorem and model checking for a class of communicating automata. Information and Computation\u00a0204(6), 920\u2013956 (2006)","journal-title":"Information and Computation"},{"issue":"4","key":"12_CR6","doi-asserted-by":"publisher","first-page":"617","DOI":"10.1016\/j.jcss.2005.09.007","volume":"72","author":"B. Genest","year":"2006","unstructured":"Genest, B., Muscholl, A., Seidl, H., Zeitoun, M.: Infinite-state high-level MSCs: Model-checking and realizability. Journal of Computer and System Sciences\u00a072(4), 617\u2013647 (2006)","journal-title":"Journal of Computer and System Sciences"},{"key":"12_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45319-9_34","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"E. Gunter","year":"2001","unstructured":"Gunter, E., Muscholl, A., Peled, D.: Compositional message sequence charts. In: Margaria, T., Yi, W. (eds.) ETAPS 2001 and TACAS 2001. LNCS, vol.\u00a02031, Springer, Heidelberg (2001)"},{"issue":"1","key":"12_CR8","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. Information and Computation\u00a0202(1), 1\u201338 (2005)","journal-title":"Information and Computation"},{"key":"12_CR9","unstructured":"H\u00e9lou\u00ebt, L., Le Maigat, P.: Decomposition of message sequence charts. In: Proc. of SAM 2000 (2000)"},{"key":"12_CR10","unstructured":"ITU-TS: ITU-TS Recommendation Z.120: Message Sequence Chart (MSC). ITU-TS (1999)"},{"issue":"1","key":"12_CR11","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1016\/S0890-5401(03)00123-8","volume":"187","author":"D. Kuske","year":"2003","unstructured":"Kuske, D.: Regular sets of infinite message sequence charts. Information and Computation\u00a0187(1), 80\u2013109 (2003)","journal-title":"Information and Computation"},{"key":"12_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"523","DOI":"10.1007\/3-540-45841-7_43","volume-title":"STACS 2002","author":"R. Morin","year":"2002","unstructured":"Morin, R.: Recognizable sets of message sequence charts. In: Alt, H., Ferreira, A. (eds.) STACS 2002. LNCS, vol.\u00a02285, pp. 523\u2013534. Springer, Heidelberg (2002)"},{"key":"12_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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, Springer, Heidelberg (1999)"},{"key":"12_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1007\/BFb0053553","volume-title":"Foundations of Software Science and Computation Structures","author":"A. Muscholl","year":"1998","unstructured":"Muscholl, A., Peled, D., Su, Z.: Deciding properties for message sequence charts. In: Nivat, M. (ed.) ETAPS 1998 and FOSSACS 1998. LNCS, vol.\u00a01378, pp. 226\u2013242. Springer, Heidelberg (1998)"},{"key":"12_CR15","unstructured":"Reniers, M.: Message Sequence Chart: Syntax and Semantics. PhD thesis, Eindhoven University of Technology (1999)"}],"container-title":["Lecture Notes in Computer Science","CONCUR 2007 \u2013 Concurrency Theory"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-74407-8_12.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,20]],"date-time":"2025-01-20T13:10:22Z","timestamp":1737378622000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-74407-8_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540744061","9783540744078"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-74407-8_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}