Abstract
In previous work, we showed how structural information can be used to efficiently generate the state-space of asynchronous systems. Here, we apply these ideas to symbolic CTL model checking. Thanks to a Kronecker encoding of the transition relation, we detect and exploit event locality and apply better fixed-point iteration strategies, resulting in orders-of-magnitude reductions for both execution times and memory consumption in comparison to well-established tools such as NuSMV.
Work supported in part by the National Aeronautics and Space Administration under grants NAG-1-2168 and NAG-1-02095 and by the National Science Foundation under grants CCR-0219745 and ACI-0203971.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Alur, R., et al.: Partial-order reduction in symbolic state space exploration. In: CAV 1997, pp. 340–351. Springer, Heidelberg (1997)
Bloem, R., Gabow, H., Somenzi, F.: An algorithm for strongly connected component analysis in n log n symbolic steps. In: Johnson, S.D., Hunt Jr., W.A. (eds.) FMCAD 2000. LNCS, vol. 1954, pp. 37–54. Springer, Heidelberg (2000)
Bloem, R., Ravi, K., Somenzi, F.: Symbolic guided search for CTL model checking. In: Proc. DAC, pp. 29–34. ACM Press, New York (2000)
Bryant, R.E.: Symbolic boolean manipulation with ordered binary-decision diagrams. ACM Comp. Surv. 24(3), 318–393 (1992)
Buchholz, P., Ciardo, G., Donatelli, S., Kemper, P.: Complexity of memoryefficient Kronecker operations with applications to the solution of Markov models. INFORMS J. Comp. 12(3), 203–222 (2000)
Burch, J.R., Clarke, E.M., McMillan, K.L., Dill, D.L., Hwang, L.J.: Symbolic model checking: 1020 states and beyond. In: LICS, pp. 428–439, 4–7 (1990)
Ciardo, G., et al.: SMART: Stochastic Model checking Analyzer for Reliability and Timing, User Manual, Available at http://www.cs.wm.edu/~ciardo/SMART/
Ciardo, G., Luettgen, G., Siminiceanu, R.: Efficient symbolic state-space construction for asynchronous systems. In: Nielsen, M., Simpson, D. (eds.) ICATPN 2000. LNCS, vol. 1825, pp. 103–122. Springer, Heidelberg (2000)
Ciardo, G., Luettgen, G., Siminiceanu, R.: Saturation: An efficient iteration strategy for symbolic state space generation. In: Margaria, T., Yi, W. (eds.) TACAS 2001. LNCS, vol. 2031, pp. 328–342. Springer, Heidelberg (2001)
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)
Cimatti, A., Clarke, E., Giunchiglia, F., Roveri, M.: NUSMV: A new symbolic model verifier. In: Halbwachs, N., Peled, D.A. (eds.) CAV 1999. LNCS, vol. 1633, pp. 495–499. Springer, Heidelberg (1999)
Clarke, E.M., Emerson, E.A.: Design and synthesis of synchronization skeletons using branching time temporal logic. In: Kozen, D. (ed.) Logic of Programs 1981. LNCS, vol. 131, pp. 52–71. Springer, Heidelberg (1982)
Clarke, E.M., Grumberg, O., Peled, D.A.: Model Checking. MIT Press, Cambridge (1999)
Burch, J.R., Clarke, E.M., Long, D.E.: Symbolic model checking with partitioned transition relations. In: Proc. Int. Conference on VLSI. IFIP Transactions, pp. 49–58. North-Holland, Amsterdam (1991)
Kam, T., Villa, T., Brayton, R., Sangiovanni-Vincentelli, A.: Multi-valued decision diagrams: theory and applications. Multiple-Valued Logic 4(1–2), 9–62 (1998)
Kimura, S., Clarke, E.M.: A parallel algorithm for constructing binary decision diagrams. In: Proc. ICCD, pp. 220–223. IEEE Comp. Soc. Press, Los Alamitos (1990)
Miner, A.S., Ciardo, G.: Efficient reachability set generation and storage using decision diagrams. In: Donatelli, S., Kleijn, J. (eds.) ICATPN 1999. LNCS, vol. 1639, pp. 6–25. Springer, Heidelberg (1999)
Plateau, B.: On the stochastic structure of parallelism and synchronisation models for distributed algorithms. In: Proc. SIGMETRICS, pp. 147–153 (May 1985)
Ravi, K., Somenzi, F.: Efficient fixpoint computation for invariant checking. In: Proc. ICCD, pp. 467–474. IEEE Comp. Soc. Press, Los Alamitos (1999)
Xie, A., Beerel, P.A.: Implicit enumeration of strongly connected components. In: Proc. ICCAD, pp. 37–40. ACM Press, New York (1999)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ciardo, G., Siminiceanu, R. (2003). Structural Symbolic CTL Model Checking of Asynchronous Systems. In: Hunt, W.A., Somenzi, F. (eds) Computer Aided Verification. CAV 2003. Lecture Notes in Computer Science, vol 2725. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-45069-6_4
Download citation
DOI: https://doi.org/10.1007/978-3-540-45069-6_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40524-5
Online ISBN: 978-3-540-45069-6
eBook Packages: Springer Book Archive