메뉴 건너뛰기




Volumn 39, Issue 1, 2009, Pages 177-187

Integration and Test Sequencing for Complex Systems

Author keywords

Integration; manufacturing machines; semiconductor industry; test sequencing; test strategy

Indexed keywords


EID: 85008054096     PISSN: 10834427     EISSN: 15582426     Source Type: Journal    
DOI: 10.1109/TSMCA.2008.2006374     Document Type: Article
Times cited : (10)

References (12)
  • 2
    • 0026142517 scopus 로고
    • Representations of mechanical assembly sequences
    • Apr.
    • L. S. H. de Mello and A. C. Sanderson, “Representations of mechanical assembly sequences,” IEEE Trans. Robot. Autom., vol. 7, no. 2, pp. 211–227, Apr. 1991.
    • (1991) IEEE Trans. Robot. Autom. , vol.7 , Issue.2 , pp. 211-227
    • de Mello, L.S.H.1    Sanderson, A.C.2
  • 3
    • 0026142590 scopus 로고
    • A correct and complete algorithm for the generation of mechanical assembly sequences
    • Apr.
    • L. S. H. de Mello and A. C. Sanderson, “A correct and complete algorithm for the generation of mechanical assembly sequences,” IEEE Trans. Robot. Autom., vol. 7, no. 2, pp. 228–240, Apr. 1991.
    • (1991) IEEE Trans. Robot. Autom. , vol.7 , Issue.2 , pp. 228-240
    • de Mello, L.S.H.1    Sanderson, A.C.2
  • 4
    • 44949209192 scopus 로고    scopus 로고
    • Selecting an efficient 00 integration testing strategy: An experimental comparison of actual strategies
    • V. L. Hanh, K. Akif, Y. L. Traon, and J.-M. Jzquel, “Selecting an efficient 00 integration testing strategy: An experimental comparison of actual strategies,” in Proc. ECOOP, 2001, pp. 381–401.
    • (2001) Proc. ECOOP , pp. 381-401
    • Hanh, V.L.1    Akif, K.2    Traon, Y.L.3    Jzquel, J.-M.4
  • 11
    • 0025456824 scopus 로고
    • Application of heuristic search and information theory to sequential fault diagnosis
    • Jul./Aug.
    • K. R. Pattipati and M. G. Alexandridis, “Application of heuristic search and information theory to sequential fault diagnosis,” IEEE Trans. Syst., Man, Cybern., vol. 20, no. 4, pp. 872–887, Jul./Aug. 1990.
    • (1990) IEEE Trans. Syst., Man, Cybern. , vol.20 , Issue.4 , pp. 872-887
    • Pattipati, K.R.1    Alexandridis, M.G.2
  • 12
    • 84976688444 scopus 로고
    • An algorithm to enumerate all cutsets of a graph in linear time per cutset
    • Oct.
    • S. Tsukiyama, I. Shirakawa, and H. Ozaki, “An algorithm to enumerate all cutsets of a graph in linear time per cutset,” J. Assoc. Comput. Mach., vol. 27, no. 4, pp. 619–632, Oct. 1980.
    • (1980) J. Assoc. Comput. Mach. , vol.27 , Issue.4 , pp. 619-632
    • Tsukiyama, S.1    Shirakawa, I.2    Ozaki, H.3


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