Hierarchical set decision diagrams and automatic saturation

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5062 LNCS, Issue , 2008, Pages 211-230

  Hamez, Alexandre ^a,b   Thierry Mieg, Yann ^a   Kordon, Fabrice ^a  

^a SORBONNE UNIVERSITÉ   (France)

^b EPITA RESEARCH AND DEVELOPMENT LABORATORY LRDE   (France)

Author keywords

Hierarchical Decision Diagrams; Model Checking; Saturation

Indexed keywords

CHLORINE COMPOUNDS; DECISION THEORY; FILE ORGANIZATION; GRAPH THEORY; GRAPHIC METHODS; KNOWLEDGE BASED SYSTEMS; MARINE BIOLOGY; METAL DETECTORS; MODEL CHECKING; MODEL STRUCTURES; PETRI NETS; SET THEORY; SPECIFICATIONS; STATE SPACE METHODS;

DECISION DIAGRAMS; DEEP KNOWLEDGE; EFFICIENT SOLUTIONS; EXTENDED PETRI NETS; HIERARCHICAL DECISION DIAGRAMS; INTERMEDIATE STRUCTURES; INTERNATIONAL CONFERENCES; LARGE SYSTEMS; LOGARITHMIC COMPLEXITY; PEAK EFFECTS; RUN-TIME; SATURATION; SATURATION EFFECTS; SATURATION METHOD; STATE SPACES; TRANSITION RELATIONS; USER INPUT;

DATA STRUCTURES;

EID: 48249086867     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-68746-7_16     Document Type: Conference Paper

References (16)

1. Bryant, R.: Graph-based algorithms for boolean function manipulation. IEEE Transactions on Computers 35(8), 677-691 (1986)
2. 20 states and beyond. (Special issue for best papers from LICS90) Information and Computation 98(2), 153-181 (1992)
3. Bollig, B., Wegener, I.: Improving the Variable Ordering of OBDDs Is NP-Complete. IEEE Trans. Comput. 45(9), 993-1002 (1996)
4. Roig, O., Cortadella, J., Pastor, E.: Verification of asynchronous circuits by BDD-based model checking of Petri nets. In: DeMichelis, G., Díaz, M. (eds.) ICATPN 1995. LNCS, vol. 935, pp. 374-391. Springer, Heidelberg (1995)
5. Ciardo, G., Marmorstein, R., Siminiceanu, R.: Saturation unbound. In: Garavel, H., Hatcliff, J. (eds.) TACAS 2003. LNCS, vol. 2619, pp. 379-393. Springer, Heidelberg (2003)
6. Holzmann, G., Smith, M.: A practical method for verifying event-driven software. In: ICSE 1999: Proceedings of the 21st international conference on Software engineering, Los Alamitos, CA, USA, pp. 597-607. IEEE Computer Society Press, Los Alamitos (1999)
7. LIP6/Move: the libDDD environment (2007), http://www.lip6.fr/libddd
8. Couvreur, J.M., Encrenaz, E., Paviot-Adet, E., Poitrenaud, D., Wacrenier, P.A.: Data Decision Diagrams for Petri Net Analysis. In: Esparza, J., Lakos, C.A. (eds.) ICATPN 2002. LNCS, vol. 2360, pp. 1-101. Springer, Heidelberg (2002)
9. Couvreur, J.M., Thierry-Mieg, Y.: Hierarchical Decision Diagrams to Exploit Model Structure. In: Wang, F. (ed.) FORTE 2005. LNCS, vol. 3731, pp. 443-457. Springer, Heidelberg (2005)
10. Wang, F.: Formal verification of timed systems: A survey and perspective. IEEE 92(8) (2004)
11. Ciardo, G., Siminiceanu, R.: Using edge-valued decision diagrams for symbolic generation of shortest paths. In: Aagaard, M.D., O'Leary, J.W. (eds.) FMCAD 2002. LNCS, vol. 2517, pp. 256-273. Springer, Heidelberg (2002)
12. Somenzi, F.: CUDD: CU Decision Diagram Package (release 2.4.1) (2005), http://vlsi.colorado.edu/fabio/CUDD/cuddIntro.html
13. Lind-Nielsen, J., Mishchenko, A., Behrmann, G., Hulgaard, H., Andersen, H.R., Lichtenberg, J., Larsen, K., Soranzo, N., Bjorner, N., Duret-Lutz, A., Cohen, H.a.: buddy - library for binary decision diagrams (release 2.4) (2004), http://buddy.wiki.sourceforge.net/
14. Ciardo, G.: Reachability Set Generation for Petri Nets: Can Brute Force Be Smart? Applications and Theory of Petri Nets 2004, pp. 17-34 (2004)
15. Cabac, L., Duvigneau, M., Moldt, D., Rölke, H.: Modeling Dynamic Architectures Using Nets-within-Nets. In: Ciardo, G., Darondeau, P. (eds.) ICATPN 2005. LNCS, vol. 3536, pp. 148-167. Springer, Heidelberg (2005)
16. Biberstein, O., Buchs, D., Guelfi, N.: Object-oriented nets with algebraic specifications: The CO-OPN/2 formalism (2001)