Optimal assumptions for synthesis
Controller synthesis is the automatic construction a correct system from its specification. This often requires assumptions about the behaviour of the environment. It is difficult for the designer to identify the assumptions that ensures the existence of a correct controller, and doing so manually c...
| Main Author: | |
|---|---|
| Format: | Conference item |
| Published: |
Schloss Dagstuhl
2016
|
| _version_ | 1797100626336808960 |
|---|---|
| author | Brenguier, R |
| author_facet | Brenguier, R |
| author_sort | Brenguier, R |
| collection | OXFORD |
| description | Controller synthesis is the automatic construction a correct system from its specification. This often requires assumptions about the behaviour of the environment. It is difficult for the designer to identify the assumptions that ensures the existence of a correct controller, and doing so manually can lead to assumptions that are stronger than necessary. As a consequence the generated controllers are suboptimal in terms of robustness. In this work, given a specification, we identify the weakest assumptions that ensure the existence of a controller. We also consider two important classes of assumptions: the ones that can be ensured by the environment and assumptions that restricts only inputs of the systems. We show that optimal assumptions correspond to strongly winning strategies, admissible strategies and remorse-free strategies depending on the classes. Using these correspondences, we then propose an algorithm for computing optimal assumptions that can be ensured by the environment. |
| first_indexed | 2024-03-07T05:40:14Z |
| format | Conference item |
| id | oxford-uuid:e552283e-9f8b-4700-b546-476d2efb7862 |
| institution | University of Oxford |
| last_indexed | 2024-03-07T05:40:14Z |
| publishDate | 2016 |
| publisher | Schloss Dagstuhl |
| record_format | dspace |
| spelling | oxford-uuid:e552283e-9f8b-4700-b546-476d2efb78622022-03-27T10:23:06ZOptimal assumptions for synthesisConference itemhttp://purl.org/coar/resource_type/c_5794uuid:e552283e-9f8b-4700-b546-476d2efb7862Symplectic Elements at OxfordSchloss Dagstuhl2016Brenguier, RController synthesis is the automatic construction a correct system from its specification. This often requires assumptions about the behaviour of the environment. It is difficult for the designer to identify the assumptions that ensures the existence of a correct controller, and doing so manually can lead to assumptions that are stronger than necessary. As a consequence the generated controllers are suboptimal in terms of robustness. In this work, given a specification, we identify the weakest assumptions that ensure the existence of a controller. We also consider two important classes of assumptions: the ones that can be ensured by the environment and assumptions that restricts only inputs of the systems. We show that optimal assumptions correspond to strongly winning strategies, admissible strategies and remorse-free strategies depending on the classes. Using these correspondences, we then propose an algorithm for computing optimal assumptions that can be ensured by the environment. |
| spellingShingle | Brenguier, R Optimal assumptions for synthesis |
| title | Optimal assumptions for synthesis |
| title_full | Optimal assumptions for synthesis |
| title_fullStr | Optimal assumptions for synthesis |
| title_full_unstemmed | Optimal assumptions for synthesis |
| title_short | Optimal assumptions for synthesis |
| title_sort | optimal assumptions for synthesis |
| work_keys_str_mv | AT brenguierr optimalassumptionsforsynthesis |