OATAO - Open Archive Toulouse Archive Ouverte Open Access Week

Building Efficient Model Checkers using Hierarchical Set Decision Diagrams and Automatic Saturation

Hamez, Alexandre and Thierry-Mieg, Yann and Kordon, Fabrice Building Efficient Model Checkers using Hierarchical Set Decision Diagrams and Automatic Saturation. (2009) Fundamenta Informaticae, 94 (3-4). 413-437. ISSN 0169-2968

(Document in English)

PDF (Author's version) - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader

Official URL: http://dx.doi.org/10.3233/FI-2009-137


Shared decision diagram representations of a state-space provide efficient solutions for model-checking of large systems. However, decision diagram manipulation is tricky, as the con- struction procedure is liable to produce intractable intermediate structures (a.k.a peak effect). The definition of the so-called saturation method has empirically been shown to mostly avoid this peak effect, and allows verification of much larger systems. However, applying this algorithm currently requires deep knowledge of the decision diagram data structures. Hierarchical Set Decision Diagrams (SDD) are decision diagrams in which arcs of the structure are labeled with sets, themselves stored as SDD. This data structure offers an elegant and very efficient way of encoding structured specifications using decision diagram technology. It also offers, through the concept of inductive homomorphisms, flexibility to a user defining a symbolic transition relation. We show in this paper how, with very limited user input, the SDD library is able to optimize evaluation of a transition relation to produce a saturation effect at runtime. We build as an example an SDD model-checker for a compositional formalism: Instantiable Petri Nets (IPN). IPN define a type as an abstract contract. Labeled P/T nets are used as an elementary type. A composite type is defined to hierarchically contain instances (of elementary or composite type). To compose behaviors, IPN use classic label synchronization semantics from process calculi. With a particular recursive folding SDD are able to offer solutions for symmetric systems in log- arithmic complexity with respect to other DD. Even in less regular cases, the use of hierarchy in the specification is shown to be well supported by SDD. Experimentations and performances are reported on some well known examples.

Item Type:Article
Additional Information:Thanks to IOS Press editor. The definitive version is available at http://iospress.metapress.com/content/r26627r66170/?p=24b985a067e54f5e9538878930412eae&pi=0
HAL Id:hal-01121192
Audience (journal):International peer-reviewed journal
Uncontrolled Keywords:
Institution:French research institutions > Centre National de la Recherche Scientifique - CNRS (FRANCE)
Other partners > Université Pierre et Marie Curie, Paris 6 - UPMC (FRANCE)
Other partners > Ecole pour l’informatique et les techniques avancées - EPITA (FRANCE)
Laboratory name:
Deposited On:27 Feb 2015 16:16

Repository Staff Only: item control page