98 search results - page 4 / 20 » Quantitative Analysis With the Probabilistic Model Checker P... |
QEST
2006
IEEE
15 years 6 months ago
2006
IEEE
The time-bounded reachability problem for continuoustime Markov chains (CTMCs) amounts to determine the probability to reach a (set of) goal state(s) within a given time span, suc...
111
Voted
CSFW
2002
IEEE
15 years 5 months ago
2002
IEEE
We present a formal analysis technique for probabilistic security properties of peer-to-peer communication systems based on random message routing among members. The behavior of g...
99
Voted
QEST
2009
IEEE
15 years 7 months ago
2009
IEEE
The Markov Reward Model Checker (MRMC) is a software tool for verifying properties over probabilistic models. It supports PCTL and CSL model checking, and their reward extensions....
106
Voted
QEST
2009
IEEE
15 years 7 months ago
2009
IEEE
—We consider a distributed shuffling algorithm for sharing data in a distributed network. Nodes executing the algorithm periodically contact each other and exchange data. The be...
121
Voted
CAV
2012
Springer
13 years 3 months ago
2012
Springer
Real-life systems are usually hard to control, due to their complicated structures, quantitative time factors and even stochastic behaviors. In this work, we present a model checke...