Structural symbolic CTL model checking of asynchronous systems

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

Volumn 2725, Issue , 2003, Pages 40-53

  Ciardo, Gianfranco ^a   Siminiceanu, Radu ^a  

^a The College of William and Mary   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER AIDED ANALYSIS;

ASYNCHRONOUS SYSTEM; CTL MODEL-CHECKING; FIXED POINT ITERATION; KRONECKER; MEMORY CONSUMPTION; ORDERS OF MAGNITUDE; STRUCTURAL INFORMATION; TRANSITION RELATIONS;

MODEL CHECKING;

EID: 35248883986     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-45069-6_4     Document Type: Article

References (20)

1. R. Alur et al. Partial-order reduction in symbolic state space exploration. In Proc. CAV, pages 340-351. Springer, 1997.
2. R. Bloem, H. Gabow, and F. Somenzi. An algorithm for strongly connected component analysis in n log n symbolic steps. In Proc. FMCAD, pages 37-54. Springer, 2000.
3. R. Bloem, K. Ravi, and F. Somenzi. Symbolic guided search for CTL model checking. In Proc. DAC, pages 29-34. ACM Press, 2000.
4. R. E. Bryant. Symbolic boolean manipulation with ordered binary-decision diagrams. ACM Comp. Surv., 24(3):393-318, 1992.
5. P. Buchholz, G. Ciardo, S. Donatelli, and P. Kemper. Complexity of memory-efficient Kronecker operations with applications to the solution of Markov models. INFORMS J. Comp., 12(3):203-222, 2000.
6. J. R. Burch, E. M. Clarke, K. L. McMillan, D. L. Dill, and L. J. Hwang. Symbolic model checking: 1020 states and beyond. In LICS, pages 428-439, 4-7 1990.
7. G. Ciardo et al. SMART: Stochastic Model checking Analyzer for Reliability and Timing, User Manual. Available at http://www.cs.wm.edu/∼ciardo/SMART/.
8. G. Ciardo, G. Luettgen, and R. Siminiceanu. Efficient symbolic state-space construction for asynchronous systems. In Proc. ICATPN, LNCS 1825, pages 103-122. Springer, June 2000.
9. G. Ciardo, G. Luettgen, and R. Siminiceanu. Saturation: An efficient iteration strategy for symbolic state space generation. In Proc. TACAS, LNCS 2031, pages 328-342. Springer, Apr. 2001.
10. G. Ciardo, R. Marmorstein, and R. Siminiceanu. Saturation unbound. In Proc. TACAS, LNCS 2619, pages 379-393. Springer, Apr. 2003.
11. A. Cimatti, E. Clarke, F. Giunchiglia, and M. Roveri. NuSMV: A new symbolic model verifier. In Proc. CAV, LNCS 1633, pages 495-499. Springer, 1999.
12. E. M. Clarke and E. A. Emerson. Design and synthesis of synchronization skeletons using branching time temporal logic. In Proc. IBM Workshop on Logics of Programs, LNCS 131, pages 52-71. Springer, 1981.
13. E. M. Clarke, O. Grumberg, and D. A. Peled. Model Checking. MIT Press, 1999.
14. J.R. Burch, E.M. Clarke, and D.E. Long. Symbolic model checking with partitioned transition relations. In Proc. Int. Conference on VLSI, pages 49-58. IFIP Transactions, North-Holland, Aug. 1991.
15. 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.
16. S. Kimura and E. M. Clarke. A parallel algorithm for constructing binary decision diagrams. In Proc. ICCD, pages 220-223. IEEE Comp. Soc. Press, Sept. 1990.
17. A. S. Miner and G. Ciardo. Efficient reachability set generation and storage using decision diagrams. In Proc. ICATPN, LNCS 1639, pages 6-25, June 1999.
18. B. Plateau. On the stochastic structure of parallelism and synchronisation models for distributed algorithms. In Proc. SIGMETRICS, pages 147-153, May 1985.
19. K. Ravi and F. Somenzi. Efficient fixpoint computation for invariant checking. In Proc. ICCD, pages 467-474. IEEE Comp. Soc. Press, Oct. 1999.
20. A. Xie and P. A. Beerel. Implicit enumeration of strongly connected components. In Proc. ICCAD, pages 37-40. ACM Press, 1999.