Hierarchical Set Decision Diagrams and Regular Models - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2009

Hierarchical Set Decision Diagrams and Regular Models

Yann Thierry-Mieg
Denis Poitrenaud
  • Fonction : Auteur
  • PersonId : 968343
Alexandre Hamez
  • Fonction : Auteur
  • PersonId : 980314
Fabrice Kordon

Résumé

This paper presents algorithms and data structures that exploit a compositional and hierarchical specification to enable more efficient symbolic model-checking. We encode the state space and transition relation using hierarchical Set Decision Diagrams (SDD) [9].In SDD, arcs of the structure are labeled with sets, themselves stored as SDD. To exploit the hierarchy of SDD, a structured model representation is needed. We thus introduce a formalism integrating a simple notion of type and instance. Complex composite behaviors are obtained using a synchronization mechanism borrowed from process calculi. Using this relatively general framework, we investigate how to capture similarities in regular and concurrent models. Experimental results are presented, showing that this approach can outperform in time and memory previous work in this area.

Dates et versions

hal-01294397 , version 1 (29-03-2016)

Identifiants

Citer

Yann Thierry-Mieg, Denis Poitrenaud, Alexandre Hamez, Fabrice Kordon. Hierarchical Set Decision Diagrams and Regular Models. 15th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS), Mar 2009, York, United Kingdom. pp.1-15, ⟨10.1007/978-3-642-00768-2_1⟩. ⟨hal-01294397⟩
81 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More