{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,9]],"date-time":"2026-05-09T03:28:00Z","timestamp":1778297280023,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540679011","type":"print"},{"value":"9783540446125","type":"electronic"}],"license":[{"start":{"date-parts":[[2000,1,1]],"date-time":"2000-01-01T00:00:00Z","timestamp":946684800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-44612-5_19","type":"book-chapter","created":{"date-parts":[[2007,5,5]],"date-time":"2007-05-05T13:28:20Z","timestamp":1178371700000},"page":"232-242","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":23,"title":["Expressiveness of Updatable Timed Automata"],"prefix":"10.1007","author":[{"given":"P.","family":"Bouyer","sequence":"first","affiliation":[]},{"given":"C.","family":"Dufourd","sequence":"additional","affiliation":[]},{"given":"E.","family":"Fleury","sequence":"additional","affiliation":[]},{"given":"A.","family":"Petit","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,6,1]]},"reference":[{"key":"19_CR1","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"162","DOI":"10.1007\/978-3-540-48654-1_16","volume-title":"Proc. of CONCUR\u201994","author":"R. Alur","year":"1994","unstructured":"R. Alur, C. Courcoubetis, and T.A. Henzinger. The observational power of clocks. In Proc. of CONCUR\u201994, LNCS 836, pages 162\u2013177, 1994."},{"key":"19_CR2","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"322","DOI":"10.1007\/BFb0032042","volume-title":"Proc. of ICALP\u201990","author":"R. Alur","year":"1990","unstructured":"R. Alur and D. Dill. Automata for modeling real-time systems. In Proc. of ICALP\u201990, LNCS 443, pages 322\u2013335, 1990."},{"key":"19_CR3","doi-asserted-by":"crossref","unstructured":"R. Alur and D. Dill. A theory of timed automata. TCS\u201994, pages 183\u2013235, 1994.","DOI":"10.1016\/0304-3975(94)90010-8"},{"key":"19_CR4","doi-asserted-by":"crossref","unstructured":"R. Alur, T.A. Henzinger, and M. Vardi. Parametric real-time reasoning. In Proc. of the 25th ACM STOC, pages 592\u2013601, 1993.","DOI":"10.1145\/167088.167242"},{"key":"19_CR5","series-title":"Lect Notes Comput Sci","volume-title":"Proc. of CAV\u20192000","author":"P. Bouyer","year":"2000","unstructured":"P. Bouyer, C. Dufourd, E. Fleury, and A. Petit. Are timed automata updatable? In Proc. of CAV\u20192000, LNCS, 2000. To appear."},{"key":"19_CR6","doi-asserted-by":"crossref","unstructured":"P. Bouyer, C. Dufourd, E. Fleury, and A. Petit. Expressiveness of updatable timed automata. Research report, ENS de Cachan, 2000.","DOI":"10.1007\/3-540-44612-5_19"},{"key":"19_CR7","doi-asserted-by":"crossref","unstructured":"B. B\u00e9rard, V. Diekert, P. Gastin, and A. Petit. Characterization of the expressive power of silent transitions in timed automata. Fundamenta Informaticae, pages 145\u2013182, 1998.","DOI":"10.3233\/FI-1998-36233"},{"key":"19_CR8","unstructured":"B. B\u00e9rard and C. Dufourd. Timed automata and additive clock constraints. Research report LSV-00-4, LSV, ENS de Cachan, 2000."},{"key":"19_CR9","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"96","DOI":"10.1007\/3-540-48683-6_11","volume-title":"Proc. of CAV\u201999","author":"B. B\u00e9rard","year":"1999","unstructured":"B. B\u00e9rard and L. Fribourg. Automatic verification of a parametric real-time program: the ABR conformance protocol. In Proc. of CAV\u201999, LNCS 1633, pages 96\u2013107, 1999."},{"key":"19_CR10","unstructured":"C. Choffrut and M. Goldwurm. Timed automata with periodic clock constraints. Technical Report 99\/28, LIAFA, Universit\u00e9 Paris VII, 1999."},{"key":"19_CR11","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"455","DOI":"10.1007\/BFb0055641","volume-title":"Proc. of CONCUR\u201998","author":"F. Demichelis","year":"1998","unstructured":"F. Demichelis and W. Zielonka. Controlled timed automata. In Proc. of CONCUR\u201998, LNCS 1466, pages 455\u2013469, 1998."},{"key":"19_CR12","doi-asserted-by":"crossref","unstructured":"T.A. Henzinger, P. Ho, and H. Wong-Toi. Hytech: A model checker for hybrid systems. In Software Tools for Technology Transfer, pages 110\u2013122, 1997. (special issue on Timed and Hybrid Systems).","DOI":"10.1007\/s100090050008"},{"key":"19_CR13","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1007\/s100090050010","volume":"1","author":"K.G. Larsen","year":"1997","unstructured":"K.G. Larsen, P. Pettersson, and W. Yi. Uppaal in a Nutshell. Int. Journal on Software Tools for Technology Transfer, 1:134\u2013152, 1997.","journal-title":"Int. Journal on Software Tools for Technology Transfer"},{"key":"19_CR14","unstructured":"R. Milner. Communication and Concurrency. Prentice Hall Int., 1989."},{"key":"19_CR15","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1007\/BFb0017309","volume-title":"CTCS\u201981","author":"D. M. Park","year":"1981","unstructured":"D. M. Park. Concurrency on automata and infinite sequences. In CTCS\u201981, LNCS 104, pages 167\u2013183, 1981."},{"key":"19_CR16","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"694","DOI":"10.1007\/3-540-58468-4_191","volume-title":"Proc. of FTRT-FTS","author":"T. Wilke","year":"1994","unstructured":"T. Wilke. Specifying timed state sequences in powerful decidable logics and timed automata. In Proc. of FTRT-FTS, LNCS 863, pages 694\u2013715, 1994."},{"key":"19_CR17","doi-asserted-by":"crossref","unstructured":"S. Yovine. A verification tool for real-time systems. Springer International Journal of Software Tools for Technology Transfer, 1, 1997.","DOI":"10.1007\/s100090050009"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2000"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44612-5_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,21]],"date-time":"2020-04-21T19:14:42Z","timestamp":1587496482000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44612-5_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540679011","9783540446125"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/3-540-44612-5_19","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2000]]},"assertion":[{"value":"1 June 2001","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}