{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:38:44Z","timestamp":1725557924724},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642131813"},{"type":"electronic","value":"9783642131820"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-13182-0_5","type":"book-chapter","created":{"date-parts":[[2010,6,12]],"date-time":"2010-06-12T14:55:17Z","timestamp":1276354517000},"page":"48-59","source":"Crossref","is-referenced-by-count":10,"title":["Realizability of Dynamic MSC Languages"],"prefix":"10.1007","author":[{"given":"Benedikt","family":"Bollig","sequence":"first","affiliation":[]},{"given":"Lo\u00efc","family":"H\u00e9lou\u00ebt","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"5_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1007\/11590156_27","volume-title":"FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science","author":"B. Adsul","year":"2005","unstructured":"Adsul, B., Mukund, M., Narayan Kumar, K., Narayanan, V.: Causal closure for MSC languages. In: Sarukkai, S., Sen, S. (eds.) FSTTCS 2005. LNCS, vol.\u00a03821, pp. 335\u2013347. Springer, Heidelberg (2005)"},{"issue":"1","key":"5_CR2","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. Theoretical Computer Science\u00a0331(1), 97\u2013114 (2005)","journal-title":"Theoretical Computer Science"},{"key":"5_CR3","doi-asserted-by":"crossref","unstructured":"Bollig, B., H\u00e9lou\u00ebt, L.: Realizability of dynamic MSC languages. Research report, LSV, ENS Cachan (2010), http:\/\/www.lsv.ens-cachan.fr\/Publis\/","DOI":"10.1007\/978-3-642-13182-0_5"},{"issue":"2-3","key":"5_CR4","doi-asserted-by":"publisher","first-page":"382","DOI":"10.1016\/j.tcs.2008.06.012","volume":"403","author":"L. Bozzelli","year":"2008","unstructured":"Bozzelli, L., La Torre, S., Peron, A.: Verification of well-formed communicating recursive state machines. Theoretical Computer Science\u00a0403(2-3), 382\u2013405 (2008)","journal-title":"Theoretical Computer Science"},{"key":"5_CR5","doi-asserted-by":"crossref","unstructured":"Brand, D., Zafiropulo, P.: On communicating finite-state machines. JACM\u00a030(2) (1983)","DOI":"10.1145\/322374.322380"},{"issue":"41","key":"5_CR6","doi-asserted-by":"publisher","first-page":"4094","DOI":"10.1016\/j.tcs.2009.06.013","volume":"410","author":"T. Gazagnaire","year":"2009","unstructured":"Gazagnaire, T., Genest, B., H\u00e9lou\u00ebt, L., Thiagarajan, P.S., Yang, S.: Causal message sequence charts. Theor. Comput. Sci.\u00a0410(41), 4094\u20134110 (2009)","journal-title":"Theor. Comput. Sci."},{"issue":"4","key":"5_CR7","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 on Comp. and System Sciences\u00a072(4), 617\u2013647 (2006)","journal-title":"Journal on Comp. and System Sciences"},{"issue":"1","key":"5_CR8","doi-asserted-by":"crossref","first-page":"78","DOI":"10.1007\/s10009-002-0085-2","volume":"5","author":"E.L. Gunter","year":"2003","unstructured":"Gunter, E.L., Muscholl, A., Peled, D.: Compositional message sequence charts. STTT\u00a05(1), 78\u201389 (2003)","journal-title":"STTT"},{"key":"5_CR9","first-page":"203","volume-title":"FMICS\u201900","author":"L. H\u00e9lou\u00ebt","year":"2000","unstructured":"H\u00e9lou\u00ebt, L., Jard, C.: Conditions for synthesis of communicating automata from HMSCs. In: FMICS\u201900, pp. 203\u2013224. Springer, Heidelberg (2000)"},{"issue":"1","key":"5_CR10","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":"5_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1007\/3-540-36206-1_23","volume-title":"FST TCS 2002: Foundations of Software Technology and Theoretical Computer Science","author":"M. Leucker","year":"2002","unstructured":"Leucker, M., Madhusudan, P., Mukhopadhyay, S.: Dynamic message sequence charts. In: Agrawal, M., Seth, A.K. (eds.) FSTTCS 2002. LNCS, vol.\u00a02556, pp. 253\u2013264. Springer, Heidelberg (2002)"},{"issue":"1-3","key":"5_CR12","doi-asserted-by":"publisher","first-page":"529","DOI":"10.1016\/j.tcs.2003.08.002","volume":"309","author":"M. Lohrey","year":"2003","unstructured":"Lohrey, M.: Realizability of high-level message sequence charts: closing the gaps. Theoretical Computer Science\u00a0309(1-3), 529\u2013554 (2003)","journal-title":"Theoretical Computer Science"},{"issue":"12","key":"5_CR13","doi-asserted-by":"publisher","first-page":"1629","DOI":"10.1016\/0169-7552(95)00122-0","volume":"28","author":"E. Rudolph","year":"1996","unstructured":"Rudolph, E., Graubmann, P., Grabowski, J.: Tutorial on message sequence charts. Computer Networks and ISDN Systems\u00a028(12), 1629\u20131641 (1996)","journal-title":"Computer Networks and ISDN Systems"}],"container-title":["Lecture Notes in Computer Science","Computer Science \u2013 Theory and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-13182-0_5.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,29]],"date-time":"2021-10-29T11:13:21Z","timestamp":1635506001000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-13182-0_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642131813","9783642131820"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-13182-0_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}