{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T23:19:28Z","timestamp":1743031168446,"version":"3.40.3"},"publisher-location":"London","reference-count":24,"publisher":"Springer London","isbn-type":[{"type":"print","value":"9781447142751"},{"type":"electronic","value":"9781447142768"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-1-4471-4276-8_9","type":"book-chapter","created":{"date-parts":[[2012,7,26]],"date-time":"2012-07-26T18:19:09Z","timestamp":1343326749000},"page":"169-187","source":"Crossref","is-referenced-by-count":6,"title":["An Introduction to Timed Automata"],"prefix":"10.1007","author":[{"given":"B\u00e9atrice","family":"B\u00e9rard","sequence":"first","affiliation":[]}],"member":"297","reference":[{"issue":"1-3","key":"9_CR1","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1016\/S0304-3975(02)00334-1","volume":"300","author":"L. Aceto","year":"2003","unstructured":"Aceto, L., Bouyer, P., Burgue\u00f1o, A., Larsen, K.G.: The power of reachability testing for timed automata. Theoretical Computer Science\u00a0300(1-3), 411\u2013475 (2003)","journal-title":"Theoretical Computer Science"},{"key":"9_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/978-3-540-75454-1_4","volume-title":"Formal Modeling and Analysis of Timed Systems","author":"S. Adams","year":"2007","unstructured":"Adams, S., Ouaknine, J., Worrell, J.B.: Undecidability of Universality for Timed Automata with Minimal Resources. In: Raskin, J.-F., Thiagarajan, P.S. (eds.) FORMATS 2007. LNCS, vol.\u00a04763, pp. 25\u201337. Springer, Heidelberg (2007)"},{"key":"9_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"322","DOI":"10.1007\/BFb0032042","volume-title":"Automata, Languages and Programming","author":"R. Alur","year":"1990","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)"},{"issue":"1","key":"9_CR4","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1006\/inco.1993.1024","volume":"104","author":"R. Alur","year":"1993","unstructured":"Alur, R., Courcoubetis, C., Dill, D.L.: Model-checking in dense real-time. Information and Computation\u00a0104(1), 2\u201334 (1993)","journal-title":"Information and Computation"},{"key":"9_CR5","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.L.: A theory of timed automata. Theoretical Computer Science\u00a0126, 183\u2013235 (1994)","journal-title":"Theoretical Computer Science"},{"key":"9_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-58179-0_39","volume-title":"Computer Aided Verification","author":"R. Alur","year":"1994","unstructured":"Alur, R., Fix, L., Henzinger, T.A.: A Determinizable Class of Timed Automata. In: Dill, D.L. (ed.) CAV 1994. LNCS, vol.\u00a0818, pp. 1\u201313. Springer, Heidelberg (1994)"},{"key":"9_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-30080-9_1","volume-title":"Formal Methods for the Design of Real-Time Systems","author":"R. Alur","year":"2004","unstructured":"Alur, R., Madhusudan, P.: Decision Problems for Timed Automata: A Survey. In: Bernardo, M., Corradini, F. (eds.) SFM-RT 2004. LNCS, vol.\u00a03185, pp. 1\u201324. Springer, Heidelberg (2004)"},{"key":"9_CR8","first-page":"106","volume":"83","author":"E. Asarin","year":"2004","unstructured":"Asarin, E.: Challenges in timed languages from applied theory to basic theory. Bulletin of the European Association for Theoretical Computer Science\u00a083, 106\u2013120 (2004)","journal-title":"Bulletin of the European Association for Theoretical Computer Science"},{"key":"9_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1007\/978-3-642-02930-1_4","volume-title":"Automata, Languages and Programming","author":"C. Baier","year":"2009","unstructured":"Baier, C., Bertrand, N., Bouyer, P., Brihaye, T.: When Are Timed Automata Determinizable? In: Albers, S., Marchetti-Spaccamela, A., Matias, Y., Nikoletseas, S., Thomas, W. (eds.) ICALP 2009. Part II. LNCS, vol.\u00a05556, pp. 43\u201354. Springer, Heidelberg (2009)"},{"key":"9_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1007\/978-3-540-30080-9_7","volume-title":"Formal Methods for the Design of Real-Time Systems","author":"G. Behrmann","year":"2004","unstructured":"Behrmann, G., David, A., Larsen, K.G.: A Tutorial on Uppaal. In: Bernardo, M., Corradini, F. (eds.) SFM-RT 2004. LNCS, vol.\u00a03185, pp. 200\u2013236. Springer, Heidelberg (2004)"},{"key":"9_CR11","doi-asserted-by":"crossref","first-page":"145","DOI":"10.3233\/FI-1998-36233","volume":"36","author":"B. B\u00e9rard","year":"1998","unstructured":"B\u00e9rard, B., Diekert, V., Gastin, P., Petit, A.: Characterization of the expressive power of silent transitions in timed automata. Fundamenta Informaticae\u00a036, 145\u2013182 (1998)","journal-title":"Fundamenta Informaticae"},{"issue":"3","key":"9_CR12","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1023\/B:FORM.0000026093.21513.31","volume":"24","author":"P. Bouyer","year":"2004","unstructured":"Bouyer, P.: Forward analysis of updatable timed automata. Formal Methods in System Design\u00a024(3), 281\u2013320 (2004)","journal-title":"Formal Methods in System Design"},{"issue":"1-2","key":"9_CR13","doi-asserted-by":"crossref","first-page":"1","DOI":"10.3233\/FI-2009-0063","volume":"92","author":"P. Bouyer","year":"2009","unstructured":"Bouyer, P., Haddad, S., Reynier, P.-A.: Undecidability results for timed automata with silent transitions. Fundamenta Informaticae\u00a092(1-2), 1\u201325 (2009)","journal-title":"Fundamenta Informaticae"},{"issue":"4","key":"9_CR14","first-page":"393","volume":"10","author":"P. Bouyer","year":"2005","unstructured":"Bouyer, P., Chevalier, F.: On conciseness of extensions of timed automata. Journal of Automata, Languages and Combinatorics\u00a010(4), 393\u2013405 (2005)","journal-title":"Journal of Automata, Languages and Combinatorics"},{"issue":"4","key":"9_CR15","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1007\/BF00709157","volume":"1","author":"C. Courcoubetis","year":"1992","unstructured":"Courcoubetis, C., Yannakakis, M.: Minimum and maximum delay problems in real-time systems. Formal Methods in System Design\u00a01(4), 385\u2013415 (1992)","journal-title":"Formal Methods in System Design"},{"key":"9_CR16","unstructured":"Finkel, O.: Undecidable problems about timed automata. CoRR, abs\/0712.1363 (2007)"},{"issue":"2","key":"9_CR17","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1006\/inco.1994.1045","volume":"111","author":"T. Henzinger","year":"1994","unstructured":"Henzinger, T., Nicollin, X., Sifakis, J., Yovine, S.: Symbolic model checking for real-time systems. Information and Computation\u00a0111(2), 193\u2013244 (1994)","journal-title":"Information and Computation"},{"key":"9_CR18","doi-asserted-by":"crossref","unstructured":"Laroussinie, F., Larsen, K.G.: CMC: a tool for compositional model-checking of real-time systems. In: Proc. IFIP Joint Int. Conf. Formal Description Techniques and Protocol Specification, Testing and Verification, Paris, France (1998)","DOI":"10.1007\/978-0-387-35394-4_27"},{"issue":"3","key":"9_CR19","first-page":"169","volume":"386","author":"S. Lasota","year":"2007","unstructured":"Lasota, S., Walukiewicz, I.: Alternating timed automata. ACM Transactions on Computational Logic\u00a0386(3), 169\u2013187 (2007)","journal-title":"ACM Transactions on Computational Logic"},{"key":"9_CR20","doi-asserted-by":"crossref","unstructured":"Ouaknine, J., Worrell, J.: On the language inclusion problem for timed automata: Closing a decidability gap. In: Proceedings of LICS, pp. 54\u201363. IEEE Computer Society Press (2004)","DOI":"10.21236\/ADA461167"},{"key":"9_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1007\/3-540-60922-9_29","volume-title":"STACS 96","author":"J. Sifakis","year":"1996","unstructured":"Sifakis, J., Yovine, S.: Compositional Specifications of Timed Systems. In: Puech, C., Reischuk, R. (eds.) STACS 1996. LNCS, vol.\u00a01046, pp. 347\u2013359. Springer, Heidelberg (1996)"},{"key":"9_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1007\/978-3-540-85778-5_7","volume-title":"Formal Modeling and Analysis of Timed Systems","author":"P.V. Suman","year":"2008","unstructured":"Suman, P.V., Pandya, P.K., Krishna, S.N., Manasa, L.: Timed Automata with Integer Resets: Language Inclusion and Expressiveness. In: Cassez, F., Jard, C. (eds.) FORMATS 2008. LNCS, vol.\u00a05215, pp. 78\u201392. Springer, Heidelberg (2008)"},{"key":"9_CR23","doi-asserted-by":"crossref","unstructured":"Tripakis, S.: Folk theorems on the determinization and minimization of timed automata. In: Proc. FORMATS 2003. LNCS, vol.\u00a02791, pp. 182\u2013188. Springer (2004)","DOI":"10.1007\/978-3-540-40903-8_15"},{"issue":"1-2","key":"9_CR24","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/s100090050009","volume":"1","author":"S. Yovine","year":"1997","unstructured":"Yovine, S.: Kronos: A verification tool for real-time systems. International Journal of Software Tools for Technology Transfer\u00a01(1-2), 123\u2013133 (1997)","journal-title":"International Journal of Software Tools for Technology Transfer"}],"container-title":["Lecture Notes in Control and Information Sciences","Control of Discrete-Event Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-1-4471-4276-8_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,19]],"date-time":"2023-01-19T04:46:15Z","timestamp":1674103575000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-1-4471-4276-8_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9781447142751","9781447142768"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-1-4471-4276-8_9","relation":{},"ISSN":["0170-8643","1610-7411"],"issn-type":[{"type":"print","value":"0170-8643"},{"type":"electronic","value":"1610-7411"}],"subject":[],"published":{"date-parts":[[2013]]}}}