{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,27]],"date-time":"2025-05-27T09:30:18Z","timestamp":1748338218181},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540424970"},{"type":"electronic","value":"9783540446859"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-44685-0_17","type":"book-chapter","created":{"date-parts":[[2007,8,10]],"date-time":"2007-08-10T10:16:21Z","timestamp":1186740981000},"page":"248-261","source":"Crossref","is-referenced-by-count":13,"title":["An Algebraic Characterization of Data and Timed Languages"],"prefix":"10.1007","author":[{"given":"Patricia","family":"Bouyer","sequence":"first","affiliation":[]},{"given":"Antoine","family":"Petit","sequence":"additional","affiliation":[]},{"given":"Denis","family":"Th\u00e9rien","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,8,22]]},"reference":[{"key":"17_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0166-218X(80)90050-5","volume":"2","author":"J.-M. Autebert","year":"1980","unstructured":"Autebert, J.-M., Beauquier, J., and Boasson, L.Langages sur des alphabets infinis. Discrete Applied Mathematics, vol. 2:1\u201320, 1980.","journal-title":"Discrete Applied Mathematics"},{"key":"17_CR2","doi-asserted-by":"crossref","unstructured":"Asarin, E., Caspi, P., and Maler, O., A Kleene Theorem for Timed Automata. In Proc. 12th IEEE Symp. Logic in Computer Science (LICS\u201997), pp. 160\u2013171. IEEE Computer Society Press, June 1997.","DOI":"10.1109\/LICS.1997.614944"},{"issue":"2","key":"17_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. and Dill, D.A Theory of Timed Automata. Theoretical Computer Science, vol. 126(2):183\u2013235, 1994.","journal-title":"Theoretical Computer Science"},{"key":"17_CR4","series-title":"Lect Notes Comput Sci","first-page":"1","volume-title":"Proc. 6th Int. Conf. Computer Aided Verification (CAV\u201994)","author":"R. Alur","year":"1994","unstructured":"Alur, R., Fix, L., and Henzinger, T. A.Event-Clock Automata:Determinizable Class of Timed Automata. In Proc. 6th Int. Conf. Computer Aided Verification (CAV\u201994), vol. 818 of Lecture Notes in Computer Science, pp. 1\u201313. Springer-Verlag, June 1994."},{"key":"17_CR5","series-title":"Lect Notes Comput Sci","volume-title":"Hybrid Systems: Computation and Control","author":"E. Asarin","year":"1998","unstructured":"Asarin, E.Equations on Timed Languages. In Hybrid Systems: Computation and Control, vol. 1386 of Lecture Notes in Computer Science. Springer-Verlag, Apr. 1998."},{"key":"17_CR6","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1007\/3-540-48523-6_18","volume-title":"Proc. 26th Int. Coll. Automata, Languages, and Programming (ICALP\u201999)","author":"P. Bouyer","year":"1999","unstructured":"Bouyer, P. and Petit, A.Decomposition and Composition of Timed Automata. In Proc. 26th Int. Coll. Automata, Languages, and Programming (ICALP\u201999), vol. 1644 of Lecture Notes in Computer Science, pp. 210\u2013219. Springer-Verlag, July 1999."},{"key":"17_CR7","unstructured":"Bouyer, P. and Petit, A.A Kleene\/B\u00fcchi-like Theorem for Clock Languages. Journal of Automata, Languages and Combinatorics, 2001. To appear."},{"key":"17_CR8","doi-asserted-by":"crossref","unstructured":"Bouyer, P., Petit, A., and Th\u00e9rien, D.An Algebraic Characterization of Data and Timed Languages. Research report LSV-01-1, Laboratoire Sp\u00e9cification et V\u00e9rification, Ecole Normale Sup\u00e9rieure de Cachan, 2001.","DOI":"10.1007\/3-540-44685-0_17"},{"issue":"4","key":"17_CR9","first-page":"371","volume":"5","author":"C. Choffrut","year":"2000","unstructured":"Choffrut, C. and Goldwurm, M.Timed Automata with Periodic Clock Constraints. Journal of Automata, Languages and Combinatorics, vol. 5(4):371\u2013404, 2000.","journal-title":"Journal of Automata, Languages and Combinatorics"},{"key":"17_CR10","volume-title":"Model Checking","author":"E. Clarke","year":"1999","unstructured":"Clarke, E., Grumberg, O., and Peled, D.Model Checking. The MIT Press, Cambridge, Massachusetts, 1999."},{"key":"17_CR11","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1007\/BFb0055641","volume-title":"Proc. 9th Int. Conf. Concurrency Theory (CONCUR\u201998)","author":"F. Demichelis","year":"1998","unstructured":"Demichelis, F. and Zielonka, W.Controlled Timed Automata. In Proc. 9th Int. Conf. Concurrency Theory (CONCUR\u201998), vol. 1466 of Lecture Notes in Computer Science, pp. 455\u2013469. Springer-Verlag, Sep. 1998."},{"key":"17_CR12","series-title":"Lect Notes Comput Sci","first-page":"335","volume-title":"Proc. 22nd Int. Coll. Automata, Languages, and Programming (ICALP\u201995)","author":"P. W. Henzinger","year":"1995","unstructured":"Henzinger, P. W., and Wong-Toi, H.The Expressive Power of Clocks. In Proc. 22nd Int. Coll. Automata, Languages, and Programming (ICALP\u201995), vol. 944 of Lecture Notes in Computer Science, pp. 335\u2013346. Springer-Verlag, July 1995."},{"key":"17_CR13","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"580","DOI":"10.1007\/BFb0055086","volume-title":"Proc. 25th Int. Coll. Automata, Languages, and Programming (ICALP\u201998)","author":"T. A. Henzinger","year":"1998","unstructured":"Henzinger, T. A., Raskin, J.-F., and Schobbens, P.-Y.The Regular Real-Time Languages. In Proc. 25th Int. Coll. Automata, Languages, and Programming (ICALP\u201998), vol. 1443 of Lecture Notes in Computer Science, pp. 580\u2013591. Springer-Verlag, July 1998."},{"key":"17_CR14","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1016\/0304-3975(94)90242-9","volume":"134","author":"M. Kaminski","year":"1994","unstructured":"Kaminski, M. and Francez, N.Finite-Memory Automata. Theoretical Computer Science, vol. 134:329\u2013363, 1994.","journal-title":"Theoretical Computer Science"},{"key":"17_CR15","unstructured":"Minsky, M.Computation: Finite and Infinite Machines. Prentice Hall Int., 1967."},{"key":"17_CR16","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4613-2215-3","volume-title":"Varieties of Formal Languages","author":"J.-E. Pin","year":"1986","unstructured":"Pin, J.-E.Varieties of Formal Languages. North Oxford, London et Plenum, New-York, 1986."},{"key":"17_CR17","doi-asserted-by":"crossref","unstructured":"Rozenberg, G. and Salomaa, A., eds. Handbook of Formal Languages. Springer-Verlag, 1997.","DOI":"10.1007\/978-3-642-59126-6"},{"key":"17_CR18","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"694","DOI":"10.1007\/3-540-58468-4_191","volume-title":"Proc. 3rd Int. Symp. Formal Techniques in Real-Time and Fault-Tolerant Systems (FTRTFT\u201994)","author":"T. Wilke","year":"1994","unstructured":"Wilke, T.Specifying Timed State Sequences in Powerful Decidable Logics and Timed Automata. In Proc. 3rd Int. Symp. Formal Techniques in Real-Time and Fault-Tolerant Systems (FTRTFT\u201994), vol. 863 of Lecture Notes in Computer Science, pp. 694\u2013715. Springer-Verlag, Sep. 1994."}],"container-title":["Lecture Notes in Computer Science","CONCUR 2001 \u2014 Concurrency Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44685-0_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T22:11:50Z","timestamp":1556748710000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44685-0_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540424970","9783540446859"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/3-540-44685-0_17","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}