24 search results - page 1 / 5 » Simulation-Based CTMC Model Checking: An Empirical Evaluatio... |
QEST
2009
IEEE
13 years 11 months ago
2009
IEEE
This paper provides an experimental study of the efficiency of simulation-based model-checking algorithms for continuous-time Markov chains by comparing: MRMC – the only tool t...
SBMF
2010
Springer
12 years 11 months ago
2010
Springer
ProB is a model checker for high-level formalisms such as B, Event-B, CSP and Z. ProB uses a mixed depth-first/breadth-first search strategy, and in previous work we have argued th...
SPIN
2010
Springer
13 years 3 months ago
2010
Springer
Abstract. Context-Bounded Analysis has emerged as a practical automatic formal analysis technique for fine-grained, shared-memory concurrent software. Two recent papers (in CAV 20...
ICSE
2010
IEEE-ACM
13 years 9 months ago
2010
IEEE-ACM
Though verification tools are finding industrial use, the utility of engineering optimizations that make them scalable and usable is not widely known. Despite the fact that seve...
QEST
2006
IEEE
13 years 10 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...