Fault Diagnosis with Dynamic Observers. Cassez, F. & Tripakis, S. CoRR, 2010.
Paper abstract bibtex In this paper, we review some recent results about the use of dynamic observers for fault diagnosis of discrete event systems. Fault diagnosis consists in synthesizing a diagnoser that observes a given plant and identifies faults in the plant as soon as possible after their occurrence. Existing literature on this problem has considered the case of fixed static observers, where the set of observable events is fixed and does not change during execution of the system. In this paper, we consider dynamic observers: an observer can "switch" sensors on or off, thus dynamically changing the set of events it wishes to observe. It is known that checking diagnosability (i.e., whether a given observer is capable of identifying faults) can be solved in polynomial time for static observers, and we show that the same is true for dynamic ones. We also solve the problem of dynamic observers' synthesis and prove that a most permissive observer can be computed in doubly exponential time, using a game-theoretic approach. We further investigate optimization problems for dynamic observers and define a notion of cost of an observer.
@article{DBLP:journals/corr/abs-1004-2810,
author = {Franck Cassez and
Stavros Tripakis},
title = {Fault Diagnosis with Dynamic Observers},
journal = {CoRR},
Type = {E - Reports},
volume = {abs/1004.2810},
year = {2010},
url = {http://arxiv.org/abs/1004.2810},
timestamp = {Mon, 05 Dec 2011 18:05:22 +0100},
biburl = {http://dblp.uni-trier.de/rec/bib/journals/corr/abs-1004-2810},
bibsource = {dblp computer science bibliography, http://dblp.org},
keywords = {fault diagnosis, timed automata},
abstract = {In this paper, we review some recent results about the use of dynamic observers for fault diagnosis of discrete event systems. Fault diagnosis consists in synthesizing a diagnoser that observes a given plant and identifies faults in the plant as soon as possible after their occurrence. Existing literature on this problem has considered the case of fixed static observers, where the set of observable events is fixed and does not change during execution of the system. In this paper, we consider dynamic observers: an observer can "switch" sensors on or off, thus dynamically changing the set of events it wishes to observe. It is known that checking diagnosability (i.e., whether a given observer is capable of identifying faults) can be solved in polynomial time for static observers, and we show that the same is true for dynamic ones. We also solve the problem of dynamic observers' synthesis and prove that a most permissive observer can be computed in doubly exponential time, using a game-theoretic approach. We further investigate optimization problems for dynamic observers and define a notion of cost of an observer.}
}
Downloads: 0
{"_id":"J34jBkmbRHL9Ke7JL","bibbaseid":"cassez-tripakis-faultdiagnosiswithdynamicobservers-2010","author_short":["Cassez, F.","Tripakis, S."],"bibdata":{"bibtype":"article","type":"E - Reports","author":[{"firstnames":["Franck"],"propositions":[],"lastnames":["Cassez"],"suffixes":[]},{"firstnames":["Stavros"],"propositions":[],"lastnames":["Tripakis"],"suffixes":[]}],"title":"Fault Diagnosis with Dynamic Observers","journal":"CoRR","volume":"abs/1004.2810","year":"2010","url":"http://arxiv.org/abs/1004.2810","timestamp":"Mon, 05 Dec 2011 18:05:22 +0100","biburl":"http://dblp.uni-trier.de/rec/bib/journals/corr/abs-1004-2810","bibsource":"dblp computer science bibliography, http://dblp.org","keywords":"fault diagnosis, timed automata","abstract":"In this paper, we review some recent results about the use of dynamic observers for fault diagnosis of discrete event systems. Fault diagnosis consists in synthesizing a diagnoser that observes a given plant and identifies faults in the plant as soon as possible after their occurrence. Existing literature on this problem has considered the case of fixed static observers, where the set of observable events is fixed and does not change during execution of the system. In this paper, we consider dynamic observers: an observer can \"switch\" sensors on or off, thus dynamically changing the set of events it wishes to observe. It is known that checking diagnosability (i.e., whether a given observer is capable of identifying faults) can be solved in polynomial time for static observers, and we show that the same is true for dynamic ones. We also solve the problem of dynamic observers' synthesis and prove that a most permissive observer can be computed in doubly exponential time, using a game-theoretic approach. We further investigate optimization problems for dynamic observers and define a notion of cost of an observer.","bibtex":"@article{DBLP:journals/corr/abs-1004-2810,\n author = {Franck Cassez and\n Stavros Tripakis},\n title = {Fault Diagnosis with Dynamic Observers},\n journal = {CoRR},\n Type = {E - Reports},\n volume = {abs/1004.2810},\n year = {2010},\n url = {http://arxiv.org/abs/1004.2810},\n timestamp = {Mon, 05 Dec 2011 18:05:22 +0100},\n biburl = {http://dblp.uni-trier.de/rec/bib/journals/corr/abs-1004-2810},\n bibsource = {dblp computer science bibliography, http://dblp.org},\n keywords = {fault diagnosis, timed automata},\n\n abstract = {In this paper, we review some recent results about the use of dynamic observers for fault diagnosis of discrete event systems. Fault diagnosis consists in synthesizing a diagnoser that observes a given plant and identifies faults in the plant as soon as possible after their occurrence. Existing literature on this problem has considered the case of fixed static observers, where the set of observable events is fixed and does not change during execution of the system. In this paper, we consider dynamic observers: an observer can \"switch\" sensors on or off, thus dynamically changing the set of events it wishes to observe. It is known that checking diagnosability (i.e., whether a given observer is capable of identifying faults) can be solved in polynomial time for static observers, and we show that the same is true for dynamic ones. We also solve the problem of dynamic observers' synthesis and prove that a most permissive observer can be computed in doubly exponential time, using a game-theoretic approach. We further investigate optimization problems for dynamic observers and define a notion of cost of an observer.}\n}\n\n","author_short":["Cassez, F.","Tripakis, S."],"key":"DBLP:journals/corr/abs-1004-2810","id":"DBLP:journals/corr/abs-1004-2810","bibbaseid":"cassez-tripakis-faultdiagnosiswithdynamicobservers-2010","role":"author","urls":{"Paper":"http://arxiv.org/abs/1004.2810"},"keyword":["fault diagnosis","timed automata"],"metadata":{"authorlinks":{}}},"bibtype":"article","biburl":"http://science.mq.edu.au/~fcassez/bib/franck-bib.bib","dataSources":["8742EsvjQfyP2fYBW","qbqYFWskmoonRB43F"],"keywords":["fault diagnosis","timed automata"],"search_terms":["fault","diagnosis","dynamic","observers","cassez","tripakis"],"title":"Fault Diagnosis with Dynamic Observers","year":2010}