{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T14:20:21Z","timestamp":1775053221792,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540309468","type":"print"},{"value":"9783540316169","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11603009_18","type":"book-chapter","created":{"date-parts":[[2005,11,28]],"date-time":"2005-11-28T11:13:33Z","timestamp":1133176413000},"page":"226-241","source":"Crossref","is-referenced-by-count":39,"title":["Quantifying Similarities Between Timed Systems"],"prefix":"10.1007","author":[{"given":"Thomas A.","family":"Henzinger","sequence":"first","affiliation":[]},{"given":"Rupak","family":"Majumdar","sequence":"additional","affiliation":[]},{"given":"Vinayak S.","family":"Prabhu","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"18_CR1","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. Inf. and Comp.\u00a0104, 2\u201334 (1993)","journal-title":"Inf. and Comp."},{"key":"18_CR2","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. Theor. Comput. Sci.\u00a0126, 183\u2013235 (1994)","journal-title":"Theor. Comput. Sci."},{"key":"18_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1007\/978-3-540-31954-2_5","volume-title":"Hybrid Systems: Computation and Control","author":"R. Alur","year":"2005","unstructured":"Alur, R., La Torre, S., Madhusudan, P.: Perturbed timed automata. In: Morari, M., Thiele, L. (eds.) HSCC 2005. LNCS, vol.\u00a03414, pp. 70\u201385. Springer, Heidelberg (2005)"},{"key":"18_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/978-3-540-24743-2_14","volume-title":"Hybrid Systems: Computation and Control","author":"P. Bouyer","year":"2004","unstructured":"Bouyer, P., Brinksma, E., Larsen, K.G.: Staying alive as cheaply as possible. In: Alur, R., Pappas, G.J. (eds.) HSCC 2004. LNCS, vol.\u00a02993, pp. 203\u2013218. Springer, Heidelberg (2004)"},{"key":"18_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"294","DOI":"10.1007\/3-540-45828-X_22","volume-title":"Embedded Software","author":"P. Caspi","year":"2002","unstructured":"Caspi, P., Benveniste, A.: Toward an approximation theory for computerised control. In: Sangiovanni-Vincentelli, A.L., Sifakis, J. (eds.) EMSOFT 2002. LNCS, vol.\u00a02491, pp. 294\u2013304. Springer, Heidelberg (2002)"},{"key":"18_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"302","DOI":"10.1007\/3-540-56496-9_24","volume-title":"Computer Aided Verification","author":"K. Cerans","year":"1993","unstructured":"Cerans, K.: Decidability of bisimulation equivalences for parallel timer processes. In: Probst, D.K., von Bochmann, G. (eds.) CAV 1992. LNCS, vol.\u00a0663, pp. 302\u2013315. Springer, Heidelberg (1993)"},{"key":"18_CR7","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1145\/5397.5399","volume":"8","author":"E.M. Clarke","year":"1986","unstructured":"Clarke, E.M., Emerson, E.A., Sistla, A.P.: Automatic verification of finite-state concurrent systems using temporal logic specifications. ACM Trans. Program. Lang. Syst.\u00a08, 244\u2013263 (1986)","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"18_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"242","DOI":"10.1007\/3-540-48320-9_18","volume-title":"CONCUR\u201999. Concurrency Theory","author":"H. Comon","year":"1999","unstructured":"Comon, H., Jurski, Y.: Timed automata and the theory of real numbers. In: Baeten, J.C.M., Mauw, S. (eds.) CONCUR 1999. LNCS, vol.\u00a01664, pp. 242\u2013257. Springer, Heidelberg (1999)"},{"key":"18_CR9","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, 385\u2013415 (1992)","journal-title":"Formal Methods in System Design"},{"key":"18_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/978-3-540-24730-2_6","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"L. Alfaro de","year":"2004","unstructured":"de Alfaro, L., Faella, M., Henzinger, T.A., Majumdar, R., Stoelinga, M.: Model checking discounted temporal properties. In: Jensen, K., Podelski, A. (eds.) TACAS 2004. LNCS, vol.\u00a02988, pp. 77\u201392. Springer, Heidelberg (2004)"},{"key":"18_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/978-3-540-27836-8_11","volume-title":"Automata, Languages and Programming","author":"L. Alfaro de","year":"2004","unstructured":"de Alfaro, L., Faella, M., Stoelinga, M.: Linear and branching metrics for quantitative transition systems. In: D\u00edaz, J., Karhum\u00e4ki, J., Lepist\u00f6, A., Sannella, D. (eds.) ICALP 2004. LNCS, vol.\u00a03142, pp. 97\u2013109. Springer, Heidelberg (2004)"},{"key":"18_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1022","DOI":"10.1007\/3-540-45061-0_79","volume-title":"Automata, Languages and Programming","author":"L. Alfaro de","year":"2003","unstructured":"de Alfaro, L., Henzinger, T.A., Majumdar, R.: Discounting the future in systems theory. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol.\u00a02719, pp. 1022\u20131037. Springer, Heidelberg (2003)"},{"key":"18_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1007\/978-3-540-30206-3_10","volume-title":"Formal Techniques, Modelling and Analysis of Timed and Fault-Tolerant Systems","author":"M. Wulf De","year":"2004","unstructured":"De Wulf, M., Doyen, L., Markey, N., Raskin, J.-F.: Robustness and implementability of timed automata. In: Lakhnech, Y., Yovine, S. (eds.) FORMATS 2004 and FTRTFT 2004. LNCS, vol.\u00a03253, pp. 118\u2013133. Springer, Heidelberg (2004)"},{"key":"18_CR14","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1016\/j.tcs.2003.09.013","volume":"318","author":"J. Desharnais","year":"2004","unstructured":"Desharnais, J., Gupta, V., Jagadeesan, R., Panangaden, P.: Metrics for labeled Markov processes. Theor. Comput. Sci.\u00a0318, 323\u2013354 (2004)","journal-title":"Theor. Comput. Sci."},{"key":"18_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1007\/3-540-48168-0_10","volume-title":"Computer Science Logic","author":"M. Fr\u00e4nzle","year":"1999","unstructured":"Fr\u00e4nzle, M.: Analysis of hybrid systems: An ounce of realism can save an infinity of states. In: Flum, J., Rodr\u00edguez-Artalejo, M. (eds.) CSL 1999. LNCS, vol.\u00a01683, pp. 126\u2013140. Springer, Heidelberg (1999)"},{"key":"18_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1007\/BFb0014736","volume-title":"Hybrid and Real-Time Systems","author":"V. Gupta","year":"1997","unstructured":"Gupta, V., Henzinger, T.A., Jagadeesan, R.: Robust timed automata. In: Maler, O. (ed.) HART 1997. LNCS, vol.\u00a01201, pp. 331\u2013345. Springer, Heidelberg (1997)"},{"key":"18_CR17","first-page":"304","volume-title":"QEST 2004","author":"V. Gupta","year":"2004","unstructured":"Gupta, V., Jagadeesan, R., Panangaden, P.: Approximate reasoning for real-time probabilistic processes. In: QEST 2004, pp. 304\u2013313. IEEE, Los Alamitos (2004)"},{"key":"18_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/3-540-46430-1_15","volume-title":"Hybrid Systems: Computation and Control","author":"T.A. Henzinger","year":"2000","unstructured":"Henzinger, T.A., Raskin, J.-F.: Robust undecidability of timed and hybrid systems. In: Lynch, N.A., Krogh, B.H. (eds.) HSCC 2000. LNCS, vol.\u00a01790, pp. 145\u2013159. Springer, Heidelberg (2000)"},{"key":"18_CR19","first-page":"163","volume-title":"MEMOCODE 2003","author":"J. Huang","year":"2003","unstructured":"Huang, J., Voeten, J., Geilen, M.: Real-time property preservation in approximations of timed systems. In: MEMOCODE 2003, pp. 163\u2013171. IEEE, Los Alamitos (2003)"},{"key":"18_CR20","volume-title":"RTCSA 2004","author":"J. Huang","year":"2004","unstructured":"Huang, J., Voeten, J., Geilen, M.: Real-time property preservation in concurrent real-time systems. In: RTCSA 2004. Springer, Heidelberg (2004)"},{"key":"18_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1007\/BFb0055349","volume-title":"Formal Techniques in Real-Time and Fault-Tolerant Systems","author":"A. Puri","year":"1998","unstructured":"Puri, A.: Dynamical properties of timed automata. In: Ravn, A.P., Rischel, H. (eds.) FTRTFT 1998. LNCS, vol.\u00a01486, pp. 210\u2013227. Springer, Heidelberg (1998)"},{"key":"18_CR22","unstructured":"Tasiran, S.: Compositional and Hierarchical Techniques for the Formal Verification of Real-Time Systems. Dissertation, UC Berkeley (1998)"},{"key":"18_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"296","DOI":"10.1007\/978-3-540-24743-2_20","volume-title":"Hybrid Systems: Computation and Control","author":"M. Wulf De","year":"2004","unstructured":"De Wulf, M., Doyen, L., Raskin, J.-F.: Almost ASAP semantics: From timed models to timed implementations. In: Alur, R., Pappas, G.J. (eds.) HSCC 2004. LNCS, vol.\u00a02993, pp. 296\u2013310. Springer, Heidelberg (2004)"}],"container-title":["Lecture Notes in Computer Science","Formal Modeling and Analysis of Timed Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11603009_18.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:03:23Z","timestamp":1619507003000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11603009_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540309468","9783540316169"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/11603009_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005]]}}}