Saturation-based symbolic reachability analysis using conjunctive and disjunctive partitioning

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

Volumn 3725 LNCS, Issue , 2005, Pages 146-161

  Ciardo, Gianfranco ^a   Yu, Andy Jinqing ^a  

^a University of California Riverside   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DISJUNCTIVE PARTITIONING; IMAGE COMPUTATION; SYMBOLIC REACHABILITY ANALYSIS;

CODES (SYMBOLS); COMPUTATIONAL METHODS; CONCURRENCY CONTROL; IMAGE PROCESSING; MATHEMATICAL MODELS; STORAGE ALLOCATION (COMPUTER);

ALGORITHMS;

EID: 33646392714     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11560548_13     Document Type: Conference Paper

References (26)

1. P. A. Abdulla, P. Bjesse, and N. Eén. Symbolic reachability analysis based on SAT-solvers. TACAS, LNCS 1785, pp.411-425, 2000.
2. S.Barner and I.Rabinovitz. Efficient symbolic model checking of software using partial disjunctive partitioning. CHARME, LNCS 2860, pp.35-50, 2003.
3. R.Bloem, K.Ravi, and F.Somenzi. Symbolic guided search for CTL model checking. DAC, pp.29-34, 2000.
4. R.E. Bryant. Graph-based algorithms for boolean function manipulation. IEEE Trans. Comp., 35(8):677-691, 1986.
5. G.Ciardo, R.L. Jones, A.S. Miner, and R.Siminiceanu. Logical and stochastic modeling with SMART. Tools, LNCS 2794, pp.78-97, 2003.
6. G.Ciardo, G.Luettgen, and R.Siminiceanu. Saturation: An efficient iteration strategy for symbolic state space generation. TACAS, LNCS 2031, pp.328-342, 2001.
7. G.Ciardo, R.Marmorstein, and R.Siminiceanu. Saturation unbound. TACAS, LNCS 2619, pp.379-393, 2003.
8. G.Ciardo and A.S. Miner. A data structure for the efficient Kronecker solution of GSPNs. PNPM, pp.22-31, 1999.
9. A.Cimatti, E.Clarke, F.Giunchiglia, and M.Roveri. NuSMV: A new symbolic model verifier. CAV, LNCS 1633, pp.495-499, 1999.
10. E.M. Clarke, O.Grumberg, and D.A. Peled. Model Checking. MIT Press, 1999.
11. S.Derisavi, P.Kemper, and W.H. Sanders. Symbolic state-space exploration and numerical analysis of state-sharing composed models. NSMC, 167-189, 2003.
12. D.Dolev, M.Klawe, and M.Rodeh. An O(nlogn) unidirectional distributed algorithm for extrema finding in a circle. J. of Algorithms, 3(3):245-260, 1982.
13. S.Graf, B.Steffen, and G.Lüttgen. Compositional minimisation of finite state systems using interface specifications. Formal Asp. of Comp., 8(5):607-616, 1996.
14. G.J. Holzmann. The SPIN Model Checker. Addison-Wesley, 2003.
15. H.Jin, A.Kuehlmann, and F.Somenzi. Fine-grain conjunction scheduling for symbolic reachability analysis. TACAS, LNCS 2280, pp.312-326, 2002.
16. J.R. Burch, E.M. Clarke, and D.E. Long. Symbolic model checking with partitioned transition relations. VLSI, 49-58, 1991. IFIP.
17. K. L. McMillan. Symbolic Model Checking. Kluwer, 1993.
18. T.Kam, T.Villa, R.Brayton, and A.Sangiovanni-Vincentelli. Multi-valued decision diagrams: theory and applications. Multiple-Valued Logic, 4(1-2):9-62, 1998.
19. S.Kimura and E.M. Clarke. A parallel algorithm for constructing binary decision diagrams. ICCD, pp.220-223, 1990.
20. A.S. Miner. Saturation for a general class of models. QEST, pp.282-291, 2004.
21. I.-H. Moon, G.D. Hachtel, and F.Somenzi. Border-block triangular form and conjunction schedule in image computation. FMCAD, LNCS 1954, pp.73-90, 2000.
22. I.-H. Moon, J.H. Kukula, K.Ravi, and F.Somenzi. To split or to conjoin: the question in image computation. DAC, pp.23-28, 2000.
23. A.Narayan, A.J. Isles, J.Jain, R.K. Brayton, and A.Sangiovanni- Vincentelli. Reachability analysis using partitioned-ROBDDs. ICCAD, pp.388-393, 1997.
24. E.Pastor, O.Roig, J.Cortadella, and R.Badia. Petri net analysis using boolean manipulation. ATPN, LNCS 815, pp.416-435, 1994.
25. B.Plateau. On the stochastic structure of parallelism and synchronisation models for distributed algorithms. SIGMETRICS, pp.147-153, 1985.
26. M.Solé and E.Pastor. Traversal techniques for concurrent systems. FMCAD, LNCS 2517, pp.220-237, 2002.