References in periodicals archive ?
For specifying properties of CTMC, we use the Continuous Stochastic Logic (CSL).
[1, 3] introduced an approach for counterexample generation for DTMC and CTMC against timed reachability proprieties using heuristics and directed explicit state space search.
The queueing model is a continuous-time Markov chain (CTMC) queue with a finite buffer.
It provides formal verification for different probabilistic models such as DTMCs, CTMCs, and MDPs, which are coded as the Prism's reactive modules, a simple state-based language.
Mrmc is another probabilistic model checking tool, which allows formal verification for DTMCs and CTMCs (as well as Continuous-Time Markov Decision Processes, a nondeterministic variant of CTMCs).
Ymer is a statistical model checking tool, used to verify transient properties of CTMCs .
For example, temporal, real-time, and probabilistic temporal logics are usually interpreted over Kripke structures, timed automata (TA) , and probabilistic models (e.g., DTMCs, CTMCs, and MDPs), respectively.
Acronyms browser ?
Full browser ?
- Ctm Access Profile