Detailed Information on Publication Record
2018
Continuous-Time Markov Decisions Based on Partial Exploration
ASHOK, Pranav, Yuliya BUTKOVA, Holger HERMANNS and Jan KŘETÍNSKÝBasic information
Original name
Continuous-Time Markov Decisions Based on Partial Exploration
Authors
ASHOK, Pranav (356 India), Yuliya BUTKOVA (860 Uzbekistan), Holger HERMANNS (276 Germany) and Jan KŘETÍNSKÝ (203 Czech Republic, guarantor, belonging to the institution)
Edition
Cham, Automated Technology for Verification and Analysis. ATVA 2018, p. 317-334, 18 pp. 2018
Publisher
Springer
Other information
Language
English
Type of outcome
Stať ve sborníku
Field of Study
10201 Computer sciences, information science, bioinformatics
Country of publisher
Switzerland
Confidentiality degree
není předmětem státního či obchodního tajemství
Publication form
printed version "print"
Impact factor
Impact factor: 0.402 in 2005
RIV identification code
RIV/00216224:14330/18:00108289
Organization unit
Faculty of Informatics
ISBN
978-3-030-01089-8
ISSN
UT WoS
000723531300019
Keywords in English
Continuous-Time Markov Decision Processes; reachability; Partial Exploration
Změněno: 16/5/2022 14:35, Mgr. Michal Petr
Abstract
V originále
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.
Links
| GA18-11193S, research and development project |
|