Continuous-Time Markov Decisions Based on Partial Exploration

Logo poskytovatele

Varování

Publikace nespadá pod Ekonomicko-správní fakultu, ale pod Fakultu informatiky. Oficiální stránka publikace je na webu muni.cz.
Autoři

ASHOK Pranav BUTKOVA Yuliya HERMANNS Holger KŘETÍNSKÝ Jan

Rok publikování 2018
Druh Článek ve sborníku
Konference Automated Technology for Verification and Analysis. ATVA 2018
Fakulta / Pracoviště MU

Fakulta informatiky

Citace
Doi http://dx.doi.org/10.1007/978-3-030-01090-4_19
Klíčová slova Continuous-Time Markov Decision Processes; reachability; Partial Exploration
Popis We provide a framework for speeding up algorithms for time-bounded reachability analysis of continuous-time Markov decision processes. The principle is to find a small, but almost equivalent subsystem of the original system and only analyse the subsystem. Candidates for the subsystem are identified through simulations and iteratively enlarged until runs are represented in the subsystem with high enough probability. The framework is thus dual to that of abstraction refinement. We instantiate the framework in several ways with several traditional algorithms and experimentally confirm orders-of-magnitude speed ups in many cases.
Související projekty:

Používáte starou verzi internetového prohlížeče. Doporučujeme aktualizovat Váš prohlížeč na nejnovější verzi.