{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:56:31Z","timestamp":1725558991654},"publisher-location":"Berlin, Heidelberg","reference-count":29,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540240143"},{"type":"electronic","value":"9783540305507"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-30550-7_4","type":"book-chapter","created":{"date-parts":[[2010,7,2]],"date-time":"2010-07-02T19:06:05Z","timestamp":1278097565000},"page":"30-48","source":"Crossref","is-referenced-by-count":15,"title":["A Kleene Theorem for a Class of Communicating Automata with Effective Algorithms"],"prefix":"10.1007","author":[{"given":"Blaise","family":"Genest","sequence":"first","affiliation":[]},{"given":"Anca","family":"Muscholl","sequence":"additional","affiliation":[]},{"given":"Dietrich","family":"Kuske","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"2","key":"4_CR1","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1006\/inco.1996.0053","volume":"127","author":"P. Abdulla","year":"1996","unstructured":"Abdulla, P., Jonsson, B.: Verifying programs with unreliable channels. Information and Computation\u00a0127(2), 91\u2013101 (1996)","journal-title":"Information and Computation"},{"key":"4_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 1999. 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":"1-2","key":"4_CR3","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1016\/S0304-3975(99)00033-X","volume":"221","author":"A. Bouajjani","year":"1999","unstructured":"Bouajjani, A., Habermehl, P.: Symbolic Reachability Analysis of FIFO-Channel Systems with Nonregular Sets of Configurations. Theoretical Computer Science\u00a0221(1-2), 211\u2013250 (1999)","journal-title":"Theoretical Computer Science"},{"key":"4_CR4","unstructured":"Boigelot, B., Godefroid, P., Willems, B., Wolper, P.: The Power of QDDs. SAS 1997, 172\u2013186 (1997)"},{"issue":"3","key":"4_CR5","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1023\/A:1008719024240","volume":"14","author":"B. Boigelot","year":"1999","unstructured":"Boigelot, B., Godefroid, P.: Symbolic Verification of Communication Protocols with Infinite State Spaces using QDDs. Formal Methods in System Design\u00a014(3), 237\u2013255 (1999)","journal-title":"Formal Methods in System Design"},{"key":"4_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1007\/978-3-540-28644-8_10","volume-title":"CONCUR 2004 - Concurrency Theory","author":"B. Bollig","year":"2004","unstructured":"Bollig, B., Leucker, M.: Message-Passing Automata are expressively equivalent to EMSO logic. In: Gardner, P., Yoshida, N. (eds.) CONCUR 2004. LNCS, vol.\u00a03170, pp. 146\u2013160. Springer, Heidelberg (2004)"},{"issue":"2","key":"4_CR7","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1145\/322374.322380","volume":"30","author":"D. Brand","year":"1983","unstructured":"Brand, D., Zafiropulo, P.: On communicating finite-state machines. Journal of the ACM\u00a030(2), 323\u2013342 (1983)","journal-title":"Journal of the ACM"},{"volume-title":"The Book of Traces","year":"1995","key":"4_CR8","unstructured":"Diekert, V., Rozenberg, G. (eds.): The Book of Traces. World Scientific, Singapore (1995)"},{"key":"4_CR9","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/0304-3975(95)00130-1","volume":"154","author":"W. Ebinger","year":"1996","unstructured":"Ebinger, W., Muscholl, A.: Logical definability on infinite traces. Theoretical Computer Science\u00a0154, 67\u201384 (1996)","journal-title":"Theoretical Computer Science"},{"issue":"1,2","key":"4_CR10","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/S0304-3975(00)00102-X","volume":"256","author":"A. Finkel","year":"2001","unstructured":"Finkel, A., Schnoebelen, Ph.: Well-structured transition systems everywhere! Theoretical Computer Science\u00a0256(1,2), 63\u201392 (2001)","journal-title":"Theoretical Computer Science"},{"key":"4_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1007\/978-3-540-24727-2_15","volume-title":"Foundations of Software Science and Computation Structures","author":"B. Genest","year":"2004","unstructured":"Genest, B., Minea, M., Muscholl, A., Peled, D.A.: Specifying and verifying partial order properties using template MSCs. In: Walukiewicz, I. (ed.) FOSSACS 2004. LNCS, vol.\u00a02987, pp. 195\u2013210. Springer, Heidelberg (2004)"},{"key":"4_CR12","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.L. Gunter","year":"2001","unstructured":"Gunter, E.L., Muscholl, A., Peled, D.A.: Compositional message sequence charts. In: Margaria, T., Yi, W. (eds.) TACAS 2001. LNCS, vol.\u00a02031, pp. 496\u2013511. Springer, Heidelberg (2001): Journal version International Journal on Software Tools for Technology Transfer (STTT) 5(1), 78\u201389 (2003)"},{"key":"4_CR13","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":"4_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"675","DOI":"10.1007\/3-540-45022-X_57","volume-title":"Automata, Languages and Programming","author":"J.G. Henriksen","year":"2000","unstructured":"Henriksen, J.G., Mukund, M., Narayan Kumar, K., Thiagarajan, P.S.: On message sequence graphs and finitely generated regular MSC languages. In: Welzl, E., Montanari, U., Rolim, J.D.P. (eds.) ICALP 2000. LNCS, vol.\u00a01853, pp. 675\u2013686. Springer, Heidelberg (2000)"},{"key":"4_CR15","unstructured":"Henriksen, J.G., Mukund, M., Narayan Kumar, K., Sohoni, M., Thiagarajan, P.: A Theory of Regular MSC Languages. To appear in Information and Computation, available at http:\/\/www.comp.nus.edu.sg\/thiagu\/icregmsc.pdf"},{"key":"4_CR16","unstructured":"I.T.U.-T.S.: recommendation Z.120, Message Sequence Charts, Geneva (1999)"},{"key":"4_CR17","doi-asserted-by":"crossref","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\u00a0(187), 80\u2013109 (2003)","journal-title":"Information and Computation"},{"key":"4_CR18","doi-asserted-by":"crossref","unstructured":"Lohrey, M., Muscholl, A.: Bounded MSC communication. Information and Computation\u00a0(189), 135\u2013263 (2004)","DOI":"10.1016\/j.ic.2003.10.002"},{"key":"4_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1007\/978-3-540-24730-2_26","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"S. Leue","year":"2004","unstructured":"Leue, S., Mayr, R., Wei, W.: A scalable incomplete test for the boundedness of UML RT models. In: Jensen, K., Podelski, A. (eds.) TACAS 2004. LNCS, vol.\u00a02988, pp. 327\u2013341. Springer, Heidelberg (2004)"},{"key":"4_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":"4_CR21","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":"4_CR22","doi-asserted-by":"crossref","unstructured":"Mazurkiewicz, A.: Concurrent program schemes and their interpretation. Technical report, DAIMI Report PB-78, Aarhus University (1977)","DOI":"10.7146\/dpb.v6i78.7691"},{"key":"4_CR23","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":"4_CR24","first-page":"56","volume":"27","author":"E. Ochma\u0144ski","year":"1985","unstructured":"Ochma\u0144ski, E.: Regular behaviour of concurrent systems. Bulletin of the EATCS\u00a027, 56\u201367 (1985)","journal-title":"Bulletin of the EATCS"},{"key":"4_CR25","doi-asserted-by":"crossref","unstructured":"Peled, D.: Specification and verification of Message Sequence Charts. FORTE\/PSTV 2000, 139\u2013154 (2000)","DOI":"10.1007\/978-0-387-35533-7_9"},{"issue":"5","key":"4_CR26","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1016\/S0020-0190(01)00337-4","volume":"83","author":"P. Schnoebelen","year":"2002","unstructured":"Schnoebelen, Ph.: Verifying lossy channel systems has nonprimitive recursive complexity. Information Processing Letter\u00a083(5), 251\u2013261 (2002)","journal-title":"Information Processing Letter"},{"key":"4_CR27","unstructured":"USB 1.1 specification, http:\/\/www.usb.org\/developers\/docs\/usbspec.zip"},{"key":"4_CR28","unstructured":"Thomas, W.: On logical definability of trace languages. In: Diekert, V. (eds.) Proceedings of a workshop of the ESPRIT BRA No 3166: Algebraic and Syntactic Methods in Computer Science (ASMICS) 1989, Report TUM-I9002, Technical University of Munich, pp. 172\u2013182 (1990)"},{"key":"4_CR29","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1051\/ita\/1987210200991","volume":"21","author":"W. Zielonka","year":"1987","unstructured":"Zielonka, W.: Note on finite asynchronous automata, R.A.I.R.O. Informatique Thorique et Applications\u00a021, 99\u2013135 (1987)","journal-title":"Informatique Thorique et Applications"}],"container-title":["Lecture Notes in Computer Science","Developments in Language Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30550-7_4.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T04:21:18Z","timestamp":1605759678000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30550-7_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540240143","9783540305507"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30550-7_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}