Computing a Hierarchical Static order for Decision Diagram-Based Representation from P/T Nets - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue LNCS Transactions on Petri Nets and Other Models of Concurrency Année : 2012

Computing a Hierarchical Static order for Decision Diagram-Based Representation from P/T Nets

Silien Hong
  • Fonction : Auteur
Fabrice Kordon
Emmanuel Paviot-Adet
  • Fonction : Auteur
  • PersonId : 971651
Sami Evangelista
  • Fonction : Auteur

Résumé

State space generation suffers from the typical combinatorial explosion problem when dealing with industrial specifications. In particular, memory consumption while storing the state space must be tackled to verify safety properties. Decision Diagrams are a way to tackle this problem. However, their performance strongly rely on the way variables encode a system. Another way to fight combinatorial explosion is to hierarchically encode the state space of a system. This paper presents how we mix the two techniques via the hierarchization of a precomputed variable order. This way we obtain a hierarchical static order for the variables encoding a system. This heuristic was implemented and exhibits good performance.
Fichier non déposé

Dates et versions

hal-01270052 , version 1 (05-02-2016)

Identifiants

Citer

Silien Hong, Fabrice Kordon, Emmanuel Paviot-Adet, Sami Evangelista. Computing a Hierarchical Static order for Decision Diagram-Based Representation from P/T Nets. LNCS Transactions on Petri Nets and Other Models of Concurrency, 2012, Lecture Notes in Computer Science, 6900 (V), pp.121-140. ⟨10.1007/978-3-642-29072-5_5⟩. ⟨hal-01270052⟩
46 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More