{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,16]],"date-time":"2026-04-16T05:21:29Z","timestamp":1776316889734,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540631415","type":"print"},{"value":"9783540691884","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/3-540-63141-0_6","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T23:09:56Z","timestamp":1330297796000},"page":"74-88","source":"Crossref","is-referenced-by-count":65,"title":["Modularity for timed and hybrid systems"],"prefix":"10.1007","author":[{"given":"Rajeev","family":"Alur","sequence":"first","affiliation":[]},{"given":"Thomas A.","family":"Henzinger","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,7]]},"reference":[{"key":"6_CR1","doi-asserted-by":"crossref","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.A. Henzinger, P.-H. Ho, X. Nicollin, A. Olivero, J. Sifakis, S. Yovine. The algorithmic analysis of hybrid systems. Theoretical Computer Science, 138:3\u201334, 1995.","journal-title":"Theoretical Computer Science"},{"key":"6_CR2","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1016\/0304-3975(94)90010-8","volume":"126","author":"R. Alur","year":"1994","unstructured":"R. Alur, D.L. Dill. A theory of timed automata. Theoretical Computer Science, 126:183\u2013235, 1994.","journal-title":"Theoretical Computer Science"},{"key":"6_CR3","doi-asserted-by":"crossref","first-page":"226","DOI":"10.1007\/BF01872848","volume":"2","author":"K.R. Apt","year":"1988","unstructured":"K.R. Apt, N. Francez, S. Katz. Appraising fairness in languages for distributed programming. Distributed Computing, 2:226\u2013241, 1988.","journal-title":"Distributed Computing"},{"key":"6_CR4","doi-asserted-by":"crossref","unstructured":"R. Alur, T.A. Henzinger. Local liveness for compositional modeling of fair reactive systems. In Computer-aided Verification, Springer LNCS 939, pp. 166\u2013179, 1995.","DOI":"10.1007\/3-540-60045-0_49"},{"key":"6_CR5","doi-asserted-by":"crossref","unstructured":"R. Alur, T.A. Henzinger. Reactive modules. In Proc. IEEE Symp. Logic in Computer Science, pp. 207\u2013218, 1996.","DOI":"10.1109\/LICS.1996.561320"},{"key":"6_CR6","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1109\/32.489079","volume":"22","author":"R. Alur","year":"1996","unstructured":"R. Alur, T.A. Henzinger, P.-H. Ho. Automatic symbolic verification of embedded systems. IEEE Trans. Software Engineering, 22:181\u2013201, 1996.","journal-title":"IEEE Trans. Software Engineering"},{"key":"6_CR7","doi-asserted-by":"crossref","unstructured":"R. Alur, T.A. Henzinger, E.D. Sontag, eds. Hybrid Systems III: Verification and Control. Springer LNCS 1066, 1996.","DOI":"10.1007\/BFb0020931"},{"key":"6_CR8","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1145\/151646.151649","volume":"15","author":"M. Abadi","year":"1993","unstructured":"M. Abadi, L. Lamport. Composing specifications. ACM Trans. Programming Languages and Systems, 15:73\u2013132, 1993.","journal-title":"ACM Trans. Programming Languages and Systems"},{"key":"6_CR9","doi-asserted-by":"crossref","unstructured":"M. Abadi, L. Lamport. An old-fashioned recipe for real time. In Real Time: Theory in Practice, Springer LNCS 600, pp. 1\u201327, 1992.","DOI":"10.1007\/BFb0031985"},{"key":"6_CR10","doi-asserted-by":"crossref","unstructured":"E. Asarin, O. Maler, A. Pnueli. Symbolic controller synthesis for discrete and timed systems. In Hybrid Systems II, Springer LNCS 999, pp. 1\u201320, 1995.","DOI":"10.1007\/3-540-60472-3_1"},{"key":"6_CR11","doi-asserted-by":"crossref","unstructured":"P. Antsaklis, A. Nerode, W. Kohn, S. Sastry, eds. Hybrid Systems II. Springer LNCS 999, 1995.","DOI":"10.1007\/3-540-60472-3"},{"key":"6_CR12","doi-asserted-by":"crossref","unstructured":"J.W. de Bakker, K. Huizing, W.-P. de Roever, G. Rozenberg, eds. Real Time: Theory in Practice. Springer LNCS 600, 1992.","DOI":"10.1007\/BFb0031984"},{"key":"6_CR13","doi-asserted-by":"crossref","unstructured":"D.L.Dili. Trace Theory for Automatic Hierarchical Verification of Speed-independent Circuits. MIT Press, 1989.","DOI":"10.7551\/mitpress\/6874.001.0001"},{"key":"6_CR14","doi-asserted-by":"crossref","unstructured":"C. Daws, A. Olivero, S. Tripakis, S. Yovine. The tool Kronos. In Hybrid Systems III, Springer LNCS 1066, pp. 208\u2013219, 1996.","DOI":"10.1007\/BFb0020947"},{"key":"6_CR15","doi-asserted-by":"crossref","unstructured":"E.A. Emerson, C. Jutla. The complexity of tree automata and logics of programs. In Proc. IEEE Symp. Foundations of Computer Science, pp. 328\u2013337, 1988.","DOI":"10.1109\/SFCS.1988.21949"},{"key":"6_CR16","doi-asserted-by":"crossref","unstructured":"R.L. Grossman, A. Nerode, A.P. Ravn, H. Rischel, eds. Hybrid Systems. Springer LNCS 736, 1993.","DOI":"10.1007\/3-540-57318-6"},{"key":"6_CR17","doi-asserted-by":"crossref","unstructured":"R. Gawlick, R. Segala, J.F. Sogaard-Andersen, N.A. Lynch. Liveness in timed and untimed systems. In Automata, Languages, and Programming, Springer LNCS 820, pp. 166\u2013177, 1994.","DOI":"10.1007\/3-540-58201-0_66"},{"key":"6_CR18","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1016\/0020-0190(92)90005-G","volume":"43","author":"T.A. Henzinger","year":"1992","unstructured":"T.A. Henzinger. Sooner is safer than later. Information Processing Letters, 43:135\u2013141, 1992.","journal-title":"Information Processing Letters"},{"key":"6_CR19","doi-asserted-by":"crossref","unstructured":"T.A. Henzinger, P.-H. Ho, H. Wong-Toi. HyTech: the next generation. In Proc. IEEE Real-time Systems Symp., pp. 56\u201365,1995.","DOI":"10.1109\/REAL.1995.495196"},{"key":"6_CR20","doi-asserted-by":"crossref","unstructured":"T.A. Henzinger, P.W. Kopke. Discrete-time control for rectangular hybrid automata. In Automata, Languages, and Programming, Springer LNCS, 1997.","DOI":"10.1007\/3-540-63165-8_213"},{"key":"6_CR21","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1006\/inco.1994.1045","volume":"111","author":"T.A. Henzinger","year":"1994","unstructured":"T.A. Henzinger, X. Nicollin, J. Sifakis, S. Yovine. Symbolic model checking for real-time systems. Information and Computation, 111:193\u2013244, 1994.","journal-title":"Information and Computation"},{"key":"6_CR22","doi-asserted-by":"crossref","unstructured":"G. Hoffmann, H. Wong-Toi. The input-output control of real-time discrete-event systems. In Proc. IEEE Real-time Systems Symp., pp. 256\u2013265, 1992.","DOI":"10.1109\/REAL.1992.242655"},{"key":"6_CR23","doi-asserted-by":"crossref","unstructured":"N.A. Lynch, R. Segala, F. Vaandrager, H.B. Weinberg. Hybrid I\/O Automata. In Hybrid Systems III, Springer LNCS 1066, pp. 496\u2013510, 1996.","DOI":"10.1007\/BFb0020971"},{"key":"6_CR24","doi-asserted-by":"crossref","unstructured":"O. Maler, A. Pnueli, J. Sifakis. On the synthesis of discrete controllers for timed systems. In Theoretical Aspects of Computer Science, Springer LNCS 900, pp. 229\u2013242, 1995.","DOI":"10.1007\/3-540-59042-0_76"},{"key":"6_CR25","doi-asserted-by":"crossref","unstructured":"A. Pnueli. In transition from global to modular temporal reasoning about programs. In Logics and Models of Concurrent Systems, Springer LNCS, pp. 123\u2013144, 1984.","DOI":"10.1007\/978-3-642-82453-1_5"},{"key":"6_CR26","doi-asserted-by":"crossref","first-page":"206","DOI":"10.1137\/0325013","volume":"25","author":"P.J. Ramadge","year":"1987","unstructured":"P.J. Ramadge, W.M. Wonham. Supervisory control of a class of discrete-event processes. SIAM J. Control and Optimization, 25:206\u2013230, 1987.","journal-title":"SIAM J. Control and Optimization"},{"key":"6_CR27","doi-asserted-by":"crossref","unstructured":"S. Tasiran, R. Alur, R.P. Kurshan, R.K. Brayton. Verifying abstractions of timed systems. In Concurrency Theory, Springer LNCS 1119, pp. 546\u2013562, 1996.","DOI":"10.1007\/3-540-61604-7_75"}],"container-title":["Lecture Notes in Computer Science","CONCUR '97: Concurrency Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-63141-0_6.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:16:13Z","timestamp":1605647773000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-63141-0_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540631415","9783540691884"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/3-540-63141-0_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1997]]}}}