Name
Abstract | ||
|---|---|---|
We investigate the robustness of reactive control protocols synthesized to guarantee system's correctness with respect to given temporal logic specifications. We consider uncertainties in open finite transition systems due to unmodeled transitions. The resulting robust synthesis problem is formulated as a temporal logic game. In particular, if the specification is in the so-called generalized reactivity [1] fragment of linear temporal logic, so is the augmented specification in the resulting robust synthesis problem. Hence, the robust synthesis problem belongs to the same complexity class with the nominal synthesis problem, and is amenable to polynomial time solvers. Additionally, we discuss reasoning about the effects of different levels of uncertainties on robust synthesizability and demonstrate the results on a simple robot motion planning scenario. |
Year | DOI | Venue |
|---|---|---|
2012 | 10.1145/2185632.2185648 | HSCC |
Keywords | Field | DocType |
different level,robust synthesis problem,nominal synthesis problem,linear temporal logic,open finite transition system,robust discrete controller,complexity class,temporal logic specification,robust synthesizability,augmented specification,temporal logic game,polynomial time,temporal logic,robustness | Complexity class,Control theory,Correctness,Robot motion planning,Robustness (computer science),Linear temporal logic,Temporal logic,Time complexity,Reactive control,Mathematics | Conference |
Citations | PageRank | References |
17 | 0.78 | 15 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ufuk Topcu | 1 | 1032 | 115.78 |
| Necmiye Ozay | 2 | 390 | 41.51 |
| Jun Liu | 3 | 45 | 4.57 |
| Richard M. Murray | 4 | 12322 | 1223.70 |