메뉴 건너뛰기




Volumn 1102, Issue , 1996, Pages 336-347

Saving space by fully exploiting invisible transitions

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER AIDED ANALYSIS; STATE SPACE METHODS;

EID: 84957372985     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61474-5_81     Document Type: Conference Paper
Times cited : (5)

References (10)
  • 1
    • 0000138318 scopus 로고
    • An O(Nlogn) unidirectional distributed algorithm for extrema finding in a circle
    • D. Dolev, M. Klawe and M. Rodeh. An O(nlogn) unidirectional distributed algorithm for extrema finding in a circle. Journal of Algorithms, volume 3, pages 245-260, 1992.
    • (1992) Journal of Algorithms , vol.3 , pp. 245-260
    • Dolev, D.1    Klawe, M.2    Rodeh, M.3
  • 4
    • 0023960738 scopus 로고
    • An improved protocol peachability analysis technique
    • February
    • G.J. Holzmann. An improved protocol peachability analysis technique. Software-Practice and Experience, Vol 18(2), pages 137-161,February 1988.
    • (1988) Software-Practice and Experience , vol.18 , Issue.2 , pp. 137-161
    • Holzmann, G.J.1
  • 9
    • 0001176166 scopus 로고
    • A stubborn attack on state explosion
    • A. Valmari. A stubborn attack on state explosion. Formal methods in System Design 1, pages 297-322, 1992.
    • (1992) Formal Methods in System Design , vol.1 , pp. 297-322
    • Valmari, A.1
  • 10
    • 0022987223 scopus 로고
    • An automata-theoretic approach to automatic program verification
    • Cambridge, June
    • M. Vardi and P. Wolper. An automata-theoretic approach to automatic program verification. In Proc. 1st Symposium on Logic in Computer Science, pages 322-331, Cambridge, June 1986.
    • (1986) Proc. 1St Symposium on Logic in Computer Science , pp. 322-331
    • Vardi, M.1    Wolper, P.2


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