{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T18:08:56Z","timestamp":1725559736515},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540275800"},{"type":"electronic","value":"9783540316916"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11523468_88","type":"book-chapter","created":{"date-parts":[[2010,7,18]],"date-time":"2010-07-18T14:58:59Z","timestamp":1279465139000},"page":"1089-1101","source":"Crossref","is-referenced-by-count":28,"title":["Decidability and Complexity Results for Timed Automata via Channel Machines"],"prefix":"10.1007","author":[{"given":"Parosh Aziz","family":"Abdulla","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Johann","family":"Deneux","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jo\u00ebl","family":"Ouaknine","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"James","family":"Worrell","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"88_CR1","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1006\/inco.1996.0083","volume":"130","author":"P. Abdulla","year":"1996","unstructured":"Abdulla, P., Jonsson, B.: Undecidable Verification Problems with Unreliable Channels. Information and Computation\u00a0130, 71\u201390 (1996)","journal-title":"Information and Computation"},{"issue":"1","key":"88_CR2","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1016\/S0304-3975(01)00330-9","volume":"290","author":"P. Abdulla","year":"2003","unstructured":"Abdulla, P., Jonsson, B.: Model checking of systems with many identical timed processes. Theoretical Computer Science\u00a0290(1), 241\u2013264 (2003)","journal-title":"Theoretical Computer Science"},{"key":"88_CR3","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.: A Theory of Timed Automata. Theoretical Computer Science\u00a0126, 183\u2013235 (1994)","journal-title":"Theoretical Computer Science"},{"key":"88_CR4","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1145\/227595.227602","volume":"43","author":"R. Alur","year":"1996","unstructured":"Alur, R., Feder, T., Henzinger, T.A.: The Benefits of Relaxing Punctually. Journal of the ACM\u00a043, 116\u2013146 (1996)","journal-title":"Journal of the ACM"},{"issue":"1-2","key":"88_CR5","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1016\/S0304-3975(97)00173-4","volume":"211","author":"R. Alur","year":"1999","unstructured":"Alur, R., Fix, L., Henzinger, T.A.: Event-clock automata: a determinizable class of timed automata. Theoretical Computer Science\u00a0211(1-2), 253\u2013273 (1999)","journal-title":"Theoretical Computer Science"},{"key":"88_CR6","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1006\/inco.1993.1025","volume":"104","author":"R. Alur","year":"1993","unstructured":"Alur, R., Henzinger, T.A.: Real-time Logics: Complexity and Expressiveness. Information and Computation\u00a0104, 35\u201377 (1993)","journal-title":"Information and Computation"},{"key":"88_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1007\/978-3-540-31954-2_5","volume-title":"Hybrid Systems: Computation and Control","author":"R. Alur","year":"2005","unstructured":"Alur, R., La Torre, S., Madhusudan, P.: Perturbed timed automata. In: Morari, M., Thiele, L. (eds.) HSCC 2005. LNCS, vol.\u00a03414, pp. 70\u201385. Springer, Heidelberg (2005)"},{"key":"88_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-30080-9_1","volume-title":"Formal Methods for the Design of Real-Time Systems","author":"R. Alur","year":"2004","unstructured":"Alur, R., Madhusudan, P.: Decision problems for timed automata: A survey. In: Bernardo, M., Corradini, F. (eds.) SFM-RT 2004. LNCS, vol.\u00a03185, pp. 1\u201324. Springer, Heidelberg (2004)"},{"issue":"2-3","key":"88_CR9","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1016\/j.tcs.2004.04.003","volume":"321","author":"P. Bouyer","year":"2004","unstructured":"Bouyer, P., Dufourd, C., Fleury, E., Petit, A.: Updatable timed automata. Theoretical Computer Science\u00a0321(2-3), 291\u2013345 (2004)","journal-title":"Theoretical Computer Science"},{"key":"88_CR10","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., Purushothaman Iyer, S.: Unreliable Channels are Easier to Verify Than Perfect Channels. Information and Computation\u00a0124, 20\u201331 (1996)","journal-title":"Information and Computation"},{"issue":"1-2","key":"88_CR11","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, P.: Well-Structured Transition Systems Everywhere! Theoretical Computer Science\u00a0256(1-2), 63\u201392 (2001)","journal-title":"Theoretical Computer Science"},{"key":"88_CR12","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1006\/jcss.1998.1581","volume":"57","author":"T.A. Henzinger","year":"1998","unstructured":"Henzinger, T.A., Kopke, P.W., Puri, A., Varaiya, P.: What\u2019s Decidable About Hybrid Automata? Journal of Computer and System Sciences\u00a057, 94\u2013124 (1998)","journal-title":"Journal of Computer and System Sciences"},{"key":"88_CR13","series-title":"Lecture Notes in Computer Science","volume-title":"Proc. ICALP 1992","author":"T.A. Henzinger","year":"1992","unstructured":"Henzinger, T.A., Manna, Z., Pnueli, A.: What Good Are Digital Clocks? In: Proc. ICALP 1992. LNCS, vol.\u00a0623. Springer, Heidelberg (1992)"},{"key":"88_CR14","volume-title":"Introduction to Automata Theory, Languages, and Computation","author":"J. Hopcroft","year":"1979","unstructured":"Hopcroft, J., Ullman, J.: Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, Reading (1979)"},{"key":"88_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1007\/978-3-540-28644-8_25","volume-title":"CONCUR 2004 - Concurrency Theory","author":"F. Laroussinie","year":"2004","unstructured":"Laroussinie, F., Markey, N., Schnoebelen, P.: Model checking timed automata with one or two clocks. In: Gardner, P., Yoshida, N. (eds.) CONCUR 2004. LNCS, vol.\u00a03170, pp. 387\u2013401. Springer, Heidelberg (2004)"},{"key":"88_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"250","DOI":"10.1007\/978-3-540-31982-5_16","volume-title":"Foundations of Software Science and Computational Structures","author":"S. Lasota","year":"2005","unstructured":"Lasota, S., Walukiewicz, I.: Alternating timed automata. In: Sassone, V. (ed.) FOSSACS 2005. LNCS, vol.\u00a03441, pp. 250\u2013265. Springer, Heidelberg (2005)"},{"key":"88_CR17","unstructured":"Lasota, S., Walukiewicz, I.: Personal communication (2005)"},{"issue":"297","key":"88_CR18","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1016\/S0304-3975(02)00646-1","volume":"1-3","author":"R. Mayr","year":"2003","unstructured":"Mayr, R.: Undecidable problems in unreliable computations. Theoretical Computer Science\u00a01-3(297), 337\u2013354 (2003)","journal-title":"Theoretical Computer Science"},{"key":"88_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1007\/3-540-36580-X_28","volume-title":"Hybrid Systems: Computation and Control","author":"J. Ouaknine","year":"2003","unstructured":"Ouaknine, J., Worrell, J.: Universality and language inclusion for open and closed timed automata. In: Maler, O., Pnueli, A. (eds.) HSCC 2003. LNCS, vol.\u00a02623, pp. 375\u2013388. Springer, Heidelberg (2003)"},{"key":"88_CR20","volume-title":"Proc. LICS 2004","author":"J. Ouaknine","year":"2004","unstructured":"Ouaknine, J., Worrell, J.: On the Language Inclusion Problem for Timed Automata: Closing a Decidability Gap. In: Proc. LICS 2004. IEEE, Los Alamitos (2004)"},{"key":"88_CR21","volume-title":"Proc. LICS 2005","author":"J. Ouaknine","year":"2005","unstructured":"Ouaknine, J., Worrell, J.: On the Decidability of Metric Temporal Logic. In: Proc. LICS 2005. IEEE, Los Alamitos (2005)"},{"issue":"5","key":"88_CR22","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1016\/S0020-0190(01)00337-4","volume":"83","author":"P. Schnoebelen","year":"2002","unstructured":"Schnoebelen, P.: Verifying Lossy Channel Systems has Nonprimitive Recursive Complexity. Information Processing Letters\u00a083(5), 251\u2013261 (2002)","journal-title":"Information Processing Letters"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11523468_88.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T02:47:10Z","timestamp":1619491630000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11523468_88"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540275800","9783540316916"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/11523468_88","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}