Computing strongly connected components in a linear number of symbolic steps

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2003, Pages 573-582

  Gentilini, Raffaella ^a   Piazza, Carla ^b   Policriti, Alberto ^a  

^a UNIVERSITY OF UDINE   (Italy)

^b CA' FOSCARI UNIVERSITY OF VENICE   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

BOOLEAN FUNCTIONS; COMPUTATIONAL COMPLEXITY; COMPUTATIONAL METHODS; COMPUTER SOFTWARE; DATA STRUCTURES; GRAPH THEORY; THEOREM PROVING;

ORDERED BINARY DECISION DIAGRAM; STRONGLY CONNECTED COMPONENTS; SYMBOLIC STEPS;

ALGORITHMS;

EID: 0037739919     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (21)

1. A. V. Aho, J. E. Hopcroft, and J. D. Ullman. The Design and Analysis of Computer Algorithms. Addison Wesley, 1974.
2. S. B. Akers. Binary decision diagrams. IEEE Transaction on Computers, 27(6):509-516, 1978.
3. 20 states and beyond. Information and Computation, 98(2):142-170, 1992.
4. R. Bloem, H. N. Gabow, and F. Somenzi. An algorithm for strongly connected component analysis in n log n symbolic steps. In W. A. Hunt Jr. and S. D. Johnson, editors, Proc. of Int. Conference on Formal Methods in Computer-Aided Design (FMCAD'00), volume 1954 of LNCS, pages 37-54. Springer, 2000.
5. R. E. Bryant. Symbolic manipulation of boolean functions using a graphical representation. In Proc. 22nd Design Automation Conference, 1985.
6. R. E. Bryant. Graph based algorithms for boolean function manipulation. IEEE Transaction on Computers, C-35(8):677-691, 1986.
7. T. H. Cormen, C. E. Leiserson, and R. L. Rivest. Introduction to Algorithms. The MIT Press, Cambridge, Mass., 1990.
8. E. A. Emerson and C. L. Lei. Efficient model checking in fragments of the propositional mucalculus. In Proc. of First Annual Symp. on Logic in Computer Science (LICS'86), pages 267-278. IEEE, 1986.
9. K. Fisler, R. Fraer, M. Y. Vardi, and Z. Yang. Is there a best symbolic cycle-detection algorithm? In Tools and Algorithms for Construction and Analysis of Systems (TACAS'01), volume 2031 of Lecture Notes in Computer Science, pages 420-434. Springer-Verlag, Berlin, 2001.
10. R. H. Hardin, R. P. Kurshan, S. K. Shukla, and M. Y. Vardi. A new heuristic for bad cycle detection using BDDs. Formal Methods in System Design, 18(2):131-140, 2001.
11. G. D. Hachtel, E. Macii, A. Pardo, and F. Somenzi. Markovin analysis of large finite state machines. IEEE Transaction on Computer-Aided Design, 15(12):1479-1493, 1996.
12. C. Y. Lee. Binary decision programs. Bell System Technical Journal, 38(4):985-999, 1959.
13. K. L. McMillan. Symbolic model checking: an approach to the state explosion problem. Kluwer Academic Publishers, 1993.
14. C. Meinel and T. Theobald. Algorithms and data structures in VLSI Design: OBDD Foundations and Applications. Springer-Verlag, Berlin, 1998.
15. E. Pastor, J. Cortadella, and M. A. Peña. Structural methods to improve the symbolic analysis of Petri nets. In Proc. of Conference on Application and Theory of Petri Nets, volume 1639 of Lecture Notes in Computer Science, pages 26-45. Springer-Verlag, Berlin, 1996.
16. K. Ravi, R. Bloem, and F. Somenzi. A comparative study of symbolic algorithms for the computation of fair cycles. In W. A. Huntg Jr. and S. D. Johnson, editors, Proc. of Int. Conference on Formal Methods in Computer-Aided Design (FMCAD'00), volume 1954 of LNCS, pages 143-160. Springer, 2000.
17. F. Somenzi. Calculational System Design, volume 173 of Nato Science Series F: Computer and Systems Sciences, chapter Binary Decision Diagrams, pages 303-366, IOS Press, 1999.
18. F. Somenzi. CUDD: CU Decision Diagram Package Release 2.3.1. 2001. Available at http://vlsi.colorado.edu/fabio/CUDD/.
19. J. V. Sanghavi, R. K. Ranjan, R. K. Brayton, and A. Sangiovanni-Vincentelli. High performance bdd package based on exploiting memory hierarchy. In Proc. of ACM/IEEE Design Automation Conference, 1996.
20. R. E. Tarjan. Depth first search and linear graph algorithms. SIAM Journal on Computing, 1(2):146-160, 1972.
21. A. Xie and P. A. Beerel. Implicit enumeration of strongly connected components. In Proc. of Int. Conference on Computer Aided Design (CAD'99), pages 37-40, 1999.