Symbolic optimal expected time reachability computation and controller synthesis for probabilistic timed automata
In this paper we consider the problem of computing the optimal (minimum or maximum) expected time to reach a target and the synthesis of an optimal controller for a probabilistic timed automaton (PTA). Although this problem admits solutions that employ the digital clocks abstraction or statistical m...
| Автори: | , , , |
|---|---|
| Формат: | Journal article |
| Опубліковано: |
Elsevier
2017
|