Strict Divergence for Probabilistic Timed Automata
CONCUR 2009 Proceedings of the 20th International Conference on Concurrency Theory
LTL Model Checking of Time-Inhomogeneous Markov Chains
ATVA '09 Proceedings of the 7th International Symposium on Automated Technology for Verification and Analysis
Stochastic real-time games with qualitative timed automata objectives
CONCUR'10 Proceedings of the 21st international conference on Concurrency theory
Model checking Markov chains using Krylov subspace methods: an experience report
EPEW'10 Proceedings of the 7th European performance engineering conference on Computer performance engineering
Measuring performance of continuous-time stochastic processes using timed automata
Proceedings of the 14th international conference on Hybrid systems: computation and control
Efficient CTMC model checking of linear real-time objectives
TACAS'11/ETAPS'11 Proceedings of the 17th international conference on Tools and algorithms for the construction and analysis of systems: part of the joint European conferences on theory and practice of software
Automata-based CSL model checking
ICALP'11 Proceedings of the 38th international conference on Automata, languages and programming - Volume Part II
Time-bounded verification of CTMCs against real-time specifications
FORMATS'11 Proceedings of the 9th international conference on Formal modeling and analysis of timed systems
Observing continuous-time MDPs by 1-clock timed automata
RP'11 Proceedings of the 5th international conference on Reachability problems
HASL: an expressive language for statistical verification of stochastic models
Proceedings of the 5th International ICST Conference on Performance Evaluation Methodologies and Tools
Verification of linear duration properties over continuous-time markov chains
Proceedings of the 15th ACM international conference on Hybrid Systems: Computation and Control
Weighted lumpability on markov chains
PSI'11 Proceedings of the 8th international conference on Perspectives of System Informatics
Expressive statistical model checking of genetic networks with delayed stochastic dynamics
CMSB'12 Proceedings of the 10th international conference on Computational Methods in Systems Biology
Proceedings of the 2013 ACM SIGSIM conference on Principles of advanced discrete simulation
Expressing and computing passage time measures of GSPN models with HASL
PETRI NETS'13 Proceedings of the 34th international conference on Application and Theory of Petri Nets and Concurrency
Verification of linear duration properties over continuous-time markov chains
ACM Transactions on Computational Logic (TOCL)
| Hi-index | 0.00 |
We 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.