메뉴 건너뛰기




Volumn , Issue , 2008, Pages 212-217

Fault diagnosis with dynamic observers

Author keywords

[No Author keywords available]

Indexed keywords

ELECTRIC FAULT CURRENTS; FAILURE ANALYSIS; QUALITY ASSURANCE; SENSOR NETWORKS; TECHNICAL PRESENTATIONS;

EID: 53149144664     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/WODES.2008.4605947     Document Type: Conference Paper
Times cited : (8)

References (12)
  • 2
    • 51149108735 scopus 로고    scopus 로고
    • Sensor minimization problems with static or dynamic observers for fault diagnosis
    • IEEE Computer Society
    • -, "Sensor minimization problems with static or dynamic observers for fault diagnosis," in 7th Int. Conf. on Application of Concurrency to System Design (ACSD'07). IEEE Computer Society, 2007, pp. 90-99.
    • (2007) 7th Int. Conf. on Application of Concurrency to System Design (ACSD'07) , pp. 90-99
  • 3
    • 53149128468 scopus 로고    scopus 로고
    • Fault diagnosis with static and dynamic observers
    • accepted for Publication
    • F. Cassez and S. Tripakis, "Fault diagnosis with static and dynamic observers," Fundamenta Informaticœ, 2008, accepted for Publication.
    • (2008) Fundamenta Informaticœ
    • Cassez, F.1    Tripakis, S.2
  • 4
    • 0023104549 scopus 로고
    • Supervisory control of a class of discrete event processes
    • Jan
    • P. Ramadge and W. Wonham, "Supervisory control of a class of discrete event processes," SIAM J. Control Optim., vol. 25, no. 1, Jan. 1987.
    • (1987) SIAM J. Control Optim , vol.25 , Issue.1
    • Ramadge, P.1    Wonham, W.2
  • 7
    • 0034840907 scopus 로고    scopus 로고
    • On the computational complexity of some problems arising in partially-observed discrete event systems
    • arlington, VA
    • T.-S. Yoo and S. Lafortune, "On the computational complexity of some problems arising in partially-observed discrete event systems," in American Control Conference (ACC'01), 2001, arlington, VA.
    • (2001) American Control Conference (ACC'01)
    • Yoo, T.-S.1    Lafortune, S.2
  • 8
    • 0035418515 scopus 로고    scopus 로고
    • A polynomial algorithm for testing diagnosability of discrete event systems
    • Aug
    • S. Jiang, Z. Huang, V. Chandra, and R. Kumar, "A polynomial algorithm for testing diagnosability of discrete event systems," IEEE Transactions on Automatic Control, vol. 46, no. 8, Aug. 2001.
    • (2001) IEEE Transactions on Automatic Control , vol.46 , Issue.8
    • Jiang, S.1    Huang, Z.2    Chandra, V.3    Kumar, R.4
  • 10
    • 0001391363 scopus 로고
    • A characterization of the minimum mean cycle in a digraph
    • R. Karp, "A characterization of the minimum mean cycle in a digraph," Discrete Mathematics, vol. 23, pp. 309-311, 1978.
    • (1978) Discrete Mathematics , vol.23 , pp. 309-311
    • Karp, R.1
  • 11
    • 0030143640 scopus 로고    scopus 로고
    • The complexity of mean payoff games on graphs
    • U. Zwick and M. Paterson, "The complexity of mean payoff games on graphs," Theoretical Computer Science, vol. 158, no. 1-2, pp. 343-359, 1996.
    • (1996) Theoretical Computer Science , vol.158 , Issue.1-2 , pp. 343-359
    • Zwick, U.1    Paterson, M.2
  • 12
    • 33750363156 scopus 로고    scopus 로고
    • Algorithms for omega-regular games with imperfect information
    • Computer Science Logic CSL, Springer
    • L. Doyen, K. Chatterjee, T. Henzinger, and J.-F. Raskin, "Algorithms for omega-regular games with imperfect information," in Computer Science Logic (CSL), ser. Lecture Notes in Computer Science 4207. Springer, 2006, pp. 287-302.
    • (2006) ser. Lecture Notes in Computer Science , vol.4207 , pp. 287-302
    • Doyen, L.1    Chatterjee, K.2    Henzinger, T.3    Raskin, J.-F.4


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