A fine-grained fullness-guided chaining heuristic for symbolic reachability analysis

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

Volumn 4218 LNCS, Issue , 2006, Pages 51-66

  Chung, Ming Ying ^a   Ciardo, Gianfranco ^a   Yu, Andy Jinqing ^a  

^a University of California Riverside   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CONVERGENCE OF NUMERICAL METHODS; DECISION THEORY; ITERATIVE METHODS; PETRI NETS; STATE SPACE METHODS;

ASYNCHRONOUS SYSTEMS; STATE-SPACE GENERATION; SYMBOLIC REACHABILITY ANALYSIS;

HEURISTIC METHODS;

EID: 33845208496     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11901914_7     Document Type: Conference Paper

References (26)

1. R. E. Bryant. Graph-based algorithms for boolean function manipulation. IEEE Trans. Comp., 35(8):677-691, Aug. 1986.
2. J. R. Burch, E. M. Clarke, and D. E. Long. Symbolic model checking with partitioned transition relations. Proc. Int. Conference on Very Large Scale Integration, pages 49-58, Aug. 1991. IFIP Transactions, North-Holland.
3. G. Ciardo, R. L. Jones, A. S. Miner, and R. Siminiceanu. Logical and stochastic modeling with SMART. Perf. Eval., 63:578-608, 2006.
4. G. Ciardo and Y. Lan. Faster discrete-event simulation through structural caching. Proc. PMCCS, pages 11-14, Sept. 2003.
5. G. Ciardo, Lüttgen, Gerald and G. Ciardo, G. Lüttgen, and R. Siminiceanu. Efficient symbolic state-space construction for asynchronous systems. Proc. ICATPN, LNCS 1825, pages 103-122, Jun. 2000. springer.
6. G. Ciardo, G. Lüttgen, and R. Siminiceanu. Saturation: An efficient iteration strategy for symbolic state space generation. Proc. TACAS, LNCS 2031, pages 328-342, Apr. 2001. Springer.
7. G. Ciardo, R. Marmorstein, and R. Siminiceanu. The saturation algorithm for symbolic state space exploration. STTT, 8(1):4-25, Feb. 2006.
8. G. Ciardo and R. Siminiceanu. Structural symbolic CTL model checking of asynchronous systems. Proc. CAV, LNCS 2725, pages 40-53, July 2003. Springer.
9. G. Ciardo and K. S. Trivedi. A decomposition approach for stochastic reward net models. Perf. Eval., 18(1):37-59, 1993.
10. G. Ciardo and A. J. Yu. Saturation-based symbolic reachability analysis using conjunctive and disjunctive partitioning. Proc. CHARME, LNCS 3725, pages 146-161, Oct. 2005. Springer.
11. A. Cimatti, E. Clarke, F. Giunchiglia, and M. Roveri. NuSMV: A new symbolic model verifier. Proc. CAV, LNCS 1633, pages 495-499, 1999. Springer.
12. P. Fernandes, B. Plateau, and W. J. Stewart. Efficient descriptor-vector multiplication in stochastic automata networks. J. ACM, 45(3):381-414, 1998.
13. A. Itai and M. Rodeh. Symmetry breaking in distributed networks. Proc. FOCS, pages 150-158. IEEE Comp. Soc. Press, Oct. 1981.
14. 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.
15. S. Kimura and E. M. Clarke. A parallel algorithm for constructing binary decision diagrams. Proc. ICCD, pages 220-223, Sept. 1990. IEEE Comp. Soc. Press.
16. A. J. Martin. The design of a self-timed circuit for distributed mutual exclusion. Proc. Chapel Hill Conference on VLSI, pages 245-260, 1985.
17. K. L. McMillan. Symbolic Model Checking. Kluwer, 1993.
18. A. S. Miner and G. Ciardo. Efficient reachability set generation and storage using decision diagrams. Proc. ICATPN, LNCS 1639, pages 6-25, June 1999. Springer.
19. E. Pastor, O. Roig, J. Cortadella, and R. Badia. Petri net analysis using boolean manipulation. Proc. ICATPN, LNCS 815, pages 416-435, June 1994. Springer.
20. K. Ravi and F. Somenzi. High-density reachability analysis. Proc. ICCAD, pages 154-158. IEEE Comp. Soc. Press, 1995.
21. K. Ravi and F. Somenzi. Hints to accelerate Symbolic Traversal. Proc. CHARME, pages 250-264, 1999.
22. O. Roig, J. Cortadella, and E. Pastor. Verification of asynchronous circuits by BDD-based model checking of Petri nets. Proc. ICATPN, LNCS 935, pages 374-391. Springer, June 1995.
23. R. Siminiceanu and G. Ciardo. New metrics for static variable ordering in decision diagrams. Proc. TACAS, LNCS 2031, pages 328-342. Springer, March 2006.
24. M. Tilgner, Y. Takahashi, and G. Ciardo. SNS 1.0: Synchronized Network Solver. Proc. 1st Int. Workshop on Manuf. and Petri Nets, pages 215-234, June 1996.
25. The VIS Group. VIS: A system for verification and synthesis. Proc. CAV, LNCS 1102, pages 428-432, Springer, July 1996.
26. D. Ward and F. Somenzi. Automatic Generation of Hints for Symbolic Traversal. Proc. CHARME, pages 207-221, 2005.