Skip to Main content Skip to Navigation
Conference papers

The Complexity of Codiagnosability for Discrete Event and Timed Systems

Abstract : In this paper we study the fault codiagnosis problem for discrete event systems given by finite automata (FA) and timed systems gi\-ven by timed automata (TA). We provide a uniform characterization of codiagnosability for FA and TA which extends the necessary and sufficient condition that characterizes diagnosability. We also settle the complexity of the codiagnosability problems both for FA and TA and show that codiagnosability is PSPACE-complete in both cases. For FA this improves on the previously known bound (EXPTIME) and for TA it is a new result. Finally we address the codiagnosis problem for TA under bounded resources and show it is 2EXPTIME-complete.
Document type :
Conference papers
Complete list of metadata

Cited literature [21 references]  Display  Hide  Download
Contributor : Franck Cassez Connect in order to contact the contributor
Submitted on : Monday, June 21, 2010 - 6:06:33 AM
Last modification on : Monday, June 21, 2010 - 8:27:59 AM
Long-term archiving on: : Monday, October 22, 2012 - 12:35:55 PM


Files produced by the author(s)


  • HAL Id : inria-00493640, version 1


Franck Cassez. The Complexity of Codiagnosability for Discrete Event and Timed Systems. Int. Symp. on Automated Technology for Verification and Analysis (ATVA'10), Sep 2010, Singapore, Singapore. ⟨inria-00493640⟩



Record views


Files downloads