@article{DBLP:journals/corr/abs-1004-2550,
  author    = {Franck Cassez},
  title     = {The Complexity of Codiagnosability for Discrete Event and Timed Systems},
  journal   = {CoRR},
  Type = {E - Reports},
  volume    = {abs/1004.2550},
  year      = {2010},
  url       = {http://arxiv.org/abs/1004.2550},
  timestamp = {Mon, 05 Dec 2011 18:05:32 +0100},
  biburl    = {http://dblp.uni-trier.de/rec/bib/journals/corr/abs-1004-2550},
  bibsource = {dblp computer science bibliography, http://dblp.org},
      keywords = {fault diagnosis, timed automata},

  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.}
}

{"_id":"tZKY36Mho7QvmHxMC","bibbaseid":"cassez-thecomplexityofcodiagnosabilityfordiscreteeventandtimedsystems-2010","author_short":["Cassez, F."],"bibdata":{"bibtype":"article","type":"E - Reports","author":[{"firstnames":["Franck"],"propositions":[],"lastnames":["Cassez"],"suffixes":[]}],"title":"The Complexity of Codiagnosability for Discrete Event and Timed Systems","journal":"CoRR","volume":"abs/1004.2550","year":"2010","url":"http://arxiv.org/abs/1004.2550","timestamp":"Mon, 05 Dec 2011 18:05:32 +0100","biburl":"http://dblp.uni-trier.de/rec/bib/journals/corr/abs-1004-2550","bibsource":"dblp computer science bibliography, http://dblp.org","keywords":"fault diagnosis, timed automata","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.","bibtex":"@article{DBLP:journals/corr/abs-1004-2550,\n author = {Franck Cassez},\n title = {The Complexity of Codiagnosability for Discrete Event and Timed Systems},\n journal = {CoRR},\n Type = {E - Reports},\n volume = {abs/1004.2550},\n year = {2010},\n url = {http://arxiv.org/abs/1004.2550},\n timestamp = {Mon, 05 Dec 2011 18:05:32 +0100},\n biburl = {http://dblp.uni-trier.de/rec/bib/journals/corr/abs-1004-2550},\n bibsource = {dblp computer science bibliography, http://dblp.org},\n keywords = {fault diagnosis, timed automata},\n\n 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.}\n}\n\n","author_short":["Cassez, F."],"key":"DBLP:journals/corr/abs-1004-2550","id":"DBLP:journals/corr/abs-1004-2550","bibbaseid":"cassez-thecomplexityofcodiagnosabilityfordiscreteeventandtimedsystems-2010","role":"author","urls":{"Paper":"http://arxiv.org/abs/1004.2550"},"keyword":["fault diagnosis","timed automata"],"metadata":{"authorlinks":{}}},"bibtype":"article","biburl":"http://science.mq.edu.au/~fcassez/bib/franck-bib.bib","dataSources":["8742EsvjQfyP2fYBW","qbqYFWskmoonRB43F","yYF8uwWqay28JyxZC"],"keywords":["fault diagnosis","timed automata"],"search_terms":["complexity","codiagnosability","discrete","event","timed","systems","cassez"],"title":"The Complexity of Codiagnosability for Discrete Event and Timed Systems","year":2010}