PRISM vs PVS
PRISM
prismmodelchecker.orgPVS
pvs.csl.sri.comSide by side
| Figure | PRISM | PVS |
|---|---|---|
| Price from | Free | Free |
| Free plan | Yes | Yes |
| Free trial | — | — |
| Open source | — | — |
| Windows | Yes | Yes |
| macOS | Yes | Yes |
| Linux | Yes | Yes |
| Plans published | 1 | 2 |
| Spec score · Formal Verification Tools | 7.6 (#19) | 8.3 (#4) |
| Purpose | PRISM is a probabilistic model checker for formal modelling and analysis of systems with random or probabilistic behaviour. | PVS is a verification system combining a specification language, support tools, and a theorem prover. |
| Support | The project directs users to its FAQ and manual, and invites other questions, feedback, bug reports, and feature requests through its forum or GitHub issue tracker. | Support is offered through developer and bug-report email addresses, GitHub issues, Google Groups, and moderated mailing lists. |
Plans
In their own words
PRISM
PRISM is a probabilistic model checker for formal modelling and analysis of systems with random or probabilistic behaviour. It supports discrete-time and continuous-time Markov chains, Markov decision processes, probabilistic automata, probabilistic timed automata, partially observable models, and interval models; costs and rewards can extend supported models. Its property language includes PCTL, CSL, LTL, and PCTL*, with quantitative and costs/rewards extensions. Analysis options include BDD- and MTBDD-based symbolic algorithms, discrete-event simulation for approximate or statistical checking, quantitative abstraction refinement, and symmetry reduction. The tool accepts the PRISM language, PEPA, and SBML, and supports temporal-logic formalisms and counterexamples. Version 4.10.1 supports UMB import and export, POMDP import from explicit files, and optional exchange of initial state information through a .tra file. PRISM is free and open source under GNU General Public License version 2. It runs on Linux, Windows, and macOS and requires Java 11 or later; binary distributions require the Java Runtime Environment.
PVS
PVS is a mechanized environment for formal specification and verification, intended for work such as mathematical formalization and hardware or algorithm verification. Its language is based on typed higher-order logic and supports predicate subtypes, dependent types, and parameterized theories. The system combines predefined theories, a type checker, interactive theorem prover, symbolic model checker, utilities, libraries, documentation, and examples. Proof support includes induction, rewriting, simplification with decision procedures, abstraction, and symbolic model checking; command-line tools can re-prove theories and libraries in batch mode. PVS also integrates the Yices SMT solver, supports random testing during proofs, and includes PVSio for evaluation and animation. GNU or X Emacs provides the integrated interface, with Tcl/Tk displays for proof trees and theory hierarchies. It runs on Linux, macOS, and Windows and is self-hosted. Noncommercial use is listed at free. Sources are under GPL, but the Allegro runtime has a separate click-through license, and commercial users need a current PVS license or must contact SRI about licensing.