The Model-Checking Kit


Entry last updated: 2003/5/2
Entry last validated: 2004/5/18

Tool homepage:

Tool availability: Free of charge

Tool Features

Petri Nets Supported (see also help on terminology) Components (see also help on terminology)


Tool Description

The Model-Checking Kit is a collection of programs which allow to model a finite-state system using a variety of modelling languages, and verify it using a variety of checkers, including deadlock-checkers, reachability-checkers, and model-checkers for the temporal logics CTL and LTL. The checkers are taken from different existing tools like PROD, SMV, or PEP. They use state-of-the-art techniques to avoid the state explosion problem, such as symbolic model checking (BDDs) and partial orders. The modelling languages include among others the low level language of PEP, because some tools can export models to this language, B(PN)2, a structured parallel programming language and CFA, a language for the description of communicating finite automata.

The most interesting feature of the Kit is that independently of the description language chosen by the user all checkers can be applied to the same model. It is not necessary to model the system in different modelling languages.

Contact Information

Prof. Dr. Javier Esparza
Universit„t Stuttgart
Institut f’r Formale Methoden der Informatik
Abteilung Sichere und Zuverl„ssige Softwaresysteme
Universit„tsstr. 38
D-70569 Stuttgart

Phone:  +49 711 7816-455

Other Remarks

[PN Home][*]
The maintainers of this page