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

Abstract : 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.
Type de document :
Article dans une revue
Transactions on Petri Nets and Other Models of Concurrency, Springer, 2012, Lecture Notes in Computer Science, 6900 (V), pp.121-140. 〈10.1007/978-3-642-29072-5_5〉
Liste complète des métadonnées

https://hal.archives-ouvertes.fr/hal-01270052
Contributeur : Lip6 Publications <>
Soumis le : vendredi 5 février 2016 - 15:48:02
Dernière modification le : mercredi 29 novembre 2017 - 16:32:17

Identifiants

Collections

Citation

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

Partager

Métriques

Consultations de la notice

51