{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T06:47:47Z","timestamp":1725518867900},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642370632"},{"type":"electronic","value":"9783642370649"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-37064-9_17","type":"book-chapter","created":{"date-parts":[[2013,3,15]],"date-time":"2013-03-15T08:07:12Z","timestamp":1363334832000},"page":"177-189","source":"Crossref","is-referenced-by-count":6,"title":["Dynamic Communicating Automata and Branching High-Level MSCs"],"prefix":"10.1007","author":[{"given":"Benedikt","family":"Bollig","sequence":"first","affiliation":[]},{"given":"Aiswarya","family":"Cyriac","sequence":"additional","affiliation":[]},{"given":"Lo\u00efc","family":"H\u00e9lou\u00ebt","sequence":"additional","affiliation":[]},{"given":"Ahmet","family":"Kara","sequence":"additional","affiliation":[]},{"given":"Thomas","family":"Schwentick","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1","key":"17_CR1","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"},{"doi-asserted-by":"crossref","unstructured":"Atig, M.F., Bouajjani, A., Qadeer, S.: Context-bounded analysis for concurrent programs with dynamic creation of threads. Logical Methods in Computer Science 7(4) (2011)","key":"17_CR2","DOI":"10.2168\/LMCS-7(4:4)2011"},{"doi-asserted-by":"crossref","unstructured":"Bollig, B., Cyriac, A., H\u00e9lou\u00ebt, L., Kara, A., Schwentick, T.: Dynamic Communicating Automata and Branching High-Level MSCs. Research Report LSV-12-20, LSV (November 2012)","key":"17_CR3","DOI":"10.1007\/978-3-642-37064-9_17"},{"key":"17_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1007\/978-3-642-13182-0_5","volume-title":"Computer Science \u2013 Theory and Applications","author":"B. Bollig","year":"2010","unstructured":"Bollig, B., H\u00e9lou\u00ebt, L.: Realizability of Dynamic MSC Languages. In: Ablayev, F., Mayr, E.W. (eds.) CSR 2010. LNCS, vol.\u00a06072, pp. 48\u201359. Springer, Heidelberg (2010)"},{"issue":"2","key":"17_CR5","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/j.entcs.2007.11.002","volume":"194","author":"J. Borgstr\u00f6m","year":"2008","unstructured":"Borgstr\u00f6m, J., Gordon, A., Phillips, A.: A chart semantics for the Pi-calculus. Electronic Notes in Theoretical Computer Science\u00a0194(2), 3\u201329 (2008)","journal-title":"Electronic Notes in Theoretical Computer Science"},{"issue":"2-3","key":"17_CR6","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"},{"doi-asserted-by":"crossref","unstructured":"Brand, D., Zafiropulo, P.: On communicating finite-state machines. Journal of the ACM 30(2) (1983)","key":"17_CR7","DOI":"10.1145\/322374.322380"},{"key":"17_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1007\/3-540-45315-6_7","volume-title":"Foundations of Software Science and Computation Structures","author":"M.G. Buscemi","year":"2001","unstructured":"Buscemi, M.G., Sassone, V.: High-Level Petri Nets as Type Theories in the Join Calculus. In: Honsell, F., Miculan, M. (eds.) FOSSACS 2001. LNCS, vol.\u00a02030, pp. 104\u2013120. Springer, Heidelberg (2001)"},{"issue":"6","key":"17_CR9","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 algorithms for existentially bounded communicating automata. Information and Computation\u00a0204(6), 920\u2013956 (2006)","journal-title":"Information and Computation"},{"issue":"4","key":"17_CR10","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"},{"unstructured":"H\u00e9lou\u00ebt, L., Jard, C.: Conditions for synthesis of communicating automata from HMSCs. In: Proceedings of FMICS 2000, pp. 203\u2013224. Springer (2000)","key":"17_CR11"},{"issue":"1","key":"17_CR12","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.A., Thiagarajan, P.S.: A theory of regular MSC languages. Inf. Comput.\u00a0202(1), 1\u201338 (2005)","journal-title":"Inf. Comput."},{"unstructured":"ITU-TS: ITU-TS Recommendation Z.120: Message Sequence Chart (MSC). ITU-TS, Geneva (February 2011)","key":"17_CR13"},{"key":"17_CR14","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-2","key":"17_CR15","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1016\/S0304-3975(00)00031-1","volume":"237","author":"K. Lodaya","year":"2000","unstructured":"Lodaya, K., Weil, P.: Series-parallel languages and the bounded-width property. Theoretical Computer Science\u00a0237(1-2), 347\u2013380 (2000)","journal-title":"Theoretical Computer Science"},{"issue":"2","key":"17_CR16","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1006\/inco.2001.3077","volume":"171","author":"K. Lodaya","year":"2001","unstructured":"Lodaya, K., Weil, P.: Rationality in algebras with a series operation. Information and Computation\u00a0171(2), 269\u2013293 (2001)","journal-title":"Information and Computation"},{"issue":"1-3","key":"17_CR17","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"},{"key":"17_CR18","first-page":"477","volume-title":"Proceedings of IFIP TCS 2008","author":"R. Meyer","year":"2008","unstructured":"Meyer, R.: On Boundedness in Depth in the \u03c0-Calculus. In: Ausiello, G., Karhum\u00e4ki, J., Mauri, G., Ong, L. (eds.) Proceedings of IFIP TCS 2008, vol.\u00a0273, pp. 477\u2013489. Springer, Boston (2008)"},{"issue":"1","key":"17_CR19","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0890-5401(92)90008-4","volume":"100","author":"R. Milner","year":"1992","unstructured":"Milner, R., Parrow, J., Walker, D.: A calculus of mobile processes, I. Information and Computation\u00a0100(1), 1\u201340 (1992)","journal-title":"Information and Computation"},{"key":"17_CR20","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":"17_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/11874683_3","volume-title":"Computer Science Logic","author":"L. Segoufin","year":"2006","unstructured":"Segoufin, L.: Automata and Logics for Words and Trees over an Infinite Alphabet. In: \u00c9sik, Z. (ed.) CSL 2006. LNCS, vol.\u00a04207, pp. 41\u201357. Springer, Heidelberg (2006)"}],"container-title":["Lecture Notes in Computer Science","Language and Automata Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-37064-9_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T01:25:48Z","timestamp":1558315548000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-37064-9_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642370632","9783642370649"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-37064-9_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}