Computing Poisson probabilities
Communications of the ACM
Model-checking continuous-time Markov chains
ACM Transactions on Computational Logic (TOCL)
Dynamic Programming and Optimal Control
Dynamic Programming and Optimal Control
On the Logical Characterisation of Performability Properties
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
Approximate Symbolic Model Checking of Continuous-Time Markov Chains
CONCUR '99 Proceedings of the 10th International Conference on Concurrency Theory
Model-Checking Algorithms for Continuous-Time Markov Chains
IEEE Transactions on Software Engineering
Theoretical Computer Science - Tools and algorithms for the construction and analysis of systems (TACAS 2004)
Compositional Performability Evaluation for STATEMATE
QEST '06 Proceedings of the 3rd international conference on the Quantitative Evaluation of Systems
Delayed Nondeterminism in Continuous-Time Markov Decision Processes
FOSSACS '09 Proceedings of the 12th International Conference on Foundations of Software Science and Computational Structures: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009
The Ins and Outs of the Probabilistic Model Checker MRMC
QEST '09 Proceedings of the 2009 Sixth International Conference on the Quantitative Evaluation of Systems
Three-valued abstraction for continuous-time Markov chains
CAV'07 Proceedings of the 19th international conference on Computer aided verification
Numerical analysis of continuous time Markov decision processes over finite horizons
Computers and Operations Research
Model checking interactive markov chains
TACAS'10 Proceedings of the 16th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Quantitative timed analysis of interactive markov chains
NFM'12 Proceedings of the 4th international conference on NASA Formal Methods
Optimal time-abstract schedulers for CTMDPs and continuous-time Markov games
Theoretical Computer Science
| Hi-index | 0.00 |
Continuous Stochastic Logic (CSL) can be interpreted over continuoustime Markov decision processes (CTMDPs) to specify quantitative properties of stochastic systems that allow some external control. Model checking CSL formulae over CTMDPs requires then the computation of optimal control strategies to prove or disprove a formula. The paper presents a conservative extension of CSL over CTMDPs--with rewards--and exploits established results for CTMDPs for model checking CSL. A new numerical approach based on uniformization is devised to compute time bounded reachability results for time dependent control strategies. Experimental evidence is given showing the efficiency of the approach.