<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<item>
  <id>06109372</id>
  <dt>a</dt>
  <an>06109372</an>
  <augroup>
    <au>Bulychev, Peter</au>
    <au>Cassez, Franck</au>
    <au>David, Alexandre</au>
    <au>Larsen, Kim Guldstrand</au>
    <au>Raskin, Jean-Fran\c{c}ois</au>
    <au>Reynier, Pierre-Alain</au>
  </augroup>
  <ti>Controllers with minimal observation power (application to timed systems).</ti>
  <so>Chakraborty, Supratik (ed.) et al., Automated technology for verification and analysis. 10th international symposium, ATVA 2012, Thiruvananthapuram, India, October 3--6, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-33385-9/pbk). Lecture Notes in Computer Science 7561, 223-237 (2012).</so>
  <py>2012</py>
  <pu>Berlin: Springer</pu>
  <lagroup>
    <la>EN</la>
  </lagroup>
  <ccgroup>
  </ccgroup>
  <utgroup>
  </utgroup>
  <cigroup>
  </cigroup>
  <ligroup>
    <li>doi:10.1007/978-3-642-33386-6_19</li>
  </ligroup>
  <abgroup>
    <ab>Summary: 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.</ab>
    <rv></rv>
  </abgroup>
</item>