{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,19]],"date-time":"2026-02-19T07:15:30Z","timestamp":1771485330508,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540418665","type":"print"},{"value":"9783540453512","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-45351-2_24","type":"book-chapter","created":{"date-parts":[[2007,11,13]],"date-time":"2007-11-13T23:27:49Z","timestamp":1194996469000},"page":"275-290","source":"Crossref","is-referenced-by-count":35,"title":["Assume-Guarantee Reasoning for Hierarchical Hybrid Systems"],"prefix":"10.1007","author":[{"given":"Thomas A.","family":"Henzinger","sequence":"first","affiliation":[]},{"given":"Marius","family":"Minea","sequence":"additional","affiliation":[]},{"given":"Vinayak","family":"Prabhu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,3,21]]},"reference":[{"key":"24_CR1","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.A. Henzinger, P.-H. 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":"24_CR2","doi-asserted-by":"crossref","unstructured":"R. Alur and R. Grosu. Modular refinement of hierarchic reactive machines. In Principles of Programming Languages, pp. 390\u2013402, ACM Press, 2000.","DOI":"10.1145\/325694.325746"},{"key":"24_CR3","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1007\/3-540-46430-1_5","volume-title":"Hybrid Systems: Computation and Control","author":"R. Alur","year":"2000","unstructured":"R. Alur, R. Grosu, Y. Hur, V. Kumar, and I. Lee. Modular specification of hybrid systems in Charon. In Hybrid Systems: Computation and Control, LNCS 1790, pp. 130\u2013144, Springer-Verlag, 2000."},{"key":"24_CR4","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"74","DOI":"10.1007\/3-540-63141-0_6","volume-title":"Concurrency Theory","author":"R. Alur","year":"1997","unstructured":"R. Alur and T.A. Henzinger. Modularity for timed and hybrid systems. In Concurrency Theory, LNCS 1243, pp. 74\u201388, Springer-Verlag, 1997."},{"key":"24_CR5","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1023\/A:1008739929481","volume":"15","author":"R. Alur","year":"1999","unstructured":"R. Alur and T.A. Henzinger. Reactive modules. Formal Methods in System Design, 15:7\u201348, 1999.","journal-title":"Formal Methods in System Design"},{"key":"24_CR6","doi-asserted-by":"publisher","first-page":"507","DOI":"10.1145\/203095.201069","volume":"17","author":"M. Abadi","year":"1995","unstructured":"M. Abadi and L. Lamport. Conjoining specifications. ACM Transactions on Programming Languages and Systems, 17:507\u2013534, 1995.","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"24_CR7","unstructured":"G. Booch, J. Rumbaugh, and I. Jacobson. The Unified Modeling Language User Guide. Addison-Wesley, 1998."},{"key":"24_CR8","volume-title":"Tech. Rep.","author":"J. Davis","year":"1999","unstructured":"J. Davis, M. Goel, C. Hylands, B. Kienhuis, E.A. Lee, J. Liu, X. Liu, L. Muliadi, S. Neuendorffer, J. Reekie, N. Smyth, J. Tsay, and Y. Xiong. Overview of the Ptolemy project. Tech. Rep. UCB\/ERL M99\/37, University of California, Berkeley, 1999."},{"key":"24_CR9","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1007\/BFb0031558","volume-title":"Hybrid Systems","author":"A. Deshpande","year":"1997","unstructured":"A. Deshpande, A. G\u00f6ll\u00fc, and P. Varaiya. Shift: A formalism and a programming language for dynamic networks of hybrid automata. In Hybrid Systems, LNCS 1273, pp. 113\u2013134, Springer-Verlag, 1997."},{"key":"24_CR10","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1016\/0167-6423(87)90035-9","volume":"8","author":"D. Harel","year":"1987","unstructured":"D. Harel. Statecharts: A visual formalism for complex systems. Science of Computer Programming, 8:231\u2013274, 1987.","journal-title":"Science of Computer Programming"},{"key":"24_CR11","doi-asserted-by":"crossref","unstructured":"T.A. Henzinger, The theory of hybrid automata. In Logic in Computer Science, pp. 278\u2013292, IEEE Computer Society Press, 1996.","DOI":"10.1109\/LICS.1996.561342"},{"key":"24_CR12","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"549","DOI":"10.1007\/3-540-44929-9_38","volume-title":"Theoretical Computer Science","author":"T.A. Henzinger","year":"2000","unstructured":"T.A. Henzinger. Masaccio: A formal model for embedded components. In Theoretical Computer Science, LNCS 1872, pp. 549\u2013563, Springer Verlag, 2000."},{"key":"24_CR13","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"496","DOI":"10.1007\/BFb0020971","volume-title":"Hybrid Systems","author":"N.A. Lynch","year":"1996","unstructured":"N.A. Lynch, R. Segala, F. Vaandrager, and H.B. Weinberg. Hybrid I\/O Automata. In Hybrid Systems, LNCS 1066, pp. 496\u2013510, Springer-Verlag, 1996."},{"key":"24_CR14","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"24","DOI":"10.1007\/3-540-63166-6_6","volume-title":"Computer-aided Verification","author":"K.L. McMillan","year":"1997","unstructured":"K.L. McMillan. A compositional rule for hardware design refinement. In Computer-aided Verification, LNCS 1254, pp. 24\u201335, Springer-Verlag, 1997."},{"key":"24_CR15","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1109\/TSE.1981.230844","volume":"7","author":"J. Misra","year":"1981","unstructured":"J. Misra and K.M. Chandy. Proofs of networks of processes. IEEE Transactions on Software Engineering, 7:417\u2013426, 1981.","journal-title":"IEEE Transactions on Software Engineering"},{"key":"24_CR16","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"546","DOI":"10.1007\/3-540-61604-7_75","volume-title":"Concurrency Theory","author":"S. Tasiran","year":"1996","unstructured":"S. Tasiran, R. Alur, R.P. Kurshan, and R.K. Brayton. Verifying abstractions of timed systems. In Concurrency Theory, LNCS 1119, pp. 546\u2013562, Springer-Verlag, 1996."},{"key":"24_CR17","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1007\/BFb0014994","volume-title":"Concurrency Theory","author":"A.C. Uselton","year":"1994","unstructured":"A.C. Uselton and S.A. Smolka. A compositional semantics for Statecharts using labeled transition systems. In Concurrency Theory, LNCS 836, pp. 2\u201317, Springer-Verlag, 1994."}],"container-title":["Lecture Notes in Computer Science","Hybrid Systems: Computation and Control"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45351-2_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,22]],"date-time":"2025-01-22T09:01:44Z","timestamp":1737536504000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45351-2_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540418665","9783540453512"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/3-540-45351-2_24","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2001]]}}}