{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:21:56Z","timestamp":1725488516074},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540671411"},{"type":"electronic","value":"9783540465416"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-46541-3_23","type":"book-chapter","created":{"date-parts":[[2007,8,2]],"date-time":"2007-08-02T16:03:24Z","timestamp":1186070604000},"page":"279-289","source":"Crossref","is-referenced-by-count":5,"title":["Real-Time Automata and the Kleene Algebra of Sets of Real Numbers"],"prefix":"10.1007","author":[{"given":"C\u0103t\u0103lin","family":"Dima","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2000,3,24]]},"reference":[{"key":"23_CR1","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/0304-3975(94)90010-8","volume":"126","author":"R. Alur","year":"1994","unstructured":"R. Alur and D.L. Dill. A theory of timed automata, Theoretical Computer Science, 126:183\u2013235, 1994.","journal-title":"Theoretical Computer Science"},{"key":"23_CR2","series-title":"Lect Notes Comput Sci","first-page":"1","volume-title":"Computer-Aided Verification","author":"R. Alur","year":"1994","unstructured":"R. Alur, L. Fix and T.A. Henzinger. A determinizable class of timed automata, in Computer-Aided Verification, LNCS 818:1\u201313, Springer Verlag, 1994."},{"key":"23_CR3","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1145\/227595.227602","volume":"43","author":"R. Alur","year":"1996","unstructured":"R. Alur and T. Henzinger. The benefits of relaxing punctuality, Journal of ACM, 43:116\u2013146, 1996.","journal-title":"Journal of ACM"},{"key":"23_CR4","doi-asserted-by":"crossref","unstructured":"E. Asarin, P. Caspi and O. Maler, A Kleene Theorem for Timed Automata, in G. Winskel (Ed.) Proc. LICS\u201997, p.160\u2013171, 1997.","DOI":"10.1109\/LICS.1997.614944"},{"key":"23_CR5","doi-asserted-by":"crossref","first-page":"145","DOI":"10.3233\/FI-1998-36233","volume":"36","author":"B. B\u00e9rard","year":"1998","unstructured":"B. B\u00e9rard, V. Diekert, P. Gastin and A. Petit. Characterization of the expressive power of silent transitions in timed automata, Fundamenta Informatic\u00e6, 36:145\u2013182, 1998.","journal-title":"Fundamenta Informatic\u00e6"},{"key":"23_CR6","series-title":"Lect Notes Comput Sci","volume-title":"Proceedings of ICALP\u201999","author":"P. Bouyer","year":"1999","unstructured":"P. Bouyer and A. Petit, Decomposition and composition of timed automata, Proceedings of ICALP\u201999, LNCS series, 1999."},{"key":"23_CR7","unstructured":"Ch. Choffrut and M. Goldwurm. Timed automata with periodic clock con-straints, LIAFA report, 1998."},{"key":"23_CR8","unstructured":"J. H. Conway. Regular Algebra and Finite Machines, Chapman and Hall, 1971."},{"key":"23_CR9","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"156","DOI":"10.1007\/3-540-62034-6_46","volume-title":"FSTTCS","author":"D. Hung Van","year":"1996","unstructured":"Dang Van Hung and Wang Ji, On the design of Hybrid Control Systems Using Automata Models, in V. Chandru and V. Vinay (Eds.) FSTTCS, LNCS 1180:156\u2013167, 1996."},{"key":"23_CR10","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1016\/0004-3702(91)90006-6","volume":"49","author":"R. Dechter","year":"1991","unstructured":"R. Dechter, I. Meiri and J. Pearl, Temporal constraint networks, Artificial Intelligence, 49:61\u201395, 1991.","journal-title":"Artificial Intelligence"},{"key":"23_CR11","unstructured":"C. Dima. Timed Regular Expressions, Real-Time Automata and Simple Duration Calculus, draft of a UNU\/IIST report, 1998. Available at http:\/\/funinf.math.unibuc.ro\/~cdima\/work\/report.ps.gz ."},{"key":"23_CR12","unstructured":"C. Dima. Automata and regular expressions for real-time languages, Proceedings of the AFL\u201999 workshop, Vasszeczeny, Hungary, 9\u201313 august 1999."},{"key":"23_CR13","unstructured":"S. Eilenberg. Automata, Languages, and Machines, Vol. A, Academic Press, 1974."},{"key":"23_CR14","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-64358-3","volume-title":"Proc. 25-th ICALP","author":"T.A. Henzinger","year":"1998","unstructured":"T.A. Henzinger, J.-F. Raskin and P.-Y. Schobbens. The regular real-time languages, in Proc. 25-th ICALP, LNCS series, Springer Verlag, 1998."},{"key":"23_CR15","unstructured":"John E. Hopcroft and Jeffrey D. Ullman, Introduction to Automata Theory, Languages and Computation, Addison-Wesley\/Narosa Publishing House, eighth edition, New Delhi, 1992."},{"key":"23_CR16","doi-asserted-by":"publisher","first-page":"366","DOI":"10.1006\/inco.1994.1037","volume":"110","author":"D. Kozen","year":"1994","unstructured":"D. Kozen. A completeness theorem for Kleene algebras and the algebra of regular events, Information and Computation, 110:366\u2013390, 1994.","journal-title":"Information and Computation"}],"container-title":["Lecture Notes in Computer Science","STACS 2000"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-46541-3_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,25]],"date-time":"2020-04-25T15:35:33Z","timestamp":1587828933000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-46541-3_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540671411","9783540465416"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/3-540-46541-3_23","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]}}}