{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T22:17:36Z","timestamp":1725574656224},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540251088"},{"type":"electronic","value":"9783540319542"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/978-3-540-31954-2_5","type":"book-chapter","created":{"date-parts":[[2011,1,14]],"date-time":"2011-01-14T02:45:07Z","timestamp":1294973107000},"page":"70-85","source":"Crossref","is-referenced-by-count":34,"title":["Perturbed Timed Automata"],"prefix":"10.1007","author":[{"given":"Rajeev","family":"Alur","sequence":"first","affiliation":[]},{"given":"Salvatore","family":"La Torre","sequence":"additional","affiliation":[]},{"given":"P.","family":"Madhusudan","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"5_CR1","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.: A theory of timed automata. Theoretical Computer Science\u00a0126, 183\u2013235 (1994)","journal-title":"Theoretical Computer Science"},{"key":"5_CR2","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":"5_CR3","doi-asserted-by":"crossref","unstructured":"Larsen, K., Pettersson, P., Yi, W.: Uppaal in a nutshell. Springer International Journal of Software Tools for Technology Transfer\u00a01 (1997)","DOI":"10.1007\/s100090050010"},{"key":"5_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1007\/BFb0020947","volume-title":"Hybrid Systems III","author":"C. Daws","year":"1996","unstructured":"Daws, C., Olivero, A., Tripakis, S., Yovine, S.: The tool kronos. In: Alur, R., Sontag, E.D., Henzinger, T.A. (eds.) HS 1995. LNCS, vol.\u00a01066, pp. 208\u2013219. Springer, Heidelberg (1996)"},{"key":"5_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/3-540-46419-0_12","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"F. Wang","year":"2000","unstructured":"Wang, F.: Efficient data structures for fully symbolic verification of real-time software systems. In: Schwartzbach, M.I., Graf, S. (eds.) TACAS 2000. LNCS, vol.\u00a01785, pp. 157\u2013171. Springer, Heidelberg (2000)"},{"key":"5_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"545","DOI":"10.1007\/3-540-55719-9_103","volume-title":"Automata, Languages and Programming","author":"T. Henzinger","year":"1992","unstructured":"Henzinger, T., Manna, Z., Pnueli, A.: What good are digital clocks? In: Kuich, W. (ed.) ICALP 1992. LNCS, vol.\u00a0623, pp. 545\u2013558. Springer, Heidelberg (1992)"},{"key":"5_CR7","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1016\/S0304-3975(97)00173-4","volume":"211","author":"R. Alur","year":"1999","unstructured":"Alur, R., Fix, L., Henzinger, T.: Event-clock automata: a determinizable class of timed automata. Theoretical Computer Science\u00a0211, 253\u2013273 (1999); A preliminary version appears In: Dill, D.L. (ed.) CAV 1994. LNCS, vol.\u00a0818, pp. 253\u2013273. Springer, Heidelberg (1994)","journal-title":"Theoretical Computer Science"},{"key":"5_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1007\/BFb0015008","volume-title":"CONCUR \u201994: Concurrency Theory","author":"R. Alur","year":"1994","unstructured":"Alur, R., Courcoubetis, C., Henzinger, T.: The observational power of clocks. In: Jonsson, B., Parrow, J. (eds.) CONCUR 1994. LNCS, vol.\u00a0836, pp. 162\u2013177. Springer, Heidelberg (1994)"},{"key":"5_CR9","doi-asserted-by":"crossref","unstructured":"Alur, R., Henzinger, T.: Back to the future: Towards a theory of timed regular languages. In: Proceedings of the 33rd IEEE Symposium on Foundations of Computer Science, pp. 177\u2013186 (1992)","DOI":"10.1109\/SFCS.1992.267774"},{"key":"5_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"580","DOI":"10.1007\/BFb0055086","volume-title":"Automata, Languages and Programming","author":"T. Henzinger","year":"1998","unstructured":"Henzinger, T., Raskin, J., Schobbens, P.: The regular real-time languages. In: Larsen, K.G., Skyum, S., Winskel, G. (eds.) ICALP 1998. LNCS, vol.\u00a01443, pp. 580\u2013593. Springer, Heidelberg (1998)"},{"key":"5_CR11","doi-asserted-by":"crossref","unstructured":"Ouaknine, J., Worrell, J.: Revisiting digitization, robustness, and decidability for timed automata. In: Proc. of the 18th IEEE Symp. on Logic in Comp. Sc. (2003)","DOI":"10.1109\/LICS.2003.1210059"},{"key":"5_CR12","doi-asserted-by":"crossref","unstructured":"Ouaknine, J., Worrell, J.: On the language inclusion problem for timed automata: Closing a decidability gap. In: Proceedings of the 19th IEEE Symposium on Logic in Computer Science (2004)","DOI":"10.1109\/LICS.2004.1319600"},{"key":"5_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1007\/BFb0014736","volume-title":"Hybrid and Real-Time Systems","author":"V. Gupta","year":"1997","unstructured":"Gupta, V., Henzinger, T., Jagadeesan, R.: Robust timed automata. In: Maler, O. (ed.) HART 1997. LNCS, vol.\u00a01201, pp. 48\u201362. Springer, Heidelberg (1997)"},{"key":"5_CR14","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. Henzinger","year":"2000","unstructured":"Henzinger, T., Raskin, J.: 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":"5_CR15","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1006\/jcss.1998.1581","volume":"57","author":"T. Henzinger","year":"1998","unstructured":"Henzinger, T., Kopke, P., Puri, A., Varaiya, P.: What\u2019s decidable about hybrid automata. Journal of Computer and System Sciences\u00a057, 94\u2013124 (1998)","journal-title":"Journal of Computer and System Sciences"},{"key":"5_CR16","first-page":"199","volume":"43","author":"J. Brzozowski","year":"1991","unstructured":"Brzozowski, J., Seger, C.: Advances in asynchronous circuit theory, Part II: Bounded inertial delay models, MOS circuit design techniques. Bulletin of the European Assoc. for Theoretical Comp. Sc.\u00a043, 199\u2013263 (1991)","journal-title":"Bulletin of the European Assoc. for Theoretical Comp. Sc."},{"key":"5_CR17","unstructured":"Rokicki, T.: Representing and modeling digital circuits. PhD thesis, Stanford University (1993)"},{"key":"5_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1007\/3-540-60385-9_12","volume-title":"Correct Hardware Design and Verification Methods","author":"O. Maler","year":"1995","unstructured":"Maler, O., Pnueli, A.: Timing analysis of asynchronous circuits using timed automata. In: Camurati, P.E., Eveking, H. (eds.) CHARME 1995. LNCS, vol.\u00a0987, pp. 189\u2013205. Springer, Heidelberg (1995)"},{"key":"5_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1007\/3-540-63166-6_20","volume-title":"Computer Aided Verification","author":"S. Tasiran","year":"1997","unstructured":"Tasiran, S., Brayton, R.: STARI: a case study in compositional and hierarchical timing verification. In: Grumberg, O. (ed.) CAV 1997. LNCS, vol.\u00a01254, pp. 191\u2013201. Springer, Heidelberg (1997)"},{"key":"5_CR20","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":"5_CR21","series-title":"Lecture Notes in Computer Science","volume-title":"Formal Techniques, Modelling and Analysis of Timed and Fault-Tolerant Systems","author":"M. De Wulf","year":"2004","unstructured":"De Wulf, M., Doyen, L., Markey, N., Raskin, J.: Robustness and implementability of timed automata. In: Lakhnech, Y., Yovine, S. (eds.) FORMATS 2004 and FTRTFT 2004. LNCS, vol.\u00a03253. Springer, Heidelberg (2004)"},{"key":"5_CR22","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1145\/227595.227602","volume":"43","author":"R. Alur","year":"1996","unstructured":"Alur, R., Feder, T., Henzinger, T.: The benefits of relaxing punctuality. Journal of the ACM\u00a043, 116\u2013146 (1996)","journal-title":"Journal of the ACM"},{"key":"5_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-24743-2_1","volume-title":"Hybrid Systems: Computation and Control","author":"M. Agrawal","year":"2004","unstructured":"Agrawal, M., Thiagarajan, P.S.: Lazy rectangular hybrid automata. In: Alur, R., Pappas, G.J. (eds.) HSCC 2004. LNCS, vol.\u00a02993, pp. 1\u201315. Springer, Heidelberg (2004)"},{"key":"5_CR24","unstructured":"Ouaknine, J.: Personal communication (2004)"},{"key":"5_CR25","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, 281\u2013320 (2004)","journal-title":"Formal Methods in System Design"}],"container-title":["Lecture Notes in Computer Science","Hybrid Systems: Computation and Control"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-31954-2_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,7]],"date-time":"2019-06-07T17:06:40Z","timestamp":1559927200000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-31954-2_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540251088","9783540319542"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-31954-2_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}