List of model checking tools

This article lists model checking tools classified by some interesting properties. Some articles about: history^[1] and introduction^[2] to Model Checking. There are some books^[3] that deal with model checking techniques.

Comparison of some model checking tools

Modelling languages

• AltaRica: a language designed to model both functional and dysfunctional behaviours of critical systems.
• Cadence SMV: Cadence SMV Input Language; synchronous modeling language that has features supporting SMV's style of compositional refinement verification and abstract interpretation.
• CCS: Calculus of communicating systems; process calculus introduced by Robin Milner around 1980 and the title of a book describing the calculus.
• CCSP: A process calculus obtained from CCS by incorporating some operators of CSP. It is defined by Olderog^[4] and by van Glabbeek/Vaandrager.^[5]
• CSP: Communicating sequential processes; formal language for describing patterns of interaction in concurrent systems. FDR2 is a refinement checking tool for CSP, comparing two models for compatibility.
• DVE input language: a system is described as Network of Extended Finite State Machines communicating via shared variables and unbuffered channels. Does not contain support for buffered channels and for checking the type of message to be received without performing the receive proper.
• FC2: Machine-level ASCII representation for synchronized (hierarchical) networks of automata. Defined by the Esprit Basic Research Action CONCUR, 1992. Used as an input and exchange format by a number of verification tools, mainly in the area of process algebras.
• FSP: Finite State Processes.
• Java: Object-oriented programming language.
• LOTOS: Language Of Temporal Ordering Specification (ISO standard 8807); formal specification language based on temporal ordering used for protocol specification in ISO OSI standards.
• PEPA: Performance Evaluation Process Algebra; it is a stochastic process algebra designed for modelling computer and communication systems.
• Plain MC: these are simple text-file formats used in MRMC and PRISM.
• PRISM language: PRISM model description language.
• Promela: Process or Protocol Meta Language; it is a verification modeling language. The language allows for the dynamic creation of concurrent processes to model, for example, distributed systems.
• Reactive modules: a component-based modeling language for synchronous and asynchronous hardware and software systems
• REDLIB: Timed CTL.
• Simulink/Stateflow: an interactive design and simulation tool for event-driven systems.
• SCCS: synchronous calculus of communicating systems.
• SMV: SMV input language.
• TCCS: Timed CCS.
• Verilog: a hardware description language (HDL) used to model electronic systems.
• VHDL: commonly used as a design-entry language for field-programmable gate arrays and application-specific integrated circuits in electronic design automation of digital circuits.

Properties language

• AFMC: Alternation Free Modal mu-Calculus.
• Assertions: Imperative assertion statements.
• CSL: Continuous Stochastic Logic, characterizes bisimulation of continuous-time Markov processes.
• CSRL: Continuous Stochastic Reward Logic; a logic to specify measures over CTMCs extended with a reward structure (so-called Markov reward models).
• CTL: Computation Tree Logic; a branching-time logic, meaning that its model of time is a tree-like structure in which the future is not determined; there are different paths in the future, any one of which might be an actual path that is realized.
• GCTL: Generalized Computation Tree Logic, it's both state based and action based.
• LTL: Linear temporal logic; a modal temporal logic with modalities referring to time.
• Monitor automata: ???.
• mCRL2 mu-calculus: Kozen's propositional modal mu-calculus (excluding atomic propositions), extended with: - data-depended processes - quantification over data types - multi actions - time - regular formulas.
• mu-calculus: temporal logics with a least fix-point operator μ.
• PCTL: Probabilistic CTL; an extension of CTL which allows for probabilistic quantification of described properties.
• PLTL: Probabilistic Linear Temporal Logic.
• PRCTL: Probabilistic Reward Computation Tree Logic; it extends PCTL with reward-bounded properties.

Abbreviations

Equivalences:

• SB: Strong Bisimulation
• WB: Weak Bisimulation
• BB: Branching Bisimulation
• STE: Strong Trace Equivalence
• WTE: Weak Trace Equivalence
• me: May Equivalence
• ME: Must Equivalence
• OE: Observational Equivalence
• SE: Safety Equivalence
• t*E: tau*.a Equivalence

Software license:

• FUSC: Free Under Specific Condition

References

External links

• Tools: a database for verification tools