Synthesizing optimally resilient controllers

Neider, Daniel; Weinert, Alexander; Zimmermann, Martín

doi:10.1007/s00236-019-00345-7

Cited by 13 publications

(22 citation statements)

References 26 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

Section: Fault Resilient Strategies For Safety Gamesmentioning

confidence: 99%

Quantitative reductions and vertex-ranked infinite games

Weinert

2021

Information and Computation

Self Cite

View full text Add to dashboard Cite

We introduce quantitative reductions, a novel technique for structuring the space of quantitative games and solving them that does not rely on a reduction to qualitative games. We show that such reductions exhibit the same desirable properties as their qualitative counterparts and that they additionally retain the optimality of solutions. Moreover, we introduce vertex-ranked games as a general-purpose target for quantitative reductions and show how to solve them. In such games, the value of a play is determined only by a qualitative winning condition and a ranking of the vertices. We provide quantitative reductions of quantitative request-response games and of quantitative Muller games to vertex-ranked games, thus showing Ex-pTime-completeness of solving the former two kinds of games. In addition, we exhibit the usefulness and flexibility of vertex-ranked games by showing how to use such games to compute fault-resilient strategies for safety specifications. This work lays the foundation for a general study of fault-resilient strategies for more complex winning conditions.

show abstract

Section: Fault Resilient Strategies For Safety Gamesmentioning

confidence: 99%

Quantitative reductions and vertex-ranked infinite games

Weinert

2021

Information and Computation

Self Cite

View full text Add to dashboard Cite

show abstract

“…Following Neider, Weinert, and Zimmermann [16], we first characterize the abstract states of finite resilience. The remaining abstract states then have either resilience ω or ω+1, and we show how to distinguish between them.…”

Section: B Computing Optimally Resilient Strategiesmentioning

confidence: 99%

Resilient Abstraction-Based Controller Design

Samuel

Mallik

Schmuck

et al. 2020

2020 59th IEEE Conference on Decision and Control (CDC)

Self Cite

View full text Add to dashboard Cite

We consider the computation of resilient controllers for perturbed non-linear dynamical systems w.r.t. linear-time temporal logic specifications. We address this problem through the paradigm of Abstraction-Based Controller Design (ABCD) where a finite state abstraction of the perturbed system dynamics is constructed and utilized for controller synthesis. In this context, our contribution is twofold: (I) We construct abstractions which model the impact of occasional high disturbance spikes on the system via so called disturbance edges. (II) We show that the application of resilient reactive synthesis techniques to these abstract models results in closed loop systems which are optimally resilient to these occasional high disturbance spikes. We have implemented this resilient ABCD workflow on top of SCOTS and showcase our method through multiple robot planning examples.

show abstract

“…Here, we require the winning condition to be a safety condition in order to compute val(v). In recent work, we have shown how to compute this value for more complex qualitative winning conditions [20]. If val(v) is effectively computable for a given qualitative winning condition, one can easily obtain fault-resilient strategies by formulating the task as a vertex-ranked game as demonstrated.…”

Section: Fault Resilient Strategies For Safety Gamesmentioning

confidence: 99%

Quantitative Reductions and Vertex-Ranked Infinite Games

Weinert

2018

Electron. Proc. Theor. Comput. Sci.

Self Cite

View full text Add to dashboard Cite

We introduce quantitative reductions, a novel technique for structuring the space of quantitative games and solving them that does not rely on a reduction to qualitative games. We show that such reductions exhibit the same desirable properties as their qualitative counterparts and additionally retain the optimality of solutions. Moreover, we introduce vertex-ranked games as a general-purpose target for quantitative reductions and show how to solve them. In such games, the value of a play is determined only by a qualitative winning condition and a ranking of the vertices.We provide quantitative reductions of quantitative request-response games to vertex-ranked games, thus showing EXPTIME-completeness of solving the former games. Furthermore, we exhibit the usefulness and flexibility of vertex-ranked games by showing how to use such games to compute fault-resilient strategies for safety specifications. This work lays the foundation for a general study of fault-resilient strategies for more complex winning conditions.

show abstract

Synthesizing optimally resilient controllers

Cited by 13 publications

References 26 publications

Quantitative reductions and vertex-ranked infinite games

Quantitative reductions and vertex-ranked infinite games

Resilient Abstraction-Based Controller Design

Quantitative Reductions and Vertex-Ranked Infinite Games

Contact Info

Product

Resources

About