{"month":"01","date_updated":"2021-01-12T07:59:32Z","type":"conference","doi":"10.1007/978-3-540-71209-1_21","page":"261 - 275","author":[{"orcid":"0000-0002-4561-241X","first_name":"Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Krishnendu Chatterjee"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Thomas Henzinger","last_name":"Henzinger","first_name":"Thomas A","orcid":"0000−0002−2985−7724"}],"day":"01","_id":"4537","abstract":[{"lang":"eng","text":"The classical synthesis problem for reactive systems asks, given a proponent process A and an opponent process B, to refine A so that the closed-loop system A parallel to B satisfies a given specification Phi. The solution of this problem requires the computation of a winning strategy for proponent A in a game against opponent B. We define and study the co-synthesis problem, where the proponent A consists itself of two independent processes, A = A(1)parallel to A(2), with specifications Phi(1) and Phi(2), and the goal is to refine both A(1) and A(2) so that A(1)parallel to A(2)parallel to B satisfies Phi(1) boolean AND Phi(2). For example, if the opponent B is a fair scheduler for the two processes A(1) and A(2), and Phi(i) specifies the requirements of mutual exclusion for A(i) (e.g., starvation freedom), then the co-synthesis problem asks for the automatic synthesis of a mutual-exclusion protocol. We show that co-synthesis defined classically, with the processes A(1) and A(2) either collaborating or competing, does not capture desirable solutions. Instead, the proper formulation of co-synthesis is the one where process A, competes with A(2) but not at the price of violating Phi(1), and vice versa. We call this assume-guarantee synthesis and show that it can be solved by computing secure-equilibrium strategies. In particular, from mutual-exclusion requirements the assume-guarantee synthesis algorithm automatically computes Peterson's protocol."}],"date_published":"2007-01-01T00:00:00Z","citation":{"ieee":"K. Chatterjee and T. A. Henzinger, “Assume-guarantee synthesis,” presented at the TACAS: Tools and Algorithms for the Construction and Analysis of Systems, 2007, vol. 4424, pp. 261–275.","mla":"Chatterjee, Krishnendu, and Thomas A. Henzinger. <i>Assume-Guarantee Synthesis</i>. Vol. 4424, Springer, 2007, pp. 261–75, doi:<a href=\"https://doi.org/10.1007/978-3-540-71209-1_21\">10.1007/978-3-540-71209-1_21</a>.","short":"K. Chatterjee, T.A. Henzinger, in:, Springer, 2007, pp. 261–275.","ista":"Chatterjee K, Henzinger TA. 2007. Assume-guarantee synthesis. TACAS: Tools and Algorithms for the Construction and Analysis of Systems, LNCS, vol. 4424, 261–275.","apa":"Chatterjee, K., &#38; Henzinger, T. A. (2007). Assume-guarantee synthesis (Vol. 4424, pp. 261–275). Presented at the TACAS: Tools and Algorithms for the Construction and Analysis of Systems, Springer. <a href=\"https://doi.org/10.1007/978-3-540-71209-1_21\">https://doi.org/10.1007/978-3-540-71209-1_21</a>","chicago":"Chatterjee, Krishnendu, and Thomas A Henzinger. “Assume-Guarantee Synthesis,” 4424:261–75. Springer, 2007. <a href=\"https://doi.org/10.1007/978-3-540-71209-1_21\">https://doi.org/10.1007/978-3-540-71209-1_21</a>.","ama":"Chatterjee K, Henzinger TA. Assume-guarantee synthesis. In: Vol 4424. Springer; 2007:261-275. doi:<a href=\"https://doi.org/10.1007/978-3-540-71209-1_21\">10.1007/978-3-540-71209-1_21</a>"},"publication_status":"published","conference":{"name":"TACAS: Tools and Algorithms for the Construction and Analysis of Systems"},"extern":1,"publisher":"Springer","year":"2007","intvolume":"      4424","date_created":"2018-12-11T12:09:22Z","publist_id":"186","volume":4424,"alternative_title":["LNCS"],"title":"Assume-guarantee synthesis","quality_controlled":0,"acknowledgement":"This research was supported in part by the Swiss National Science Foundation and by the NSF grants CCR-0225610 and CCR-0234690.","status":"public"}