{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,5]],"date-time":"2026-02-05T10:53:18Z","timestamp":1770288798633,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540374060","type":"print"},{"value":"9783540374114","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11817963_24","type":"book-chapter","created":{"date-parts":[[2006,8,5]],"date-time":"2006-08-05T05:07:51Z","timestamp":1154754471000},"page":"249-262","source":"Crossref","is-referenced-by-count":26,"title":["Communicating Timed Automata: The More Synchronous, the More Difficult to Verify"],"prefix":"10.1007","author":[{"given":"Pavel","family":"Krcal","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wang","family":"Yi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"2","key":"24_CR1","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/0304-3975(94)90010-8","volume":"126","author":"R. Alur","year":"1994","unstructured":"Alur, R., Dill, D.L.: A theory of timed automata. Theoretical Computer Science\u00a0126(2), 183\u2013235 (1994)","journal-title":"Theoretical Computer Science"},{"issue":"1","key":"24_CR2","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1006\/inco.1996.0083","volume":"130","author":"P.A. Abdulla","year":"1996","unstructured":"Abdulla, P.A., Jonsson, B.: Undecidable verification problems for programs with unreliable channels. Information and Computation\u00a0130(1), 71\u201390 (1996)","journal-title":"Information and Computation"},{"issue":"2","key":"24_CR3","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1006\/inco.1996.0053","volume":"127","author":"P.A. Abdulla","year":"1996","unstructured":"Abdulla, P.A., Jonsson, B.: Verifying programs with unreliable channels. Information and Computation\u00a0127(2), 91\u2013101 (1996)","journal-title":"Information and Computation"},{"key":"24_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"485","DOI":"10.1007\/BFb0055643","volume-title":"CONCUR \u201998 Concurrency Theory","author":"J. Bengtsson","year":"1998","unstructured":"Bengtsson, J., Jonsson, B., Lilius, J., Yi, W.: Partial order reductions for timed systems. In: Sangiorgi, D., de Simone, R. (eds.) CONCUR 1998. LNCS, vol.\u00a01466, pp. 485\u2013500. Springer, Heidelberg (1998)"},{"issue":"2","key":"24_CR5","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. J. ACM\u00a030(2), 323\u2013342 (1983)","journal-title":"J. ACM"},{"issue":"2","key":"24_CR6","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1016\/j.ic.2005.05.006","volume":"202","author":"G. C\u00e9c\u00e9","year":"2005","unstructured":"C\u00e9c\u00e9, G., Finkel, A.: Verification of programs with half-duplex communication. Information and Computation\u00a0202(2), 166\u2013190 (2005)","journal-title":"Information and Computation"},{"issue":"1","key":"24_CR7","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1006\/inco.1996.0003","volume":"124","author":"G. C\u00e9c\u00e9","year":"1996","unstructured":"C\u00e9c\u00e9, G., Finkel, A., Iyer, S.P.: Unreliable channels are easier to verify than perfect channels. Information and Computation\u00a0124(1), 20\u201331 (1996)","journal-title":"Information and Computation"},{"issue":"1-2","key":"24_CR8","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1016\/S0304-3975(96)00026-6","volume":"174","author":"A. Finkel","year":"1997","unstructured":"Finkel, A., McKenzie, P.: Verifying identical communicating processes is undecidable. Theoretical Computer Science\u00a0174(1-2), 217\u2013230 (1997)","journal-title":"Theoretical Computer Science"},{"issue":"1","key":"24_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0890-5401(02)00027-5","volume":"181","author":"A. Finkel","year":"2003","unstructured":"Finkel, A., Iyer, S.P., Sutre, G.: Well-abstracted transition systems: Application to FIFO automata. Information and Computation\u00a0181(1), 1\u201331 (2003)","journal-title":"Information and Computation"},{"key":"24_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1007\/978-3-540-30550-7_4","volume-title":"Developments in Language Theory","author":"B. Genest","year":"2004","unstructured":"Genest, B., Muscholl, A., Kuske, D.: A Kleene theorem for a class of communicating automata with effective algorithms. In: Calude, C.S., Calude, E., Dinneen, M.J. (eds.) DLT 2004. LNCS, vol.\u00a03340, pp. 30\u201348. Springer, Heidelberg (2004)"},{"key":"24_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"310","DOI":"10.1007\/11590156_25","volume-title":"FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science","author":"P. Kr\u010d\u00e1l","year":"2005","unstructured":"Kr\u010d\u00e1l, P., Pel\u00e1nek, R.: On sampled semantics of timed systems. In: Ramanujam, R., Sen, S. (eds.) FSTTCS 2005. LNCS, vol.\u00a03821, pp. 310\u2013321. Springer, Heidelberg (2005)"},{"key":"24_CR12","unstructured":"Krcal, P., Yi, W.: Communicating timed automata. Technical Report 2006-008, Uppsala University (2006)"},{"key":"24_CR13","unstructured":"Pachl, J.K.: Reachability problems for communicating finite state machines. Technical Report CS-82-12, Department of Computer Science, University of Waterloo (1982)"},{"key":"24_CR14","unstructured":"Pachl, J.K.: Reachability problems for communicating finite state machines. ArXiv Computer Science e-prints, arXiv:cs\/0306121 (2003)"},{"issue":"6\/7","key":"24_CR15","first-page":"422","volume":"29","author":"W. Peng","year":"1992","unstructured":"Peng, W., Iyer, S.P.: Analysis of a class of communicating finite state machines. Acta Informatica\u00a029(6\/7), 422\u2013499 (1992)","journal-title":"Acta Informatica"}],"container-title":["Lecture Notes in Computer Science","Computer Aided Verification"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11817963_24.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:30:02Z","timestamp":1619508602000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11817963_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540374060","9783540374114"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/11817963_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006]]}}}