Graph-Based Algorithms for Boolean Function Manipulation
IEEE Transactions on Computers
Efficient implementation of a BDD package
DAC '90 Proceedings of the 27th ACM/IEEE Design Automation Conference
A decomposition approach for stochastic reward net models
Performance Evaluation
Improving the Variable Ordering of OBDDs Is NP-Complete
IEEE Transactions on Computers
Symbolic model checking of process networks using interval diagram techniques
Proceedings of the 1998 IEEE/ACM international conference on Computer-aided design
How to calculate symmetries of Petri nets
Acta Informatica
Algebric Decision Diagrams and Their Applications
Formal Methods in System Design
Stochastic Well-Formed Colored Nets and Symmetric Modeling Applications
IEEE Transactions on Computers
Saturation: An Efficient Iteration Strategy for Symbolic State-Space Generation
TACAS 2001 Proceedings of the 7th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
NUSMV: A New Symbolic Model Verifier
CAV '99 Proceedings of the 11th International Conference on Computer Aided Verification
Efficient Reachability Set Generation and Storage Using Decision Diagrams
Proceedings of the 20th International Conference on Application and Theory of Petri Nets
VIS: A System for Verification and Synthesis
CAV '96 Proceedings of the 8th International Conference on Computer Aided Verification
FORCE: a fast and easy-to-implement variable-ordering heuristic
Proceedings of the 13th ACM Great Lakes symposium on VLSI
SMART: Simulation and Markovian Analyzer for Reliability and Timing
IPDS '96 Proceedings of the 2nd International Computer Performance and Dependability Symposium (IPDS '96)
Exploiting interleaving semantics in symbolic state-space generation
Formal Methods in System Design
Hierarchical Set Decision Diagrams and Regular Models
TACAS '09 Proceedings of the 15th International Conference on Tools and Algorithms for the Construction and Analysis of Systems: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009,
DSSZ-MC --- A Tool for Symbolic Analysis of Extended Petri Nets
PETRI NETS '09 Proceedings of the 30th International Conference on Applications and Theory of Petri Nets
Building Efficient Model Checkers using Hierarchical Set Decision Diagrams and Automatic Saturation
Fundamenta Informaticae - Petri Nets 2008
On the Formal Verification of Middleware Behavioral Properties
Electronic Notes in Theoretical Computer Science (ENTCS)
Petri nets for systems and synthetic biology
SFM'08 Proceedings of the Formal methods for the design of computer, communication, and software systems 8th international conference on Formal methods for computational systems biology
polyDD: Towards a Framework Generalizing Decision Diagrams
ACSD '10 Proceedings of the 2010 10th International Conference on Application of Concurrency to System Design
Optimized colored nets unfolding
FORTE'06 Proceedings of the 26th IFIP WG 6.1 international conference on Formal Techniques for Networked and Distributed Systems
Hierarchical decision diagrams to exploit model structure
FORTE'05 Proceedings of the 25th IFIP WG 6.1 international conference on Formal Techniques for Networked and Distributed Systems
The NEO protocol for large-scale distributed database systems: modelling and initial verification
PETRI NETS'10 Proceedings of the 31st international conference on Applications and Theory of Petri Nets
High-Level Petri Net Model Checking with AlPiNA
Fundamenta Informaticae - Applications and Theory of Petri Nets and Other Models of Concurrency, 2010
Extreme symmetries in complex distributed systems: the bag-oriented approach
Proceedings of the 17th Monterey conference on Large-Scale Complex IT Systems: development, operation and management
| Hi-index | 0.00 |
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.