메뉴 건너뛰기




Volumn 28, Issue 1, 2006, Pages 37-56

An algorithm for strongly connected component analysis in n log n symbolic steps

Author keywords

Binary decision diagrams; Breadth first search; B chi automata; Depth first search; Language emptiness; Model checking; Streett automata; Strongly connected components; Symbolic algorithms

Indexed keywords

BINARY DECISION DIAGRAMS; BREADTH-FIRST SEARCH; BÜCHI AUTOMATA; DEPTH-FIRST SEARCH; LANGUAGE EMPTINESS; MODEL CHECKING; STREETT AUTOMATA; STRONGLY CONNECTED COMPONENTS; SYMBOLIC ALGORITHMS;

EID: 32344444575     PISSN: 09259856     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10703-006-4341-z     Document Type: Article
Times cited : (53)

References (28)
  • 2
    • 84957058244 scopus 로고    scopus 로고
    • Efficient decision procedures for model checking of linear time logic properties
    • N. Halbwachs and D. Peled (Eds.), Springer-Verlag, Berlin, LNCS 1633
    • R. Bloem, K. Ravi, and F. Somenzi, "Efficient decision procedures for model checking of linear time logic properties," in N. Halbwachs and D. Peled (Eds.), Eleventh Conference on Computer Aided Verification (CAV'99), Springer-Verlag, Berlin, LNCS 1633, 1999, pp. 222-235,.
    • (1999) Eleventh Conference on Computer Aided Verification (CAV'99) , pp. 222-235
    • Bloem, R.1    Ravi, K.2    Somenzi, F.3
  • 3
    • 0022769976 scopus 로고
    • Graph-based algorithms for Boolean function manipulation
    • R.E. Bryant, "Graph-based algorithms for Boolean function manipulation," IEEE Transactions on Computers, vol. C-35, No. 8, pp. 677-691, 1986.
    • (1986) IEEE Transactions on Computers , vol.C-35 , Issue.8 , pp. 677-691
    • Bryant, R.E.1
  • 5
    • 0022706656 scopus 로고
    • Automatic verification of finite state concurrent systems using temporal logic specifications
    • E.M. Clarke, E.A. Emerson, and A.P. Sistla, "Automatic verification of finite state concurrent systems using temporal logic specifications," ACM Transaction on Programming Languages and Systems, Vol. 8, No. 2, pp. 244-263, 1986.
    • (1986) ACM Transaction on Programming Languages and Systems , vol.8 , Issue.2 , pp. 244-263
    • Clarke, E.M.1    Emerson, E.A.2    Sistla, A.P.3
  • 9
    • 0023362541 scopus 로고
    • Modalities for model checking: Branching time logic strikes back
    • E.A. Emerson and C. Lei, "Modalities for model checking: Branching time logic strikes back," Science of Computer Programming, Vol. 8, pp. 275-306, 1987.
    • (1987) Science of Computer Programming , vol.8 , pp. 275-306
    • Emerson, E.A.1    Lei, C.2
  • 11
    • 0037739919 scopus 로고    scopus 로고
    • Computing strongly connected componenets in a linear number of symbolic steps
    • Baltimore, MD
    • R. Gentilini, C. Piazza, and A. Policriti, "Computing strongly connected componenets in a linear number of symbolic steps, in Symposium on Discrete Algorithms, Baltimore, MD, 2003.
    • (2003) Symposium on Discrete Algorithms
    • Gentilini, R.1    Piazza, C.2    Policriti, A.3
  • 16
    • 84947926519 scopus 로고    scopus 로고
    • Faster algorithms for the nonemptiness of Streett automata and for communication protocol pruning
    • R. Karlsson and A. Lingas (Eds.), Springer-Verlag, Berlin, LNCS 1097
    • M.R. Henzinger and J.A. Telle, "Faster algorithms for the nonemptiness of Streett automata and for communication protocol pruning," in R. Karlsson and A. Lingas (Eds.), Algorithm Theory: SWAT'96, Springer-Verlag, Berlin, LNCS 1097, 1996, pp. 16-27.
    • (1996) Algorithm Theory: SWAT'96 , pp. 16-27
    • Henzinger, M.R.1    Telle, J.A.2
  • 20
    • 32344439754 scopus 로고
    • Class project on BDD-based verification
    • E.M. Clarke
    • K. McMillan, "Class project on BDD-based verification," Private Communication, E.M. Clarke, 1987.
    • (1987) Private Communication
    • McMillan, K.1
  • 22
    • 84958653356 scopus 로고    scopus 로고
    • Verification of infinite state systems by compositional model checking
    • Berlin, Springer-Verlag. LNCS 1703
    • K.L. McMillan, "Verification of infinite state systems by compositional model checking," in Correct Hardware Design and Verification Methods (CHARME'99), Berlin, Springer-Verlag. LNCS 1703, 1999, pp. 219-233.
    • (1999) Correct Hardware Design and Verification Methods (CHARME'99) , pp. 219-233
    • McMillan, K.L.1
  • 23
    • 84947265856 scopus 로고    scopus 로고
    • A comparative study of symbolic algorithms for the computation of fair cycles
    • W.A. Hunt, Jr. and S.D. Johnson (Eds.). Springer-Verlag, LNCS 1954
    • K. Ravi, R. Bloem, and F. Somenzi, "A comparative study of symbolic algorithms for the computation of fair cycles," in W.A. Hunt, Jr. and S.D. Johnson (Eds.). Formal Methods in Computer Aided Design, Springer-Verlag, LNCS 1954, 2000, pp. 143-160.
    • (2000) Formal Methods in Computer Aided Design , pp. 143-160
    • Ravi, K.1    Bloem, R.2    Somenzi, F.3
  • 24
    • 0000690591 scopus 로고
    • Prepositional dynamic logic of looping and converse is elementarily decidable
    • R.S. Streett, "Prepositional dynamic logic of looping and converse is elementarily decidable," Information and Control, Vol. 54, pp. 121-141, 1982.
    • (1982) Information and Control , vol.54 , pp. 121-141
    • Streett, R.S.1
  • 25
    • 0001790593 scopus 로고
    • Depth first search and linear graph algorithms
    • R. Tarjan, "Depth first search and linear graph algorithms," SIAM journal on Computing, Vol. 1, pp. 146-160, 1972.
    • (1972) SIAM Journal on Computing , vol.1 , pp. 146-160
    • Tarjan, R.1
  • 26
    • 0000666845 scopus 로고
    • Testing language containment for ω-automata using BDD's
    • H.J. Touati, R.K. Brayton, and R.P. Kurshan, "Testing language containment for ω-automata using BDD's," Information and Computation, Vol. 118, No. 1, pp. 101-109, 1995.
    • (1995) Information and Computation , vol.118 , Issue.1 , pp. 101-109
    • Touati, H.J.1    Brayton, R.K.2    Kurshan, R.P.3
  • 28
    • 0034296833 scopus 로고    scopus 로고
    • Implicit enumeration of strongly connected components and an application to formal verification
    • A. Xie and P. A. Beerel, "Implicit enumeration of strongly connected components and an application to formal verification," IEEE Transactions on Computer-Aided Design, Vol. 19, No. 10, pp. 1225-1230, 2000.
    • (2000) IEEE Transactions on Computer-aided Design , vol.19 , Issue.10 , pp. 1225-1230
    • Xie, A.1    Beerel, P.A.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.