Anzeige
Erschienen in:
2011 | OriginalPaper | Buchkapitel
Observing Continuous-Time MDPs by 1-Clock Timed Automata
verfasst von : Taolue Chen, Tingting Han, Joost-Pieter Katoen, Alexandru Mereacre
Erschienen in: Reachability Problems
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
This paper considers the verification of continuous-time Markov decision process (CTMDP s) against single-clock deterministic timed automata (DTA) specifications. The central issue is to compute the maximum probability of the set of timed paths of a CTMDP
$\mathcal{C}$
that are accepted by a DTA
$\mathcal{A}$
. We show that this problem can be reduced to a linear programming problem whose coefficients are maximum timed reachability probabilities in a set of CTMDPs, which are obtained via a graph decomposition of the product of the CTMDP
$\mathcal{C}$
and the region graph of the DTA
$\mathcal{A}$
.