Skip to main content


Controllers with minimal observation power– application to timed systems


Peter Bulychev, Franck Cassez, Alexandre David, Kim G. Larsen, Jean-Francois Raskin and Pierre-Alain Reynier

Aalborg University


Université Libre de Bruxelles

Laboratoire d’Informatique Fondamentale de Marseille


We consider the problem of controller synthesis under imperfect information in a setting where there is a set of available observable predicates, each of the subset having a cost. 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, uses an on-the-fly algorithm for solving the underlying games with imperfect information and reuses some information between different iterations. We apply our approach to timed systems. We have developed a prototype of tool and show the interest of our optimization algorithm on two case studies.

BibTeX Entry

    publisher        = {Springer},
    isbn             = {978-3-642-33385-9},
    author           = {Bulychev, Peter and Cassez, Franck and David, Alexandre and Larsen, Kim G. and Raskin, Jean-Francois
                        and Reynier, Pierre-Alain},
    month            = oct,
    editor           = {{S. Chakraborty and M. Mukund}},
    year             = {2012},
    keywords         = {control, synthesis, timed automata, partial observation},
    title            = {Controllers with Minimal Observation Power-- Application to Timed Systems},
    booktitle        = {Automated Technology for Verification and Analysis (ATVA) 2012},
    pages            = {223--237},
    address          = {Thiruvananthapuram (Trivandrum), Kerala, India}


Served by Apache on Linux on seL4.