Hierarchical Set Decision Diagrams and Regular Models
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) .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.
KeywordsTransition Relation Transitive Closure Label Transition System Binary Decision Diagram Homomorphism Encode
- 10.Donatelli, S., Franceschinis, G.: The PSR Methodology: Integrating Hardware and Software Models. In: Proceedings of the 17th International Conference on Application and Theory of Petri Nets, London, UK, pp. 133–152. Springer, London (1996)Google Scholar
- 12.Wang, F.: Formal verification of timed systems: A survey and perspective. IEEE 92(8) (August 2004)Google Scholar