@inproceedings{atva-12,
  author    = {Peter E. Bulychev and
               Franck Cassez and
               Alexandre David and
               Kim Guldstrand Larsen and
               Jean-François Raskin and
               Pierre-Alain Reynier},
  title     = {Controllers with Minimal Observation Power (Application
               to Timed Systems)},
  booktitle = {Automated Technology for Verification and Analysis - 10th
               International Symposium, ATVA 2012},
  year      = {2012},
  pages     = {223-237},
  urlpaper = {papers/atva-2012.pdf},
  url_link  = {http://dx.doi.org/10.1007/978-3-642-33386-6_19},
  mywebpage = {timed},
  keywords = {timed automata, timed games, control},
  abstract = {
  We consider the problem of controller synthesis under imperfect information in a setting where there is a set of available observable predicates equipped with a cost function. The problem that we address is the computation of a subset of predicates sufficient for control and whose cost is minimal. Our solution avoids a full exploration of all possible subsets of predicates and reuses some information between different iterations. We apply our approach to timed systems. We have developed a tool prototype and analyze the performance of our optimization algorithm on two case studies.
  },
        Type = {B - International Conferences},

}

{"_id":"ggdWL9kf5QfTksB8b","bibbaseid":"bulychev-cassez-david-larsen-raskin-reynier-controllerswithminimalobservationpowerapplicationtotimedsystems-2012","author_short":["Bulychev, P. E.","Cassez, F.","David, A.","Larsen, K. G.","Raskin, J.","Reynier, P."],"bibdata":{"bibtype":"inproceedings","type":"B - International Conferences","author":[{"firstnames":["Peter","E."],"propositions":[],"lastnames":["Bulychev"],"suffixes":[]},{"firstnames":["Franck"],"propositions":[],"lastnames":["Cassez"],"suffixes":[]},{"firstnames":["Alexandre"],"propositions":[],"lastnames":["David"],"suffixes":[]},{"firstnames":["Kim","Guldstrand"],"propositions":[],"lastnames":["Larsen"],"suffixes":[]},{"firstnames":["Jean-François"],"propositions":[],"lastnames":["Raskin"],"suffixes":[]},{"firstnames":["Pierre-Alain"],"propositions":[],"lastnames":["Reynier"],"suffixes":[]}],"title":"Controllers with Minimal Observation Power (Application to Timed Systems)","booktitle":"Automated Technology for Verification and Analysis - 10th International Symposium, ATVA 2012","year":"2012","pages":"223-237","urlpaper":"papers/atva-2012.pdf","url_link":"http://dx.doi.org/10.1007/978-3-642-33386-6_19","mywebpage":"timed","keywords":"timed automata, timed games, control","abstract":"We consider the problem of controller synthesis under imperfect information in a setting where there is a set of available observable predicates equipped with a cost function. The problem that we address is the computation of a subset of predicates sufficient for control and whose cost is minimal. Our solution avoids a full exploration of all possible subsets of predicates and reuses some information between different iterations. We apply our approach to timed systems. We have developed a tool prototype and analyze the performance of our optimization algorithm on two case studies. ","bibtex":"@inproceedings{atva-12,\n author = {Peter E. Bulychev and\n Franck Cassez and\n Alexandre David and\n Kim Guldstrand Larsen and\n Jean-François Raskin and\n Pierre-Alain Reynier},\n title = {Controllers with Minimal Observation Power (Application\n to Timed Systems)},\n booktitle = {Automated Technology for Verification and Analysis - 10th\n International Symposium, ATVA 2012},\n year = {2012},\n pages = {223-237},\n urlpaper = {papers/atva-2012.pdf},\n url_link = {http://dx.doi.org/10.1007/978-3-642-33386-6_19},\n mywebpage = {timed},\n keywords = {timed automata, timed games, control},\n abstract = {\n We consider the problem of controller synthesis under imperfect information in a setting where there is a set of available observable predicates equipped with a cost function. The problem that we address is the computation of a subset of predicates sufficient for control and whose cost is minimal. Our solution avoids a full exploration of all possible subsets of predicates and reuses some information between different iterations. We apply our approach to timed systems. We have developed a tool prototype and analyze the performance of our optimization algorithm on two case studies.\n },\n Type = {B - International Conferences},\n\n}\n\n","author_short":["Bulychev, P. E.","Cassez, F.","David, A.","Larsen, K. G.","Raskin, J.","Reynier, P."],"key":"atva-12","id":"atva-12","bibbaseid":"bulychev-cassez-david-larsen-raskin-reynier-controllerswithminimalobservationpowerapplicationtotimedsystems-2012","role":"author","urls":{"Paper":"http://science.mq.edu.au/~fcassez/bib/papers/atva-2012.pdf"," link":"http://dx.doi.org/10.1007/978-3-642-33386-6_19"},"keyword":["timed automata","timed games","control"],"metadata":{"authorlinks":{}},"downloads":1,"html":""},"bibtype":"inproceedings","biburl":"http://science.mq.edu.au/~fcassez/bib/franck-bib.bib","dataSources":["8742EsvjQfyP2fYBW","qbqYFWskmoonRB43F","yYF8uwWqay28JyxZC"],"keywords":["timed automata","timed games","control"],"search_terms":["controllers","minimal","observation","power","application","timed","systems","bulychev","cassez","david","larsen","raskin","reynier"],"title":"Controllers with Minimal Observation Power (Application to Timed Systems)","year":2012,"downloads":1}