We consider the problem of controller synthesis under imper- fect 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 possi- ble 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 algo- rithm on two case studies.
Lecture Notes in Computer Science: 10th International Symposium, Atva 2012, Thiruvananthapuram, India, October 3-6, 2012. Proceedings, 2012, p. 223-237