Traversal techniques for concurrent systems

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

Volumn 2517, Issue , 2002, Pages 220-237

  Solé, Marc ^a   Pastor, Enric ^a  

^a UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

BINARY DECISION DIAGRAMS; BOOLEAN FUNCTIONS; COMPUTER AIDED DESIGN; FORMAL METHODS; SCHEDULING;

BINARY DECISION DIAGRAMS (BDDS); BREADTH-FIRST APPROACH; PROTOTYPE VERIFICATION TOOL; RESEARCH COMMUNITIES; SYMBOLIC MODEL CHECKING; SYNCHRONOUS DESIGNS; TRANSITION RELATIONS; VERIFICATION TOOLS;

MODEL CHECKING;

EID: 84948172171     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-36126-x_14     Document Type: Conference Paper

References (14)

1. R. E. Bryant, “Graph-based algorithms for Boolean function manipulation,” IEEE Trans. Computers, vol. C-35, pp. 677–691, Aug. 1986.
2. 20 states and beyond,” Information and Computation, vol. 98, no. 2, pp. 142–170, 1992.
3. 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.
4. 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.
5. A. S. Miner and G. Ciardo, “Efficient reachability set generation and storage using decision diagrams,” in ICATPN, pp. 6–25, 1999.
6. 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.
7. 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.
8. G. Cabodi, P. Camurati, and S. Quer, “Improving symbolic traversals by means of activity profiles,” in Design Automation Conference, pp. 306–311, 1999.
9. A. Hett, C. Scholl, and B. Becker, “State traversal guided by hamming distance profiles.”
10. K. Ravi and F. Somenzi, “Hints to accelerate symbolic traversal,” in Conference on Correct Hardware Design and Verification Methods, pp. 250–264, 1999.
11. A. Arnold, Finite Transition Systems. Prentice Hall, 1994.
12. C. Petri, Kommunikation mit Automaten. PhD thesis, Schriften des Institutes für Instrumentelle Matematik, Bonn, 1962.
13. 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.
14. 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.