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
What's decidable about hybrid automata?
Journal of Computer and System Sciences
Model-Checking for Probabilistic Real-Time Systems (Extended Abstract)
ICALP '91 Proceedings of the 18th International Colloquium on Automata, Languages and Programming
Model Checking of Probabalistic and Nondeterministic Systems
Proceedings of the 15th Conference on Foundations of Software Technology and Theoretical Computer Science
HART '97 Proceedings of the International Workshop on Hybrid and Real-Time Systems
Kronos: A Model-Checking Tool for Real-Time Systems
CAV '98 Proceedings of the 10th International Conference on Computer Aided Verification
Lectures on Embedded Systems, European Educational Forum, School on Embedded Systems
Model checking for a probabilistic branching time logic with fairness
Distributed Computing
Reduction and Refinement Strategies for Probabilistic Analysis
PAPM-PROBMIV '02 Proceedings of the Second Joint International Workshop on Process Algebra and Probabilistic Methods, Performance Modeling and Verification
Reduction and Refinement Strategies for Probabilistic Analysis
PAPM-PROBMIV '02 Proceedings of the Second Joint International Workshop on Process Algebra and Probabilistic Methods, Performance Modeling and Verification
Automata-Theoretic performance analysis method of soft real-time systems
EUC'05 Proceedings of the 2005 international conference on Embedded and Ubiquitous Computing
Improved probabilistic models for 802.11 protocol verification
CAV'05 Proceedings of the 17th international conference on Computer Aided Verification
Measurable stochastics for Brane Calculus
Theoretical Computer Science
A survey on temporal logics for specifying and verifying real-time systems
Frontiers of Computer Science: Selected Publications from Chinese Universities
| Hi-index | 0.00 |
We consider the timed automata model of [3], which allows the analysis of real-time systems expressed in terms of quantitative timing constraints. Traditional approaches to real-time system description express the model purely in terms of nondeterminism; however, we may wish to express the likelihood of the system making certain transitions. In this paper, we present a model for real-time systems augmented with discrete probability distributions. Furthermore, using the algorithm of [5] with fairness, we develop a model checking method for such models against temporal logic properties which can refer both to timing properties and probabilities, such as, "with probability 0.6 or greater, the clock x remains below 5 until clock y exceeds 2".