{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,5]],"date-time":"2026-03-05T22:52:27Z","timestamp":1772751147091,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":54,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540662020","type":"print"},{"value":"9783540486831","type":"electronic"}],"license":[{"start":{"date-parts":[[1999,1,1]],"date-time":"1999-01-01T00:00:00Z","timestamp":915148800000},"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":[[1999]]},"DOI":"10.1007\/3-540-48683-6_3","type":"book-chapter","created":{"date-parts":[[2007,10,7]],"date-time":"2007-10-07T03:22:18Z","timestamp":1191727338000},"page":"8-22","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":217,"title":["Timed Automata"],"prefix":"10.1007","author":[{"given":"Rajeev","family":"Alur","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2003,1,14]]},"reference":[{"key":"3_CR1","series-title":"Lect Notes Comput Sci","first-page":"1","volume-title":"Real-Time: Theory in Practice, REX Workshop","author":"M. Abadi","year":"1991","unstructured":"M. Abadi and L. Lamport. An old-fashioned recipe for real time. In Real-Time: Theory in Practice, REX Workshop, LNCS 600, pages 1\u201327. Springer-Verlag, 1991."},{"key":"3_CR2","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/3-540-54233-7_128","volume-title":"Automata, Languages and Programming: Proc. of 18th ICALP","author":"R. Alur","year":"1991","unstructured":"R. Alur, C. Courcoubetis, and D. Dill. Model-checking for probabilistic real-time systems. In Automata, Languages and Programming: Proc. of 18th ICALP, LNCS 510, pages 115\u2013136, 1991."},{"issue":"1","key":"3_CR3","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1006\/inco.1993.1024","volume":"104","author":"R. Alur","year":"1993","unstructured":"R. Alur, C. Courcoubetis, and D. Dill. Model-checking in dense real-time. Information and Computation, 104(1):2\u201334, 1993.","journal-title":"Information and Computation"},{"key":"3_CR4","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"340","DOI":"10.1007\/BFb0084802","volume-title":"CONCUR\u2019 92","author":"R. Alur","year":"1992","unstructured":"R. Alur, C. Courcoubetis, N. Halbwachs, D. Dill, and H. Wong-Toi. Minimization of timed transition systems. In CONCUR\u2019 92, LNCS 630, pages 340\u2013354, 1992."},{"key":"3_CR5","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/0304-3975(94)00202-T","volume":"138","author":"R. Alur","year":"1995","unstructured":"R. Alur, C. Courcoubetis, N. Halbwachs, T. Henzinger, P. Ho, X. Nicollin, A. Olivero, J. Sifakis, and S. Yovine. The algorithmic analysis of hybrid systems. Theoretical Computer Science, 138:3\u201334, 1995.","journal-title":"Theoretical Computer Science"},{"key":"3_CR6","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1007\/BFb0015008","volume-title":"CONCUR\u2019 94: Fifth Conference on Concurrency Theory","author":"R. Alur","year":"1994","unstructured":"R. Alur, C. Courcoubetis, and T. Henzinger. The observational power of clocks. In CONCUR\u2019 94: Fifth Conference on Concurrency Theory, LNCS 836, pages 162\u2013177, 1994."},{"key":"3_CR7","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/0304-3975(94)90010-8","volume":"126","author":"R. Alur","year":"1994","unstructured":"R. Alur and D. Dill. A theory of timed automata. Theoretical Computer Science, 126:183\u2013235, 1994.","journal-title":"Theoretical Computer Science"},{"issue":"1","key":"3_CR8","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1145\/227595.227602","volume":"43","author":"R. Alur","year":"1996","unstructured":"R. Alur, T. Feder, and T. Henzinger. The benefits of relaxing punctuality. Journal of the ACM, 43(1):116\u2013146, 1996.","journal-title":"Journal of the ACM"},{"key":"3_CR9","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1016\/S0304-3975(97)00173-4","volume":"211","author":"R. Alur","year":"1999","unstructured":"R. Alur, L. Fix, and T. Henzinger. Event-clock automata: a determinizable class of timed automata. Theoretical Computer Science, 211:253\u2013273, 1999.","journal-title":"Theoretical Computer Science"},{"issue":"1","key":"3_CR10","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1145\/174644.174651","volume":"41","author":"R. Alur","year":"1994","unstructured":"R. Alur and T. Henzinger. A really temporal logic. Journal of the ACM, 41(1):181\u2013204, 1994.","journal-title":"Journal of the ACM"},{"key":"3_CR11","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1007\/3-540-63141-0_6","volume-title":"CONCUR\u2019 97: Eighth Conference on Concurrency Theory","author":"R. Alur","year":"1997","unstructured":"R. Alur and T. Henzinger. Modularity for timed and hybrid systems. In CONCUR\u2019 97: Eighth Conference on Concurrency Theory, LNCS 1243, pages 74\u201388, 1997."},{"issue":"3","key":"3_CR12","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1109\/32.489079","volume":"22","author":"R. Alur","year":"1996","unstructured":"R. Alur, T. Henzinger, and P.-H. Ho. Automatic symbolic verification of embedded systems. IEEE Transactions on Software Engineering, 22(3):181\u2013201, 1996.","journal-title":"IEEE Transactions on Software Engineering"},{"issue":"1","key":"3_CR13","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1006\/inco.1995.1059","volume":"118","author":"R. Alur","year":"1995","unstructured":"R. Alur, A. Itai, R. Kurshan, and M. Yannakakis. Timing verification by successive approximation. Information and Computation, 118(1):142\u2013157, 1995.","journal-title":"Information and Computation"},{"key":"3_CR14","doi-asserted-by":"crossref","unstructured":"R. Alur, L. Jagadeesan, J. Kott, and J. V. Olnhausen. Model-checking of real-time systems: a telecommunications application. In Proc. of Intl. Conf. on Software Engineering, 1997.","DOI":"10.1145\/253228.253434"},{"key":"3_CR15","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"220","DOI":"10.1007\/BFb0020948","volume-title":"Hybrid Systems III: Control and Verification","author":"R. Alur","year":"1996","unstructured":"R. Alur and R. Kurshan. Timing analysis in COSPAN. In Hybrid Systems III: Control and Verification, LNCS 1066, pages 220\u2013231. Springer-Verlag, 1996."},{"key":"3_CR16","unstructured":"R. Alur, R. Kurshan, and M. Viswanathan. Membership problems for timed and hybrid automata. In Proceedings of the 19th IEEE Real-Time Systems Symposium. 1998."},{"key":"3_CR17","doi-asserted-by":"crossref","unstructured":"E. Asarin, O. Maler, and P. Caspi. A Kleene theorem for timed automata. In Proceedings of the 12th IEEE Symposium on Logic in Computer Science, pages 160\u2013171, 1997.","DOI":"10.1109\/LICS.1997.614944"},{"key":"3_CR18","doi-asserted-by":"crossref","unstructured":"G. Behrmann, K. Larsen, J. Pearson, C. Weise, and W. Yi. Efficient timed reachability analysis using clock difference diagrams. In Computer Aided Verification, 1999.","DOI":"10.1007\/3-540-48683-6_30"},{"key":"3_CR19","series-title":"Lect Notes Comput Sci","volume-title":"Compositionality-the significant difference","author":"S. Bornot","year":"1998","unstructured":"S. Bornot, J. Sifakis, and S. Tripakis. Modeling urgency in timed systems. In Compositionality-the significant difference, LNCS. Springer-Verlag, 1998."},{"key":"3_CR20","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1007\/3-540-63166-6_19","volume-title":"Computer Aided Verification","author":"M. Bozga","year":"1997","unstructured":"M. Bozga, O. Maler, A. Pnueli, and S. Yovine. Some progress in the symbolic verification of timed automata. In Computer Aided Verification, LNCS 1254, pages 179\u2013190. 1997."},{"key":"3_CR21","doi-asserted-by":"crossref","unstructured":"S. Campos and E. Clarke. Real-time symbolic model checking for discrete time models. In Theories and experiences for real-time system development, AMAST series in computing, 1994.","DOI":"10.21236\/ADA282878"},{"key":"3_CR22","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1007\/BFb0025774","volume-title":"Proc. Workshop on Logic of Programs","author":"E. Clarke","year":"1981","unstructured":"E. Clarke and E. Emerson. Design and synthesis of synchronization skeletons using branching time temporal logic. In Proc. Workshop on Logic of Programs, LNCS 131, pages 52\u201371, 1981."},{"issue":"6","key":"3_CR23","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1109\/6.499951","volume":"33","author":"E. Clarke","year":"1996","unstructured":"E. Clarke and R. Kurshan. Computer-aided verification. IEEE Spectrum, 33(6):61\u201367, 1996.","journal-title":"IEEE Spectrum"},{"key":"3_CR24","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1007\/3-540-55179-4_37","volume-title":"Third Workshop on Computer-Aided Verification","author":"C. Courcoubetis","year":"1991","unstructured":"C. Courcoubetis and M. Yannakakis. Minimum and maximum delay problems in real-time systems. In Third Workshop on Computer-Aided Verification, LNCS 575, pages 399\u2013409, 1991."},{"key":"3_CR25","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1007\/BFb0020947","volume-title":"Hybrid Systems III: Verification and Control","author":"C. Daws","year":"1996","unstructured":"C. Daws, A. Olivero, S. Tripakis, and S. Yovine. The tool kronos. In Hybrid Systems III: Verification and Control, LNCS 1066, pages 208\u2013219. Springer-Verlag, 1996."},{"key":"3_CR26","unstructured":"L. de Alfaro. Formal verification of probabilistic systems. PhD thesis, Stanford University, 1997."},{"key":"3_CR27","series-title":"Lect Notes Comput Sci","first-page":"197","volume-title":"Automatic Verification Methods for Finite State Systems","author":"D. Dill","year":"1989","unstructured":"D. Dill. Timing assumptions and verification of finite-state concurrent systems. In Automatic Verification Methods for Finite State Systems, LNCS 407, pages 197\u2013212, 1989."},{"key":"3_CR28","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"136","DOI":"10.1007\/BFb0023727","volume-title":"Computer-Aided Verification, 2nd International Conference","author":"E. Emerson","year":"1990","unstructured":"E. Emerson, A. Mok, A. Sistla, and J. Srinivasan. Quantitative temporal reasoning. In Computer-Aided Verification, 2nd International Conference, LNCS 531, pages 136\u2013145, 1990."},{"key":"3_CR29","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"166","DOI":"10.1007\/3-540-58201-0_66","volume-title":"Proc. ICALP\u201994","author":"R. Gawlick","year":"1994","unstructured":"R. Gawlick, R. Segala, J. Sogaard-Andersen, and N. Lynch. Liveness in timed and untimed systems. In Proc. ICALP\u201994, LNCS 820, pages 166\u2013177, 1994."},{"key":"3_CR30","doi-asserted-by":"crossref","unstructured":"T. Henzinger. The theory of hybrid automata. In Proceedings of the 11th IEEE Symposium on Logic in Computer Science, pages 278\u2013293, 1996.","DOI":"10.1109\/LICS.1996.561342"},{"key":"3_CR31","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"439","DOI":"10.1007\/BFb0055640","volume-title":"CONCUR\u2019 98: Ninth International Conference on Concurrency Theory","author":"T. Henzinger","year":"1998","unstructured":"T. Henzinger. It\u2019s about time: Real-time logics reviewed. In CONCUR\u2019 98: Ninth International Conference on Concurrency Theory, LNCS 1466, pages 439\u2013454. 1998."},{"key":"3_CR32","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1007\/3-540-60630-0_3","volume-title":"TACAS 95: Tools and Algorithms for the Construction and Analysis of Systems","author":"T. Henzinger","year":"1995","unstructured":"T. Henzinger, P. Ho, and H. Wong-Toi. HyTech: the next generation. In TACAS 95: Tools and Algorithms for the Construction and Analysis of Systems, LNCS 1019, pages 41\u201371, 1995."},{"key":"3_CR33","doi-asserted-by":"crossref","unstructured":"T. Henzinger, P. Kopke, A. Puri, and P. Varaiya. What\u2019s decidable about hybrid automata. In Proceedings of the 27th ACM Symposium on Theory of Computing, pages 373\u2013382, 1995.","DOI":"10.1145\/225058.225162"},{"key":"3_CR34","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"545","DOI":"10.1007\/3-540-55719-9_103","volume-title":"ICALP 92: Automata, Languages, and Programming","author":"T. Henzinger","year":"1992","unstructured":"T. Henzinger, Z. Manna, and A. Pnueli. What good are digital clocks? In ICALP 92: Automata, Languages, and Programming, LNCS 623, pages 545\u2013558. Springer-Verlag, 1992."},{"issue":"2","key":"3_CR35","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1006\/inco.1994.1045","volume":"111","author":"T. Henzinger","year":"1994","unstructured":"T. Henzinger, X. Nicollin, J. Sifakis, and S. Yovine. Symbolic model-checking for real-time systems. Information and Computation, 111(2):193\u2013244, 1994.","journal-title":"Information and Computation"},{"key":"3_CR36","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"580","DOI":"10.1007\/BFb0055086","volume-title":"ICALP 98: Automata, Languages, and Programming","author":"T. Henzinger","year":"1997","unstructured":"T. Henzinger, J. Raskin, and P. Schobbens. The regular real-time languages. In ICALP 98: Automata, Languages, and Programming, LNCS 1443, pages 580\u2013593. 1997."},{"key":"3_CR37","doi-asserted-by":"crossref","unstructured":"I. Kang and I. Lee. State minimization for concurrent system analysis based on state space exploration. In Proceedings of the Conference On Computer Assurance, pages 123\u2013134, 1994.","DOI":"10.1109\/CMPASS.1994.318461"},{"key":"3_CR38","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1007\/BF01995674","volume":"2","author":"R. Koymans","year":"1990","unstructured":"R. Koymans. Specifying real-time properties with metric temporal logic. Journal of Real-Time Systems, 2:255\u2013299, 1990.","journal-title":"Journal of Real-Time Systems"},{"key":"3_CR39","doi-asserted-by":"crossref","unstructured":"R. Kurshan. Computer-aided Verification of Coordinating Processes: the automatatheoretic approach. Princeton University Press, 1994.","DOI":"10.1515\/9781400864041"},{"key":"3_CR40","doi-asserted-by":"crossref","unstructured":"K. Larsen, P. Pettersson, and W. Yi. Uppaal in a nutshell. Springer International Journal of Software Tools for Technology Transfer, 1, 1997.","DOI":"10.1007\/s100090050010"},{"issue":"2","key":"3_CR41","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1007\/s100090050006","volume":"1","author":"K. Larsen","year":"1997","unstructured":"K. Larsen, B. Steffen, and C. Weise. Continuous modeling of real-time and hybrid systems: from concepts to tools. Software Tools for Technology Transfer, 1(2):64\u201385, 1997.","journal-title":"Software Tools for Technology Transfer"},{"key":"3_CR42","doi-asserted-by":"crossref","unstructured":"K. Larsen and Y. Wang. Time abstracted bisimulation: Implicit specifications and decidability. In Proceedings of Mathematical Foundations of Programming Semantics, 1993.","DOI":"10.1007\/3-540-58027-1_8"},{"key":"3_CR43","unstructured":"N. Lynch. Distributed algorithms. Morgan Kaufmann, 1996."},{"key":"3_CR44","doi-asserted-by":"crossref","unstructured":"M. Merritt, F. Modugno, and M. Tuttle. Time constrained automata. In Proceedings of Workshop on Theories of Concurrency, 1991.","DOI":"10.1007\/3-540-54430-5_103"},{"key":"3_CR45","unstructured":"J. Ostroff. Temporal Logic of Real-time Systems. Research Studies Press, 1990."},{"key":"3_CR46","doi-asserted-by":"crossref","unstructured":"A. Pnueli. The temporal logic of programs. In Proceedings of the 18th IEEE Symposium on Foundations of Computer Science, pages 46\u201377, 1977.","DOI":"10.1109\/SFCS.1977.32"},{"key":"3_CR47","series-title":"Lect Notes Comput Sci","first-page":"195","volume-title":"Proceedings of the Fifth Symposium on Programming","author":"J. Queille","year":"1982","unstructured":"J. Queille and J. Sifakis. Specification and verification of concurrent programs in CESAR. In Proceedings of the Fifth Symposium on Programming, LNCS 137, pages 195\u2013220, 1982."},{"key":"3_CR48","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"546","DOI":"10.1007\/3-540-61604-7_75","volume-title":"CONCUR\u2019 96","author":"S. Tasiran","year":"1996","unstructured":"S. Tasiran, R. Alur, R. Kurshan, and R. Brayton. Verifying abstractions of timed systems. In CONCUR\u2019 96, LNCS 1119, pages 546\u2013562, 1996."},{"key":"3_CR49","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1007\/3-540-63166-6_20","volume-title":"CAV\u201997","author":"S. Tasiran","year":"1997","unstructured":"S. Tasiran and R. Brayton. STARI: a case study in compositional and hierarchical timing verification. In CAV\u201997, LNCS 1254, pages 191\u2013201, 1997."},{"key":"3_CR50","series-title":"Lect Notes Comput Sci","volume-title":"Proceedings of the Eighth Conference on Computer Aided Verification","author":"S. Tripakis","year":"1996","unstructured":"S. Tripakis and S. Yovine. Analysis of timed systems based on time-abstracting bisimulations. In Proceedings of the Eighth Conference on Computer Aided Verification, LNCS 1102, 1996."},{"key":"3_CR51","series-title":"Lect Notes Comput Sci","first-page":"302","volume-title":"CAV\u201992","author":"K. \u010cer\u0101ns","year":"1992","unstructured":"K. \u010cer\u0101ns. Decidability of bisimulation equivalence for parallel timer processes. In CAV\u201992, LNCS 663, pages 302\u2013315, 1992."},{"key":"3_CR52","unstructured":"M. Vardi and P. Wolper. An automata-theoretic approach to automatic program verification. In Proc. of the First IEEE Symp. on Logic in Computer Science, pages 332\u2013344, 1986."},{"key":"3_CR53","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"694","DOI":"10.1007\/3-540-58468-4_191","volume-title":"FTRTFT\u201994","author":"T. Wilke","year":"1994","unstructured":"T. Wilke. Specifying state sequences in powerful decidable logics and timed automata. In FTRTFT\u201994, LNCS 863, pages 694\u2013715. Springer-Verlag, 1994."},{"key":"3_CR54","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"210","DOI":"10.1007\/3-540-56922-7_18","volume-title":"CAV\u201993","author":"M. Yannakakis","year":"1993","unstructured":"M. Yannakakis and D. Lee. An efficient algorithm for minimizing real-time transition systems. In CAV\u201993, LNCS 697, pages 210\u2013224, 1993."}],"container-title":["Lecture Notes in Computer Science","Computer Aided Verification"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-48683-6_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,21]],"date-time":"2025-01-21T12:37:14Z","timestamp":1737463034000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-48683-6_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540662020","9783540486831"],"references-count":54,"URL":"https:\/\/doi.org\/10.1007\/3-540-48683-6_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1999]]},"assertion":[{"value":"14 January 2003","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}