[{"publist_id":"250","year":"2001","date_published":"2001-03-14T00:00:00Z","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.","conference":{"location":"Rome, Italy","name":"HSCC: Hybrid Systems - Computation and Control","start_date":"2001-03-28","end_date":"2001-03-30"},"extern":"1","status":"public","publication":"Proceedings of the 4th International Workshop on Hybrid Systems","type":"conference","_id":"4477","date_updated":"2023-05-09T14:47:37Z","publisher":"Springer","article_processing_charge":"No","alternative_title":["LNCS"],"doi":"10.1007/3-540-45351-2_24","quality_controlled":"1","page":"275 - 290","month":"03","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","citation":{"ieee":"T. A. Henzinger, M. Minea, and V. Prabhu, “Assume-guarantee reasoning for hierarchical hybrid systems,” in <i>Proceedings of the 4th International Workshop on Hybrid Systems</i>, Rome, Italy, 2001, vol. 2034, pp. 275–290.","short":"T.A. Henzinger, M. Minea, V. Prabhu, in:, Proceedings of the 4th International Workshop on Hybrid Systems, Springer, 2001, pp. 275–290.","ama":"Henzinger TA, Minea M, Prabhu V. Assume-guarantee reasoning for hierarchical hybrid systems. In: <i>Proceedings of the 4th International Workshop on Hybrid Systems</i>. Vol 2034. Springer; 2001:275-290. doi:<a href=\"https://doi.org/10.1007/3-540-45351-2_24\">10.1007/3-540-45351-2_24</a>","apa":"Henzinger, T. A., Minea, M., &#38; Prabhu, V. (2001). Assume-guarantee reasoning for hierarchical hybrid systems. In <i>Proceedings of the 4th International Workshop on Hybrid Systems</i> (Vol. 2034, pp. 275–290). Rome, Italy: Springer. <a href=\"https://doi.org/10.1007/3-540-45351-2_24\">https://doi.org/10.1007/3-540-45351-2_24</a>","mla":"Henzinger, Thomas A., et al. “Assume-Guarantee Reasoning for Hierarchical Hybrid Systems.” <i>Proceedings of the 4th International Workshop on Hybrid Systems</i>, vol. 2034, Springer, 2001, pp. 275–90, doi:<a href=\"https://doi.org/10.1007/3-540-45351-2_24\">10.1007/3-540-45351-2_24</a>.","chicago":"Henzinger, Thomas A, Marius Minea, and Vinayak Prabhu. “Assume-Guarantee Reasoning for Hierarchical Hybrid Systems.” In <i>Proceedings of the 4th International Workshop on Hybrid Systems</i>, 2034:275–90. Springer, 2001. <a href=\"https://doi.org/10.1007/3-540-45351-2_24\">https://doi.org/10.1007/3-540-45351-2_24</a>.","ista":"Henzinger TA, Minea M, Prabhu V. 2001. Assume-guarantee reasoning for hierarchical hybrid systems. Proceedings of the 4th International Workshop on Hybrid Systems. HSCC: Hybrid Systems - Computation and Control, LNCS, vol. 2034, 275–290."},"language":[{"iso":"eng"}],"date_created":"2018-12-11T12:09:03Z","volume":2034,"oa_version":"None","title":"Assume-guarantee reasoning for hierarchical hybrid systems","day":"14","scopus_import":"1","author":[{"orcid":"0000−0002−2985−7724","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A","last_name":"Henzinger"},{"full_name":"Minea, Marius","last_name":"Minea","first_name":"Marius"},{"first_name":"Vinayak","last_name":"Prabhu","full_name":"Prabhu, Vinayak"}],"publication_identifier":{"isbn":["9783540418665"]},"publication_status":"published","intvolume":"      2034","abstract":[{"lang":"eng","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."}]}]