|
Evènement pour le groupe Séminaire Méthodes Formelles
Date | 2020-01-07 07:00-07:00 |
Titre | Mixing sure, almost sure, exist and probable objectives in MDPs |
Résumé | We consider algorithms to decide the existence of strategies in MDPs for Boolean combinations of objectives. These objectives are omega-regular properties that need to be enforced either surely (whatever happens), almost surely (with probability one), existentially (it can happen), or with non-zero probability. Such a combination of properties could be e.g. that an agent reaches a target with high probability while guaranteeing it will not crash. We provide algorithms to solve the general case of Boolean combinations and we also investigate relevant subcases. We provide algorithms to solve the general case of Boolean combinations and we also investigate relevant subcases. We also report on complexity lower-bounds for these problems. |
Lieu | 178 |
Orateur | Raphaël Berthon |
Email | http://di.ulb.ac.be/verif/berthon/ |
Url | ULB |
Aucun document lié à cet événement. RetourRetour à l'index
| |