{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,7]],"date-time":"2026-02-07T04:13:59Z","timestamp":1770437639419,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642299513","type":"print"},{"value":"9783642299520","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-29952-0_13","type":"book-chapter","created":{"date-parts":[[2012,5,3]],"date-time":"2012-05-03T06:14:09Z","timestamp":1336025649000},"page":"72-83","source":"Crossref","is-referenced-by-count":11,"title":["An Assume\/Guarantee Based Compositional Calculus for Hybrid CSP"],"prefix":"10.1007","author":[{"given":"Shuling","family":"Wang","sequence":"first","affiliation":[]},{"given":"Naijun","family":"Zhan","sequence":"additional","affiliation":[]},{"given":"Dimitar","family":"Guelev","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"13_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1007\/3-540-57318-6_30","volume-title":"Hybrid Systems","author":"R. Alur","year":"1993","unstructured":"Alur, R., Courcoubetis, C., Henzinger, T.A., Ho, P.: Hybrid Automata: An Algorithmic Approach to the Specification and Verification of Hybrid Systems. In: Grossman, R.L., Ravn, A.P., Rischel, H., Nerode, A. (eds.) HS 1991 and HS 1992. LNCS, vol.\u00a0736, pp. 209\u2013229. Springer, Heidelberg (1993)"},{"key":"13_CR2","doi-asserted-by":"crossref","unstructured":"Guelev, D.P., Dang, V.H.: Prefix and projection onto state in duration calculus. In: ETAPS Workshop Theory and Practice of Timed Systems (TPTS 2002). ENTCS, vol.\u00a065(6), pp. 101\u2013119 (2002)","DOI":"10.1016\/S1571-0661(04)80472-9"},{"issue":"1-3","key":"13_CR3","doi-asserted-by":"publisher","first-page":"278","DOI":"10.1016\/j.tcs.2005.01.017","volume":"337","author":"D.P. Guelev","year":"2005","unstructured":"Guelev, D.P., Dang, V.H.: On the completeness and decidability of duration calculus with iteration. Theoretical Computer Science\u00a0337(1-3), 278\u2013304 (2005)","journal-title":"Theoretical Computer Science"},{"key":"13_CR4","unstructured":"He, J.: From CSP to hybrid systems. In: A Classical Mind, pp. 171\u2013189. Prentice Hall International (UK) Ltd. (1994)"},{"key":"13_CR5","doi-asserted-by":"crossref","unstructured":"Henzinger, T.A.: The theory of hybrid automata. In: LICS 1996, pp. 278\u2013292. IEEE Computer Society (1996)","DOI":"10.1109\/LICS.1996.561342"},{"issue":"1-2","key":"13_CR6","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1016\/0167-6423(81)90005-8","volume":"1","author":"C.A.R. Hoare","year":"1981","unstructured":"Hoare, C.A.R.: A calculus of total correctness for communicating processes. Science of Computer Programming\u00a01(1-2), 49\u201372 (1981)","journal-title":"Science of Computer Programming"},{"issue":"6A","key":"13_CR7","doi-asserted-by":"publisher","first-page":"801","DOI":"10.1007\/BF01213604","volume":"6","author":"J. Hooman","year":"1994","unstructured":"Hooman, J.: Extending Hoare logic to real-time. Formal Aspects of Computing\u00a06(6A), 801\u2013826 (1994)","journal-title":"Formal Aspects of Computing"},{"key":"13_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-17164-2_1","volume-title":"Programming Languages and Systems","author":"J. Liu","year":"2010","unstructured":"Liu, J., Lv, J., Quan, Z., Zhan, N., Zhao, H., Zhou, C., Zou, L.: A Calculus for Hybrid CSP. In: Ueda, K. (ed.) APLAS 2010. LNCS, vol.\u00a06461, pp. 1\u201315. Springer, Heidelberg (2010)"},{"key":"13_CR9","doi-asserted-by":"crossref","unstructured":"Liu, J., Zhan, N., Zhao, H.: Computing semi-algebraic invariants for polynomial dynamical systems. In: EMSOFT 2011, pp. 97\u2013106. ACM (2011)","DOI":"10.1145\/2038642.2038659"},{"key":"13_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1007\/3-540-57318-6_22","volume-title":"Hybrid Systems","author":"Z. Manna","year":"1993","unstructured":"Manna, Z., Pnueli, A.: Verifying Hybrid Systems. In: Grossman, R.L., Ravn, A.P., Rischel, H., Nerode, A. (eds.) HS 1991 and HS 1992. LNCS, vol.\u00a0736, pp. 4\u201335. Springer, Heidelberg (1993)"},{"key":"13_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1007\/3-540-64358-3_47","volume-title":"Hybrid Systems: Computation and Control","author":"Z. Manna","year":"1998","unstructured":"Manna, Z., Sipma, H.: Deductive Verification of Hybrid Systems Using STeP. In: Henzinger, T.A., Sastry, S.S. (eds.) HSCC 1998. LNCS, vol.\u00a01386, pp. 305\u2013318. Springer, Heidelberg (1998)"},{"issue":"4","key":"13_CR12","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1109\/TSE.1981.230844","volume":"7","author":"J. Misra","year":"1981","unstructured":"Misra, J., Chandy, M.: Proofs of networks of processes. IEEE Transactions on Software Engineering (TSE)\u00a07(4), 417\u2013426 (1981)","journal-title":"IEEE Transactions on Software Engineering (TSE)"},{"key":"13_CR13","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/BF02311231","volume":"5","author":"P.K. Pandya","year":"1991","unstructured":"Pandya, P.K., Joseph, M.: P-A logic - a compositional proof system for distributed programs. Distributed Computing\u00a05, 37\u201354 (1991)","journal-title":"Distributed Computing"},{"issue":"2","key":"13_CR14","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/s10817-008-9103-8","volume":"41","author":"A. Platzer","year":"2008","unstructured":"Platzer, A.: Differential dynamic logic for hybrid systems. Journal of Automated Reasoning\u00a041(2), 143\u2013189 (2008)","journal-title":"Journal of Automated Reasoning"},{"issue":"4","key":"13_CR15","doi-asserted-by":"publisher","first-page":"647","DOI":"10.1145\/1780.1805","volume":"6","author":"N. Soundararajan","year":"1984","unstructured":"Soundararajan, N.: Axiomatic semantics of communicating sequential processes. ACM Transactions on Programming Languages and Systems\u00a06(4), 647\u2013662 (1984)","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"13_CR16","unstructured":"Wang, S., Zhan, N., Guelev, D.: An assume\/guarantee based compositional calculus for hybrid CSP and its soundness. Technical Report ISCAS-SKLCS-11-24, State Key Laboratory of Computer Science, Institute of Software, Chinese Academy of Sciences (2011)"},{"key":"13_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"304","DOI":"10.1007\/3-540-51803-7_32","volume-title":"Temporal Logic in Specification","author":"C. Zhou","year":"1989","unstructured":"Zhou, C.: Specifying Communicating Systems with Temporal Logic. In: Banieqbal, B., Pnueli, A., Barringer, H. (eds.) Temporal Logic in Specification. LNCS, vol.\u00a0398, pp. 304\u2013323. Springer, Heidelberg (1989)"},{"key":"13_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1007\/3-540-60249-6_39","volume-title":"Fundamentals of Computation Theory","author":"C. Zhou","year":"1995","unstructured":"Zhou, C., Dang, V., Li, X.: A Duration Calculus with Infinite Intervals. In: Reichel, H. (ed.) FCT 1995. LNCS, vol.\u00a0965, pp. 16\u201341. Springer, Heidelberg (1995)"},{"key":"13_CR19","unstructured":"Zhou, C., Hansen, M.R.: Duration Calculus: A Formal Approach to Real-Time Systems. Series: Monographs in Theoretical Computer Science. An EATCS Series. Springer (2004)"},{"key":"13_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"511","DOI":"10.1007\/BFb0020972","volume-title":"Hybrid Systems III","author":"C. Zhou","year":"1996","unstructured":"Zhou, C., Wang, J., Ravn, A.P.: A Formal Description of Hybrid Systems. In: Alur, R., Sontag, E.D., Henzinger, T.A. (eds.) HS 1995. LNCS, vol.\u00a01066, pp. 511\u2013530. Springer, Heidelberg (1996)"},{"key":"13_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1007\/3-540-12896-4_384","volume-title":"Logics of Programs","author":"J. Zwiers","year":"1984","unstructured":"Zwiers, J., de Bruin, A., de Roever, W.-P.: A Proof System for Partial Correctness of Dynamic Networks of Processes (Extended Abstract). In: Clarke, E., Kozen, D. (eds.) Logic of Programs 1983. LNCS, vol.\u00a0164, pp. 513\u2013527. Springer, Heidelberg (1984)"}],"container-title":["Lecture Notes in Computer Science","Theory and Applications of Models of Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-29952-0_13.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T02:54:45Z","timestamp":1743044085000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-29952-0_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642299513","9783642299520"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-29952-0_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012]]}}}