@inproceedings{DBLP:conf/atva/Cassez10,
  author    = {Franck Cassez},
  title     = {The Complexity of Codiagnosability for Discrete Event and Timed Systems (Extended abstract)},
  booktitle = {Automated Technology for Verification and Analysis - 8th International
               Symposium, {ATVA} 2010, Singapore, September 21-24, 2010. Proceedings},
  pages     = {82--96},
  year      = {2010},
  editor    = {Ahmed Bouajjani and
               Wei{-}Ngan Chin},
  urlpaper = {papers/atva-10.pdf},
  xxee = {http://arxiv.org/abs/1004.2550},
  xxurl       = {http://dx.doi.org/10.1007/978-3-642-15643-4_8},
  doi       = {10.1007/978-3-642-15643-4_8},
 series    = {Lecture Notes in Computer Science},
  volume    = {6252},
   mywebpage = {diagnosis},
  show = {},
  publisher = {Springer},
  keywords = {diagnosis, complexity, 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.},
        Type = {B - International Conferences},

  }

{"_id":"vXb3MFrxg9fnR2jMH","bibbaseid":"cassez-thecomplexityofcodiagnosabilityfordiscreteeventandtimedsystemsextendedabstract-2010","author_short":["Cassez, F."],"bibdata":{"bibtype":"inproceedings","type":"B - International Conferences","author":[{"firstnames":["Franck"],"propositions":[],"lastnames":["Cassez"],"suffixes":[]}],"title":"The Complexity of Codiagnosability for Discrete Event and Timed Systems (Extended abstract)","booktitle":"Automated Technology for Verification and Analysis - 8th International Symposium, ATVA 2010, Singapore, September 21-24, 2010. Proceedings","pages":"82–96","year":"2010","editor":[{"firstnames":["Ahmed"],"propositions":[],"lastnames":["Bouajjani"],"suffixes":[]},{"firstnames":["Wei-Ngan"],"propositions":[],"lastnames":["Chin"],"suffixes":[]}],"urlpaper":"papers/atva-10.pdf","xxee":"http://arxiv.org/abs/1004.2550","xxurl":"http://dx.doi.org/10.1007/978-3-642-15643-4_8","doi":"10.1007/978-3-642-15643-4_8","series":"Lecture Notes in Computer Science","volume":"6252","mywebpage":"diagnosis","show":"","publisher":"Springer","keywords":"diagnosis, complexity, 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":"@inproceedings{DBLP:conf/atva/Cassez10,\n author = {Franck Cassez},\n title = {The Complexity of Codiagnosability for Discrete Event and Timed Systems (Extended abstract)},\n booktitle = {Automated Technology for Verification and Analysis - 8th International\n Symposium, {ATVA} 2010, Singapore, September 21-24, 2010. Proceedings},\n pages = {82--96},\n year = {2010},\n editor = {Ahmed Bouajjani and\n Wei{-}Ngan Chin},\n urlpaper = {papers/atva-10.pdf},\n xxee = {http://arxiv.org/abs/1004.2550},\n xxurl = {http://dx.doi.org/10.1007/978-3-642-15643-4_8},\n doi = {10.1007/978-3-642-15643-4_8},\n series = {Lecture Notes in Computer Science},\n volume = {6252},\n mywebpage = {diagnosis},\n show = {},\n publisher = {Springer},\n keywords = {diagnosis, complexity, timed automata},\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 Type = {B - International Conferences},\n\n }\n\n","author_short":["Cassez, F."],"editor_short":["Bouajjani, A.","Chin, W."],"key":"DBLP:conf/atva/Cassez10","id":"DBLP:conf/atva/Cassez10","bibbaseid":"cassez-thecomplexityofcodiagnosabilityfordiscreteeventandtimedsystemsextendedabstract-2010","role":"author","urls":{"Paper":"http://science.mq.edu.au/~fcassez/bib/papers/atva-10.pdf"},"keyword":["diagnosis","complexity","timed automata"],"metadata":{"authorlinks":{}}},"bibtype":"inproceedings","biburl":"http://science.mq.edu.au/~fcassez/bib/franck-bib.bib","dataSources":["8742EsvjQfyP2fYBW","qbqYFWskmoonRB43F"],"keywords":["diagnosis","complexity","timed automata"],"search_terms":["complexity","codiagnosability","discrete","event","timed","systems","extended","abstract","cassez"],"title":"The Complexity of Codiagnosability for Discrete Event and Timed Systems (Extended abstract)","year":2010}