{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,9]],"date-time":"2026-05-09T03:27:59Z","timestamp":1778297279345,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540677703","type":"print"},{"value":"9783540450474","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/10722167_35","type":"book-chapter","created":{"date-parts":[[2006,12,30]],"date-time":"2006-12-30T03:00:33Z","timestamp":1167447633000},"page":"464-479","source":"Crossref","is-referenced-by-count":32,"title":["Are Timed Automata Updatable?"],"prefix":"10.1007","author":[{"given":"Patricia","family":"Bouyer","sequence":"first","affiliation":[]},{"given":"Catherine","family":"Dufourd","sequence":"additional","affiliation":[]},{"given":"Emmanuel","family":"Fleury","sequence":"additional","affiliation":[]},{"given":"Antoine","family":"Petit","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"35_CR1","doi-asserted-by":"crossref","unstructured":"Alur, R., Courcoubetis, C., Dill, D.L., Halbwachs, N., Wong-Toi, H.: Minimization of timed transition systems. In: Cleaveland, W.R. (ed.) CONCUR 1992. LNCS, vol.\u00a0630. Springer, Heidelberg (1992)","DOI":"10.1007\/BFb0084802"},{"key":"35_CR2","doi-asserted-by":"crossref","unstructured":"Alur, R., Courcoubetis, C., Henzinger, T.A.: The observational power of clocks. In: Jonsson, B., Parrow, J. (eds.) CONCUR 1994. LNCS, vol.\u00a0836, pp. 162\u2013177. Springer, Heidelberg (1994)","DOI":"10.1007\/978-3-540-48654-1_16"},{"key":"35_CR3","doi-asserted-by":"crossref","unstructured":"Alur, R., Dill, D.L.: Automata for modeling real-time systems. In: Paterson, M. (ed.) ICALP 1990. LNCS, vol.\u00a0443, pp. 322\u2013335. Springer, Heidelberg (1990)","DOI":"10.1007\/BFb0032042"},{"key":"35_CR4","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1016\/0304-3975(94)90010-8","volume":"126","author":"R. Alur","year":"1994","unstructured":"Alur, R., Dill, D.L.: A theory of timed automata. Theorical Computer Science\u00a0126, 183\u2013235 (1994)","journal-title":"Theorical Computer Science"},{"key":"35_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BFb0028774","volume-title":"Computer Aided Verification","author":"R. Alur","year":"1998","unstructured":"Alur, R., Fix, L., Henzinger, T.A.: A determinizable class of timed automata. In: Y. Vardi, M. (ed.) CAV 1998. LNCS, vol.\u00a01427, pp. 1\u201313. Springer, Heidelberg (1998)"},{"key":"35_CR6","doi-asserted-by":"crossref","unstructured":"Alur, R., Henzinger, T.A., Vardi, M.: Parametric real-time reasoning. In: Proc. of ACM Symposium on Theory of Computing, pp. 592\u2013601 (1993)","DOI":"10.1145\/167088.167242"},{"key":"35_CR7","doi-asserted-by":"crossref","unstructured":"B\u00e9rard, B., Dufourd, C.: Timed automata and additive clock constraints. To appear in IPL 2000 (2000)","DOI":"10.1016\/S0020-0190(00)00075-2"},{"key":"35_CR8","doi-asserted-by":"crossref","unstructured":"Bouyer, P., Dufourd, C., Fleury, E., Petit, A.: Are timed automata updatable? Research Report LSV-00-3, LSV, ENS de Cachan (2000)","DOI":"10.1007\/10722167_35"},{"key":"35_CR9","doi-asserted-by":"crossref","unstructured":"Bouyer, P., Dufourd, C., Fleury, E., Petit, A.: Expressiveness of updatable timed automata. Research report, LSV, ENS de Cachan (2000) (submitted to MFCS 2000)","DOI":"10.1007\/3-540-44612-5_19"},{"key":"35_CR10","doi-asserted-by":"crossref","unstructured":"B\u00e9rard, B., Diekert, V., Gastin, P., Petit, A.: Characterization of the expressive power of silent transitions in timed automata. Fundamenta Informaticae, 145\u2013182 (1998)","DOI":"10.3233\/FI-1998-36233"},{"key":"35_CR11","doi-asserted-by":"crossref","unstructured":"B\u00e9rard, B., Fribourg, L.: Automatic verification of a parametric realtime program: the ABR conformance protocol. In: Halbwachs, N., Peled, D.A. (eds.) CAV 1999. LNCS, vol.\u00a01633. Springer, Heidelberg (1999)","DOI":"10.1007\/3-540-48683-6_11"},{"key":"35_CR12","unstructured":"B\u00e9rard, B., Fribourg, L., Klay, F., Monin, J.F.: A compared study of two correctness proofs for the standardized algorithm of ABR conformance. Research Report LSV-99-7, LSV, ENS de Cachan (1999)"},{"key":"35_CR13","doi-asserted-by":"crossref","unstructured":"Domenjoud, E.: Solving systems of linear diophantine equations: an algebraicapproach. In: Tarlecki, A. (ed.) MFCS 1991. LNCS, vol.\u00a0520, pp. 141\u2013150. Springer, Heidelberg (1991)","DOI":"10.1007\/3-540-54345-7_57"},{"key":"35_CR14","unstructured":"Henzinger, T.A., Ho, P., Wong-Toi, H.: In: Brinksma, E., Steffen, B., Cleaveland, W.R., Larsen, K.G., Margaria, T. (eds.) TACAS 1995. LNCS, vol.\u00a01019, pp. 41\u201371. Springer, Heidelberg (1995)"},{"key":"35_CR15","doi-asserted-by":"crossref","unstructured":"Henzinger, T.A., Ho, P., Wong-Toi, H.: Hytech: A model checker for hybrid systems. In Software Tools for Technology Transfer, 110\u2013122 (1997)","DOI":"10.1007\/3-540-63166-6_48"},{"key":"35_CR16","doi-asserted-by":"crossref","unstructured":"Henzinger, T.A., Kopke, P.W., Wong-Ti, H.: The expressive power of clocks. In: F\u00fcl\u00f6p, Z., Gecseg, F. (eds.) ICALP 1995. LNCS, vol.\u00a0944, pp. 335\u2013346. Springer, Heidelberg (1995)","DOI":"10.1007\/3-540-60084-1_93"},{"key":"35_CR17","unstructured":"Hopcroft, J.E., Ullman, J.D.: Introduction to automata theory, languages and computation. Addison Wesley, Reading (1979)"},{"key":"35_CR18","doi-asserted-by":"crossref","unstructured":"Larsen, K.G., Pettersson, P., Yi, W.: Upaal in a Nutshell. Int. Journal on Software Tools for Technology Transfer\u00a01, 134\u2013152 (1997)","DOI":"10.1007\/s100090050010"},{"key":"35_CR19","unstructured":"Minsky, M.: Computation: finite and infinite machines. Prentice Hall Int., Englewood Cliffs (1967)"},{"key":"35_CR20","doi-asserted-by":"crossref","unstructured":"Wilke, T.: Specifying timed state sequences in powerful decidable logics and timed automata. In: Langmaack, H., de Roever, W.-P., Vytopil, J. (eds.) FTRTFT 1994 and ProCoS 1994. LNCS, vol.\u00a0863. Springer, Heidelberg (1994)","DOI":"10.1007\/3-540-58468-4_191"},{"key":"35_CR21","doi-asserted-by":"crossref","unstructured":"Yovine, S.: A verification tool for real-time systems. Springer International Journal of Software Tools for Technology Transfer\u00a01 (October 1997)","DOI":"10.1007\/s100090050009"}],"container-title":["Lecture Notes in Computer Science","Computer Aided Verification"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/10722167_35","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,19]],"date-time":"2020-04-19T15:22:33Z","timestamp":1587309753000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/10722167_35"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540677703","9783540450474"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/10722167_35","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2000]]}}}