The complexity of codiagnosability for discrete event and timed systems

Authors:
Franck Cassez
Affiliations:
National ICT Australia & CNRS, The University of New South Wales, Sydney, Australia
Venue:
ATVA'10 Proceedings of the 8th international conference on Automated technology for verification and analysis
Year:
2010

Citing 11
Cited 0

Supervisory control of a class of discrete event processes

SIAM Journal on Control and Optimization
A theory of timed automata

Theoretical Computer Science
Coordinated Decentralized Protocols for Failure Diagnosisof Discrete Event Systems

Discrete Event Dynamic Systems
Fault Diagnosis for Timed Automata

FTRTFT '02 Proceedings of the 7th International Symposium on Formal Techniques in Real-Time and Fault-Tolerant Systems: Co-sponsored by IFIP WG 2.2
Diagnosis of Discrete Event Systems Using Decentralized Architectures

Discrete Event Dynamic Systems
Sensor Minimization Problems with Static or Dynamic Observers for Fault Diagnosis

ACSD '07 Proceedings of the Seventh International Conference on Application of Concurrency to System Design
Lower bounds for natural proof systems

SFCS '77 Proceedings of the 18th Annual Symposium on Foundations of Computer Science
Fault Diagnosis with Static and Dynamic Observers

Fundamenta Informaticae - Application of Concurrency to System Design, the Sixth Special Issue
Robust codiagnosability of discrete event systems

ACC'09 Proceedings of the 2009 conference on American Control Conference
Fault diagnosis using timed automata

FOSSACS'05 Proceedings of the 8th international conference on Foundations of Software Science and Computation Structures
Decentralized failure diagnosis of discrete event systems

IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we study the fault codiagnosis problem for discrete event systems given by finite automata (FA) and timed systems given 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.