{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:13:20Z","timestamp":1725491600659},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540752905"},{"type":"electronic","value":"9783540752929"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-75292-9_13","type":"book-chapter","created":{"date-parts":[[2007,9,11]],"date-time":"2007-09-11T06:43:07Z","timestamp":1189492987000},"page":"185-200","source":"Crossref","is-referenced-by-count":7,"title":["Distributed Time-Asynchronous Automata"],"prefix":"10.1007","author":[{"given":"C\u0103t\u0103lin","family":"Dima","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ruggero","family":"Lanotte","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"13_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1007\/3-540-46002-0_9","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"Y. Abdedda\u00efm","year":"2002","unstructured":"Abdedda\u00efm, Y., Maler, O.: Preemptive job-shop scheduling using stopwatch automata. In: Katoen, J.-P., Stevens, P. (eds.) ETAPS 2002 and TACAS 2002. LNCS, vol.\u00a02280, pp. 113\u2013126. Springer, Heidelberg (2002)"},{"key":"13_CR2","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":"13_CR3","unstructured":"Asarin, E.: Challenges in timed languages. Bulletin of EATCS\u00a01983 (2004)"},{"key":"13_CR4","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1145\/506147.506151","volume":"49","author":"E. Asarin","year":"2002","unstructured":"Asarin, E., Caspi, P., Maler, O.: Timed regular expressions. Journal of ACM\u00a049, 172\u2013206 (2002)","journal-title":"Journal of ACM"},{"issue":"2","key":"13_CR5","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1016\/S0890-5401(03)00038-5","volume":"182","author":"P. Bouyer","year":"2003","unstructured":"Bouyer, P., Petit, A., Th\u00e9rien, D.: An algebraic approach to data languages and timed languages. Inf. Comput.\u00a0182(2), 137\u2013162 (2003)","journal-title":"Inf. Comput."},{"key":"13_CR6","doi-asserted-by":"crossref","unstructured":"Dima, C.: Computing reachability relations in timed automata. In: Proceedings of LICS 2002, pp. 177\u2013186 (2002)","DOI":"10.1109\/LICS.2002.1029827"},{"key":"13_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/11539452_11","volume-title":"CONCUR 2005 \u2013 Concurrency Theory","author":"C. Dima","year":"2005","unstructured":"Dima, C.: Timed shuffle expressions. In: Abadi, M., de Alfaro, L. (eds.) CONCUR 2005. LNCS, vol.\u00a03653, pp. 95\u2013109. Springer, Heidelberg (2005)"},{"key":"13_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"580","DOI":"10.1007\/BFb0055086","volume-title":"Automata, Languages and Programming","author":"T. Henzinger","year":"1998","unstructured":"Henzinger, T., Raskin, J.-F., Schobbens, P.-Y.: The regular real-time languages. In: Larsen, K.G., Skyum, S., Winskel, G. (eds.) ICALP 1998. LNCS, vol.\u00a01443, pp. 580\u2013591. Springer, Heidelberg (1998)"},{"key":"13_CR9","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. J. Comput. Syst. Sci.\u00a057, 94\u2013124 (1998)","journal-title":"J. Comput. Syst. Sci."},{"key":"13_CR10","doi-asserted-by":"crossref","unstructured":"Krishnan, P.: Distributed timed automata. Electr. Notes Theor. Comput. Sci.\u00a028 (1999)","DOI":"10.1016\/S1571-0661(05)80627-9"},{"key":"13_CR11","first-page":"198","volume-title":"Proceedings of LICS 2003","author":"J. Ouaknine","year":"2003","unstructured":"Ouaknine, J., Worrell, J.: Revisiting digitization, robustness, and decidability for timed automata. In: Proceedings of LICS 2003, pp. 198\u2013207. IEEE Computer Society Press, Los Alamitos (2003)"},{"key":"13_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1007\/3-540-65193-4_20","volume-title":"Lectures on Embedded Systems","author":"S. Yovine","year":"1998","unstructured":"Yovine, S.: Model-checking timed automata. In: Rozenberg, G. (ed.) Lectures on Embedded Systems. LNCS, vol.\u00a01494, pp. 114\u2013152. Springer, Heidelberg (1998)"},{"issue":"2","key":"13_CR13","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1051\/ita\/1987210200991","volume":"21","author":"W. Zielonka","year":"1987","unstructured":"Zielonka, W.: Notes on finite asynchronous automata. Informatique Th\u00e9orique et Applications\u00a021(2), 99\u2013135 (1987)","journal-title":"Informatique Th\u00e9orique et Applications"}],"container-title":["Lecture Notes in Computer Science","Theoretical Aspects of Computing \u2013 ICTAC 2007"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-75292-9_13.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T06:58:55Z","timestamp":1619506735000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-75292-9_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540752905","9783540752929"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-75292-9_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}