메뉴 건너뛰기




Volumn 2, Issue 3, 1999, Pages 270-278

A minimized automaton representation of reachable states

Author keywords

Data compression; Finite automata; Model checking; OBDDs; Sharing trees; Spin; Verification

Indexed keywords

DETERMINISTIC FINITE AUTOMATA; EXPECTED TIME; EXPLICIT STATE; MEMORY REQUIREMENTS; MODEL CHECKER; OBDDS; SHARING TREES; SPIN;

EID: 84896857608     PISSN: 14332779     EISSN: 14332787     Source Type: Journal    
DOI: 10.1007/s100090050034     Document Type: Article
Times cited : (36)

References (10)
  • 1
    • 0022769976 scopus 로고
    • Graph based algorithms for boolean function manipulation
    • Bryant, R. E.: Graph based algorithms for boolean function manipulation. IEEE Transansactions on Computers C-35: 677-691, 1986.
    • (1986) IEEE Transansactions on Computers , vol.C-35 , pp. 677-691
    • Bryant, R.E.1
  • 2
    • 0026913667 scopus 로고
    • Symbolic boolean manipulation with ordered binary decision diagrams
    • Bryant, R. E.: Symbolic boolean manipulation with ordered binary decision diagrams. Computing Surveys 24(3): 293-318, 1992.
    • (1992) Computing Surveys , vol.24 , Issue.3 , pp. 293-318
    • Bryant, R.E.1
  • 3
    • 35248837557 scopus 로고    scopus 로고
    • State space compression in Spin with GETSs
    • Rutgers University, New Brunswick, NJ, AmericanMathematical Society, DIMACS-32
    • Grégoire, J. C.: State space compression in Spin with GETSs. Proc. Second Spin Workshop, Rutgers University, New Brunswick, NJ, AmericanMathematical Society, DIMACS-32, 1996.
    • (1996) Proc Second Spin Workshop
    • Grégoire, J.C.1
  • 5
    • 0012805577 scopus 로고    scopus 로고
    • State compression in Spin
    • Twente University, The Netherlands, April
    • Holzmann, G. J.: State compression in Spin. Proc. Third Spin Workshop, Twente University, The Netherlands, April 1997.
    • (1997) Proc Third Spin Workshop
    • Holzmann, G.J.1
  • 7
    • 8644254552 scopus 로고    scopus 로고
    • On nested depth first search
    • Rutgers University, New Brunswick, NJ, American Mathematical Society, DIMACS/32
    • Holzmann, G. J., Peled, D., Yannakakis, M.: On nested depth first search. Proc. Second Spin Workshop, Rutgers University, New Brunswick, NJ, American Mathematical Society, DIMACS/32, 1996.
    • (1996) Proc Second Spin Workshop
    • Holzmann, G.J.1    Peled, D.2    Yannakakis, M.3
  • 9
    • 0022093855 scopus 로고
    • Self-adjusting binary search trees
    • Sleator, D., Tarjan, R.: Self-adjusting binary search trees. JACM 32(3): 652-686, 1985.
    • (1985) JACM , vol.32 , Issue.3 , pp. 652-686
    • Sleator, D.1    Tarjan, R.2
  • 10
    • 35248896437 scopus 로고    scopus 로고
    • Memory efficient storage in Spin
    • Rutgers University, New Brunswick, NJ, American Mathematical Society, DIMACS-32
    • Visser, W.: Memory efficient storage in Spin. Proc. Second Spin Workshop, Rutgers University, New Brunswick, NJ, American Mathematical Society, DIMACS-32, 1996.
    • (1996) Proc Second Spin Workshop
    • Visser, W.1


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