[{"quality_controlled":0,"date_created":"2018-12-11T12:09:03Z","publist_id":"250","type":"conference","publication_status":"published","day":"14","alternative_title":["LNCS"],"conference":{"name":"HSCC: Hybrid Systems - Computation and Control"},"year":"2001","_id":"4477","doi":"10.1007/3-540-45351-2_24","title":"Assume-guarantee reasoning for hierarchical hybrid systems","page":"275 - 290","volume":2034,"publisher":"Springer","date_published":"2001-03-14T00:00:00Z","citation":{"short":"T.A. Henzinger, M. Minea, V. Prabhu, in:, Springer, 2001, pp. 275–290.","ista":"Henzinger TA, Minea M, Prabhu V. 2001. Assume-guarantee reasoning for hierarchical hybrid systems. HSCC: Hybrid Systems - Computation and Control, LNCS, vol. 2034. 275–290.","ieee":"T. A. Henzinger, M. Minea, and V. Prabhu, “Assume-guarantee reasoning for hierarchical hybrid systems,” presented at the HSCC: Hybrid Systems - Computation and Control, 2001, vol. 2034, pp. 275–290.","ama":"Henzinger TA, Minea M, Prabhu V. Assume-guarantee reasoning for hierarchical hybrid systems. In: Vol 2034. Springer; 2001:275-290. doi:10.1007/3-540-45351-2_24","mla":"Henzinger, Thomas A., et al. *Assume-Guarantee Reasoning for Hierarchical Hybrid Systems*. Vol. 2034, Springer, 2001, pp. 275–90, doi:10.1007/3-540-45351-2_24.","chicago":"Henzinger, Thomas A, Marius Minea, and Vinayak Prabhu. “Assume-Guarantee Reasoning for Hierarchical Hybrid Systems,” 2034:275–90. Springer, 2001. https://doi.org/10.1007/3-540-45351-2_24.","apa":"Henzinger, T. A., Minea, M., & Prabhu, V. (2001). Assume-guarantee reasoning for hierarchical hybrid systems (Vol. 2034, pp. 275–290). Presented at the HSCC: Hybrid Systems - Computation and Control, Springer. https://doi.org/10.1007/3-540-45351-2_24"},"date_updated":"2019-08-02T12:38:31Z","intvolume":" 2034","status":"public","author":[{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","full_name":"Thomas Henzinger","orcid":"0000−0002−2985−7724","first_name":"Thomas A"},{"last_name":"Minea","first_name":"Marius","full_name":"Minea, Marius"},{"last_name":"Prabhu","first_name":"Vinayak","full_name":"Prabhu, Vinayak S"}],"extern":1,"month":"03","acknowledgement":"Support for this research was provided in part by the AFOSR MURI grant F49620- 00-1-0327, and the DARPA SEC grant F33615-C-98-3614, the MARCO GSRC grant 98-DT-660, the NSF ITR grant CCR-0085949.","abstract":[{"text":"The assume-guarantee paradigm is a powerful divide-and-conquer mechanism for decomposing a verification task about a system into subtasks about the individual components of the system. The key to assume-guarantee reasoning is to consider each component not in isolation, but in conjunction with assumptions about the context of the component. Assume-guarantee principles are known for purely concurrent contexts, which constrain the input data of a component, as well as for purely sequential contexts, which constrain the entry configurations of a component. We present a model for hierarchical system design which permits the arbitrary nesting of parallel as well as serial composition, and which supports an assume-guarantee principle for mixed parallel-serial contexts. Our model also supports both discrete and continuous processes, and is therefore well-suited for the modeling and analysis of embedded software systems which interact with real-world environments. Using an example of two cooperating robots, we show refinement between a high-level model which specifies continuous timing constraints and an implementation which relies on discrete sampling.","lang":"eng"}]}]