[{"month":"07","conference":{"name":"CONCUR: Concurrency Theory"},"alternative_title":["LNCS"],"quality_controlled":0,"page":"147 - 161","volume":5201,"date_published":"2008-07-30T00:00:00Z","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","title":"Environment assumptions for synthesis","type":"conference","_id":"3877","citation":{"apa":"Chatterjee, K., Henzinger, T. A., & Jobstmann, B. (2008). Environment assumptions for synthesis (Vol. 5201, pp. 147–161). Presented at the CONCUR: Concurrency Theory, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.1007/978-3-540-85361-9_14","chicago":"Chatterjee, Krishnendu, Thomas A Henzinger, and Barbara Jobstmann. “Environment Assumptions for Synthesis,” 5201:147–61. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2008. https://doi.org/10.1007/978-3-540-85361-9_14.","ama":"Chatterjee K, Henzinger TA, Jobstmann B. Environment assumptions for synthesis. In: Vol 5201. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2008:147-161. doi:10.1007/978-3-540-85361-9_14","ieee":"K. Chatterjee, T. A. Henzinger, and B. Jobstmann, “Environment assumptions for synthesis,” presented at the CONCUR: Concurrency Theory, 2008, vol. 5201, pp. 147–161.","mla":"Chatterjee, Krishnendu, et al. *Environment Assumptions for Synthesis*. Vol. 5201, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2008, pp. 147–61, doi:10.1007/978-3-540-85361-9_14.","ista":"Chatterjee K, Henzinger TA, Jobstmann B. 2008. Environment assumptions for synthesis. CONCUR: Concurrency Theory, LNCS, vol. 5201. 147–161.","short":"K. Chatterjee, T.A. Henzinger, B. Jobstmann, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2008, pp. 147–161."},"date_created":"2018-12-11T12:05:39Z","status":"public","intvolume":" 5201","extern":1,"abstract":[{"text":"The synthesis problem asks to construct a reactive finite-state system from an omega-regular specification. Initial specifications are often unrealizable, which means that there is no system that implements the specification. A common reason for unrealizability is that assumptions on the environment of the system are incomplete. We study the problem of correcting an unrealizable specification phi by computing an environment assumption psi such that the new specification psi -> phi is realizable. Our aim is to construct an assumption psi that constrains only the environment and is as weak as possible. We present a two-step algorithm for computing assumptions. The algorithm operates on the game graph that is used to answer the realizability question. First, we compute a safety assumption that removes a minimal set of environment edges from the graph. Second, we compute a liveness assumption that puts fairness conditions on some of the remaining environment edges. We show that the problem of finding a minimal set of fair edges is computationally hard, and we use probabilistic games to compute a locally minimal fairness assumption.","lang":"eng"}],"doi":"10.1007/978-3-540-85361-9_14","author":[{"last_name":"Chatterjee","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Krishnendu Chatterjee"},{"orcid":"0000−0002−2985−7724","last_name":"Henzinger","full_name":"Thomas Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A"},{"last_name":"Jobstmann","first_name":"Barbara","full_name":"Jobstmann, Barbara"}],"day":"30","year":"2008","publist_id":"2295","publication_status":"published","date_updated":"2019-08-02T12:38:20Z"}]