{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T03:06:03Z","timestamp":1725505563821},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540784975"},{"type":"electronic","value":"9783540784999"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-78499-9_32","type":"book-chapter","created":{"date-parts":[[2008,4,1]],"date-time":"2008-04-01T23:02:25Z","timestamp":1207090945000},"page":"458-473","source":"Crossref","is-referenced-by-count":0,"title":["Products of Message Sequence Charts"],"prefix":"10.1007","author":[{"given":"Philippe","family":"Darondeau","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Blaise","family":"Genest","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lo\u00efc","family":"H\u00e9lou\u00ebt","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"32_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"797","DOI":"10.1007\/3-540-48224-5_65","volume-title":"Automata, Languages and Programming","author":"R. Alur","year":"2001","unstructured":"Alur, R., Etessami, K., Yannakakis, M.: Realizability and Verification of MSC Graphs. In: Orejas, F., Spirakis, P.G., van Leeuwen, J. (eds.) ICALP 2001. LNCS, vol.\u00a02076, pp. 797\u2013808. Springer, Heidelberg (2001)"},{"key":"32_CR2","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, pp. 125\u2013152. Springer, Heidelberg (2001)"},{"issue":"3","key":"32_CR3","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/0304-3975(86)90094-0","volume":"48","author":"C. Duboc","year":"1986","unstructured":"Duboc, C.: Mixed Product and Asynchronous Automata. Theoretical Computer Science\u00a048(3), 183\u2013199 (1986)","journal-title":"Theoretical Computer Science"},{"issue":"6","key":"32_CR4","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. Inf. Comput.\u00a0204(6), 920\u2013956 (2006)","journal-title":"Inf. Comput."},{"key":"32_CR5","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. Gunter","year":"2001","unstructured":"Gunter, E., Muscholl, A., Peled, D.: Compositional Message Sequence Charts. STTT 5(1), 78\u201389, (2003); In: Margaria, T., Yi, W. (eds.) TACAS 2001. LNCS, vol.\u00a02031, pp. 496\u2013511. Springer, Heidelberg (2001)"},{"key":"32_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"537","DOI":"10.1007\/978-3-540-27755-2_15","volume-title":"Lectures on Concurrency and Petri Nets","author":"B. Genest","year":"2004","unstructured":"Genest, B., Muscholl, A., Peled, D.: Message Sequence Charts. In: Desel, J., Reisig, W., Rozenberg, G. (eds.) ACPN 2003. LNCS, vol.\u00a03098, pp. 537\u2013558. Springer, Heidelberg (2004)"},{"key":"#cr-split#-32_CR7.1","doi-asserted-by":"crossref","unstructured":"Genest, B., Muscholl, A., Seidl, H., Zeitoun, M.: Infinite-state High-level MSCs: Model-checking and Realizability. JCSS??72(4), 617???647 (2006);","DOI":"10.1016\/j.jcss.2005.09.007"},{"key":"#cr-split#-32_CR7.2","unstructured":"Widmayer, P., Triguero, F., Morales, R., Hennessy, M., Eidenbenz, S., Conejo, R. (eds.): ICALP 2002. LNCS, vol.??2380, pp. 617???647. Springer, Heidelberg (2002)"},{"key":"32_CR8","unstructured":"H\u00e9lou\u00ebt, L., Jard, C.: Conditions for synthesis of communicating automata from HMSCs. In: FMICS 2000, pp. 203\u2013224 (2000)"},{"issue":"1","key":"32_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., Kumar, K.N., Sohoni, M.A., Thiagarajan, P.S.: A theory of regular MSC languages. Inf. Comput.\u00a0202(1), 1\u201338 (2005)","journal-title":"Inf. Comput."},{"key":"32_CR10","unstructured":"Klein, J., Caillaud, B., H\u00e9lou\u00ebt, L.: Merging scenarios. In: FMICS 2004, pp. 209\u2013226 (2004)"},{"issue":"2","key":"32_CR11","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1016\/j.ic.2003.10.002","volume":"189","author":"M. Lohrey","year":"2004","unstructured":"Lohrey, M., Muscholl, A.: Bounded MSC communication. Inf. Comput.\u00a0189(2), 160\u2013181 (2004)","journal-title":"Inf. Comput."},{"key":"32_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1007\/3-540-45294-X_22","volume-title":"FST TCS 2001: Foundations of Software Technology and Theoretical Computer Science","author":"P. Madhusudan","year":"2001","unstructured":"Madhusudan, P., Meenakshi, B.: Beyond Message Sequence Graphs. In: Hariharan, R., Mukund, M., Vinay, V. (eds.) FSTTCS 2001. LNCS, vol.\u00a02245, pp. 256\u2013267. Springer, Heidelberg (2001)"},{"key":"32_CR13","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)"},{"issue":"1","key":"32_CR14","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., Kumar, K.N., Sohoni, M.A.: Bounded time-stamping in message-passing systems. TCS\u00a0290(1), 221\u2013239 (2003)","journal-title":"TCS"},{"key":"32_CR15","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 of Message Sequence Charts. In: Nivat, M. (ed.) FOSSACS 1998. LNCS, vol.\u00a01378, pp. 226\u2013242. Springer, Heidelberg (1998)"},{"key":"32_CR16","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)"}],"container-title":["Lecture Notes in Computer Science","Foundations of Software Science and Computational Structures"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-78499-9_32.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T11:11:35Z","timestamp":1619521895000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-78499-9_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540784975","9783540784999"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-78499-9_32","relation":{},"subject":[]}}