 |
|
Chen, Taolue and Han, Tingting and Katoen, J.P. and Mereacre, A.
(2009)
Quantitative model checking of continuous-time Markov chains against timed automata specifications.
In: 2009 24th Annual IEEE Symposium on Logic In Computer Science, 11-14 Aug 2009, Los Angeles.
.
IEEE Computer Society.
ISSN 1043-6871
ISBN 978-0-7695-3746-7
Full text available as: Official URL: http://dx.doi.org/10.1109/LICS.2009.21  AbstractWe study the following problem: given a continuous-time Markov chain (CTMC) C, and a linear real-time property
provided as a deterministic timed automaton (DTA) A,
what is the probability of the set of paths of C that are
accepted by A (C satisfies A)? It is shown that this set of paths is measurable and computing its probability can be reduced to computing the reachability probability in a
piecewise deterministic Markov process (PDP). The reachability probability is characterized as the least solution of a system of integral equations and is shown to be approximated by solving a system of partial differential equations. For the special case of single-clock DTA, the system of integral equations can be transformed into a system of linear equations where the coefficients are solutions of ordinary differential equations. | Item Type: | Conference or Workshop Paper (Full Paper, Talk) |
|---|
| Research Group: | EWI-FMT: Formal Methods and Tools, EWI-DACS: Design and Analysis of Communication Systems |
|---|
| Research Program: | CTIT-DSN: Dependable Systems and Networks |
|---|
| Research Project: | QUPES: Verifying Quantitative Properties of Embedded Software |
|---|
| ID Code: | 16106 |
|---|
| Status: | Published |
|---|
| Deposited On: | 27 October 2009 |
|---|
| Refereed: | Yes |
|---|
| International: | Yes |
|---|
| More Information: | statisticsmetis |
|---|
Export this item as: To correct this item please ask your editor Repository Staff Only: edit this item
|
|
|
Nederlands
Contact
Sitemap
Search
Organisation