Below is a brief summary of some other available tools
with support for probabilistic model checking,
including those that connect to or integrate PRISM.
If we have omitted your tool or the description is incorrect,
please contact us.
Probabilistic Model Checkers
Model checkers for discrete-/continuous-time Markov chains (DTMCs/CTMCs) and extensions of:
Model checkers for Markov decision processes (MDPs):
- MRMC (formerly ETMCC) -
explicit-state (and approximate) model checking for DTMCs, CTMCs and CTMDPs (with rewards) against PC(R)TL and CS(R)L.
Also support for bisimulation.
- The PEPA Eclipse Plug-in project -
CSL model checking (plus steady-state/ODE analysis and abstraction techniques) for
the stochastic process algebra PEPA.
- PARAM -
parametric probabilistic model checking of DTMCs.
- INFAMY -
model checking of infinite-state CTMCs.
- CASPA -
symbolic (MTBDD-based) model checking of (extended) stochastic labelled transition systems against Stochastic Propositional Dynamic Logic (SPDL).
Model checkers for probabilistic timed automata (PTAs):
- LiQuor -
explicit-state model checking of MDPs, expressed in Probmela (a probabilistic extension of SPIN's Promela language), against LTL.
- ProbDiVinE -
parallel and/or distributed LTL model checking of MDPs.
- PASS -
abstraction refinement of probabilistic models.
- RAPTURE -
implementation of the MDP-based abstraction-refinement technique described in [DJJL01].
Approximate (statistical) probabilistic model checkers:
- mcpta -
supports a subset of the modelling language Modest via translation to PRISM.
- Fortuna -
computes maximum probabilistic reachability properties for PTAs
and reward-bounds properties for (linearly) priced PTAs.
- UPPAAL-PRO -
computes maximum probabilistic reachability properties for PTAs.
- APMC -
distributed approximate model checking for DTMCs and CTMCs.
- Ymer (formerly ProVer) -
approximate probabilistic model checking of generalized semi-Markov processes (GSMPs) and CTMCs
against transient properties expressed in CSL.
- VESTA -
approximate model checking of PCTL/CSL (and more) for probabilistic systems.
- PRISM-U2B -
extension of PRISM for approximate model checking of unbounded properties.
- COSMOS -
statistical model checking for HASL (Hybrid Automata Stochastic Logic) on discrete event stochastic processes (DESPs).
- PLASMA -
is a statistical model checking platform for a range of stochastic models.
Tools Connecting to or Integrating PRISM
- Infobiotics Workbench -
tool for computational systems and synthetic biology. Integrates PRISM.
- kamiframework -
run-time modelling and anlaysis of software designs. Integrates PRISM.
- Snoopy -
Petri net-based tool for analysis of biomolecular networks. Exports to PRISM.
- Henshin Statespace Explorer -
part of the Eclipse Modeling Framework Project.
- PSPWizard -
generates temporal logic properties from patterns for several tools, including PRISM.
See also the connections listed here.
Other related tools
- APNN-Toolbox -
a Petri Net tool-set, that includes support for CTMCs and CSL model checking.
- CADP -
"Construction and Analysis of Distributed Processes" toolset, with some support for probabilistic models.
analysis of Generalised Stochastic Petri Nets (GSPNs) and extensions.
- GRIP -
language-level symmetry reduction for PRISM models.
- ipc/DNAmaca -
tool extending PEPA's modelling capability with additional performability measures.
- Marcie -
tool for analyis of Generalised Stochastic Petri Nets (GSPNs) with extended arcs.
- Möbius -
multi-formalism modelling and analysis toolset for stochastic systems.
- MOTOR -
tool environment for the MODEST language.
- SMART -
explicit-state/symbolic numerical solution (and CTL model checking) of Markov chains.
- COMICS -
model checking and generation of counterexamples for DTMCs.
- DiPro -
a directed probabilistic counterexample generation tool.
- PAT -
a model checking framework which includes support for probabilistic models.