A catalog of complexity classes
Handbook of theoretical computer science (vol. A)
The computational complexity of propositional STRIPS planning
Artificial Intelligence
A Survey of Petri Net Methods for Controlled Discrete EventSystems
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
The Complexity of Graph Problems fore Succinctly Represented Graphs
WG '89 Proceedings of the 15th International Workshop on Graph-Theoretic Concepts in Computer Science
Diagnosability testing with satisfiability algorithms
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Fault diagnosis using timed automata
FOSSACS'05 Proceedings of the 8th international conference on Foundations of Software Science and Computation Structures
Local Consistency and Junction Tree for Diagnosis of Discrete-Event Systems
Proceedings of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence
Diagnosis of discrete-event systems using satisfiability algorithms
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 1
Diagnosability testing with satisfiability algorithms
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Diagnosability of pushdown systems
HVC'09 Proceedings of the 5th international Haifa verification conference on Hardware and software: verification and testing
Diagnosability in concurrent probabilistic systems
Proceedings of the 2013 international conference on Autonomous agents and multi-agent systems
Hi-index | 0.00 |
Reasoning about the knowledge of an agent is an important problem in many areas of AI. For example in diagnosis a basic question about a system is whether it is possible to diagnose it, that is, whether it is always possible to know whether a faulty behavior has occurred. In this paper we investigate the complexity of this diagnosability problem and the size of automata that perform diagnosis. There are algorithms for testing diagnosability in polynomial time in the number of states in the system. For succinct system representations, which may be exponentially smaller than the state space of the system, the diagnosability problem is consequently in EXPTIME. We show that this upper bound is not tight and that the decision problem is in fact PSPACE-complete. On-line diagnosis can be carried out by diagnosers which are automata that recognize faulty behavior. We show that diagnosers in the worst case have a size that is exponential in the number of states, both for explicit and succinct system representations. This is a consequence of the diagnoser having to maintain beliefs about the state of the system.