Model-checking for probabilistic real-time systems (extended abstract)
Proceedings of the 18th international colloquium on Automata, languages and programming
Model-checking in dense real-time
Information and Computation - Special issue: selections from 1990 IEEE symposium on logic in computer science
Theoretical Computer Science
Symbolic model checking for real-time systems
Information and Computation
Model checking
Automatic verification of real-time systems with discrete probability distributions
Theoretical Computer Science
Alternating-time temporal logic
Journal of the ACM (JACM)
On probabilistic timed automata
Theoretical Computer Science
Model Checking of Probabalistic and Nondeterministic Systems
Proceedings of the 15th Conference on Foundations of Software Technology and Theoretical Computer Science
Model-Checking Algorithms for Continuous-Time Markov Chains
IEEE Transactions on Software Engineering
Model checking for a probabilistic branching time logic with fairness
Distributed Computing
Checking Timed Büchi Automata Emptiness Efficiently
Formal Methods in System Design
Performance analysis of probabilistic timed automata using digital clocks
Formal Methods in System Design
State explosion in almost-sure probabilistic reachability
Information Processing Letters
Symbolic model checking for probabilistic timed automata
Information and Computation
Trading Infinite Memory for Uniform Randomness in Timed Games
HSCC '08 Proceedings of the 11th international workshop on Hybrid Systems: Computation and Control
Hintikka Games for PCTL on Labeled Markov Chains
QEST '08 Proceedings of the 2008 Fifth International Conference on Quantitative Evaluation of Systems
Model Checking Timed and Stochastic Properties with CSL^{TA}
IEEE Transactions on Software Engineering
Quantitative Model Checking of Continuous-Time Markov Chains Against Timed Automata Specifications
LICS '09 Proceedings of the 2009 24th Annual IEEE Symposium on Logic In Computer Science
Combined model checking for temporal, probabilistic, and real-time logics
Theoretical Computer Science
Model checking for probabilistic timed automata
Formal Methods in System Design
| Hi-index | 0.00 |
Probabilistic timed automata are an extension of timed automata with discrete probability distributions. In previous work, a probabilistic notion of time divergence for probabilistic timed automata has been considered, which requires the divergence of time with probability 1. We show that this notion can lead to cases in which the probabilistic timed automaton satisfies a correctness requirement by making an infinite number of probabilistic transitions in a finite amount of time. To avoid such cases, we consider strict time divergence which concerns the divergence of time over all paths, rather than time divergence of paths with probability 1. We present new model-checking algorithms for probabilistic timed automata both for probabilistic and strict divergence. The algorithms have the same complexity as the previous model-checking algorithms for probabilistic timed automata.