Abstract
Symbolic model checking based on Binary Decision Diagrams (BDDs) is a verification tool that has received an increasing attention by the research community. Conventional breadth-first approach to state generation results is often responsible for inefficiencies due to the growth of the BDD sizes. This is specially true for concurrent systems in which existing research (mostly oriented to synchronous designs) is ineffective. In this paper we show that it is possible to improve BFS symbolic traverse for concurrent systems by scheduling the application of the transition relation. The scheduling scheme is devised analyzing the causality relations between the events that occur in the system. We apply the scheduled symbolic traverse to invariant checking. We present a number of schedule schemes and analyze its implementation and effectiveness in a prototype verification tool.
This work has been partially funded by the Ministry of Science and Technology of Spain under contract TIC 2001-2476-C03-02 and grant AP2001-2819.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
R. E. Bryant, “Graph-based algorithms for Boolean function manipulation,” IEEE Trans. Computers, vol. C-35, pp. 677–691, Aug. 1986.
J. R. Burch, E. M. Clarke, K. L. McMillan, D. L. Dill, and L. J. Hwang, “Symbolic model checking: 1020 states and beyond,” Information and Computation, vol. 98, no. 2, pp. 142–170, 1992.
O. Roig, J. Cortadella, and E. Pastor, “Verification of asynchronous circuits by bdd-based model checking of petri nets,” in 16th International Conference on Application and Theory of Petri Nets, pp. 374–391, June 1995.
J. Cortadella, M. Kishinevsky, A. Kondratyev, L. Lavagno, and A. Yakovlev, “Petrify: a tool for manipulating concurrent specifications and synthesis of asynchronous controllers,” IEICE Transactions on Information and Systems, vol. E80-D, no. 3, pp. 315–325, March 1997.
A. S. Miner and G. Ciardo, “Efficient reachability set generation and storage using decision diagrams,” in ICATPN, pp. 6–25, 1999.
J. C. E. Pastor and O. Roig, “Symbolic analysis of bounded petri nets,” IEEE Transactions on Computers, vol. 50, no. 5, pp. pp. 432–448, May 2001.
K. Ravi and F. Somenzi, “High-density reachability analysis,” in Proc. of the IEEE/ACM International Conference on Computer Aided Design, pp. 154–158, 1995.
G. Cabodi, P. Camurati, and S. Quer, “Improving symbolic traversals by means of activity profiles,” in Design Automation Conference, pp. 306–311, 1999.
A. Hett, C. Scholl, and B. Becker, “State traversal guided by hamming distance profiles.”
K. Ravi and F. Somenzi, “Hints to accelerate symbolic traversal,” in Conference on Correct Hardware Design and Verification Methods, pp. 250–264, 1999.
A. Arnold, Finite Transition Systems. Prentice Hall, 1994.
C. Petri, Kommunikation mit Automaten. PhD thesis, Schriften des Institutes für Instrumentelle Matematik, Bonn, 1962.
M. R. Greenstreet and T. Ono-Tesfaye, “A fast, ASP*, RGD arbiter,” in Proceedings of the Fifth International Symposium on Advanced Research in Asynchronous Circuits and Systems, (Barcelona, Spain), pp. 173–185, IEEE, Apr. 1999.
P. Godefroid, Partial-order methods for the verification of concurrent systems: an approach to the state-explosion problem, vol. 1032. New York, NY, USA: Springer-Verlag Inc., 1996.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Solé, M., Pastor, E. (2002). Traversal Techniques for Concurrent Systems. In: Aagaard, M.D., O’Leary, J.W. (eds) Formal Methods in Computer-Aided Design. FMCAD 2002. Lecture Notes in Computer Science, vol 2517. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36126-X_14
Download citation
DOI: https://doi.org/10.1007/3-540-36126-X_14
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-00116-4
Online ISBN: 978-3-540-36126-8
eBook Packages: Springer Book Archive