메뉴 건너뛰기




Volumn 1, Issue , 2008, Pages 535-540

A scalable jointree algorithm for diagnosability

Author keywords

[No Author keywords available]

Indexed keywords

BIONICS; MESSAGE PASSING;

EID: 57749172695     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (19)

References (11)
  • 1
    • 84880841724 scopus 로고    scopus 로고
    • Formal verification of diagnosability via symbolic model checking
    • Cimatti, A.; Pecheur, C.; and Cavada, R. 2003. Formal verification of diagnosability via symbolic model checking. In IJCAI-03, 363-369.
    • (2003) IJCAI-03 , pp. 363-369
    • Cimatti, A.1    Pecheur, C.2    Cavada, R.3
  • 2
    • 57749170726 scopus 로고    scopus 로고
    • Dechter, R. 2003. Constraint Processing. Morgan Kaufmann. Jiang, S.; Huang, Z.; Chandra, V.; and Kumar, R. 2001. A polynomial time algorithm for diagnosability of discrete event systems. IEEE Transactions on Automatic Control 46(8): 1318-1321.
    • Dechter, R. 2003. Constraint Processing. Morgan Kaufmann. Jiang, S.; Huang, Z.; Chandra, V.; and Kumar, R. 2001. A polynomial time algorithm for diagnosability of discrete event systems. IEEE Transactions on Automatic Control 46(8): 1318-1321.
  • 3
    • 31644437900 scopus 로고    scopus 로고
    • Diagnosability analysis of distributed discrete event systems
    • Pencolé, Y. 2004. Diagnosability analysis of distributed discrete event systems. In ECAI-04, 43-47.
    • (2004) ECAI-04 , pp. 43-47
    • Pencolé, Y.1
  • 4
    • 33845887957 scopus 로고    scopus 로고
    • Assistance for the design of a diagnosable component-based system
    • Pencole, Y. 2005. Assistance for the design of a diagnosable component-based system. In ICTAI-05, 549-556.
    • (2005) ICTAI-05 , pp. 549-556
    • Pencole, Y.1
  • 5
    • 84880912141 scopus 로고    scopus 로고
    • Diagnosability testing with satisfiability algorithms
    • Rintanen, J., and Grastien, A. 2007. Diagnosability testing with satisfiability algorithms. In IJCAI-07, 532-537.
    • (2007) IJCAI-07 , pp. 532-537
    • Rintanen, J.1    Grastien, A.2
  • 6
    • 0000673493 scopus 로고
    • Graph minors II: Algorithmic aspects of treewidth
    • Robertson, N., and Seymour, P. D. 1986. Graph minors II: Algorithmic aspects of treewidth. Journal of Algorithms 7:309-322.
    • (1986) Journal of Algorithms , vol.7 , pp. 309-322
    • Robertson, N.1    Seymour, P.D.2
  • 8
    • 38049096068 scopus 로고    scopus 로고
    • Scalable diagnosability checking of event-driven systems
    • Schumann, A., and Pencolé, Y. 2007. Scalable diagnosability checking of event-driven systems. In IJCAI-07, 575-580.
    • (2007) IJCAI-07 , pp. 575-580
    • Schumann, A.1    Pencolé, Y.2
  • 10
    • 0002985393 scopus 로고
    • Propagating belief functions with local computations
    • Shenoy, P. P., and Shafer, G. 1986. Propagating belief functions with local computations. IEEE Expert l(3):43-52.
    • (1986) IEEE Expert , vol.50 , Issue.3 , pp. 43-52
    • Shenoy, P.P.1    Shafer, G.2
  • 11
    • 0036741824 scopus 로고    scopus 로고
    • Polynomial-time verification of diagnosability of partially-observed discrete-event systems
    • Yoo, T., and Lafortune, S. 2002. Polynomial-time verification of diagnosability of partially-observed discrete-event systems. IEEE Transactions on Automated Control 47(9): 1491-1495.
    • (2002) IEEE Transactions on Automated Control , vol.47 , Issue.9 , pp. 1491-1495
    • Yoo, T.1    Lafortune, S.2


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