8 search results - page 2 / 2 » Time-bounded model checking of infinite-state continuous-tim... |
TGC
2010
Springer
13 years 2 months ago
2010
Springer
Abstract. We present a tool developed for fostering probabilistic model checking of services formally specified in Scows, a stochastic enrichment of the Calculus for Orchestration ...
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...
CORR
2010
Springer
13 years 4 months ago
2010
Springer
The success of probabilistic model checking for discrete-time Markov decision processes and continuous-time Markov chains has led to rich academic and industrial applications. The ...