Controllers with Minimal Observation Power (Application to Timed Systems)
Systems and Control
2012-07-06 v1 Computer Science and Game Theory
Logic in Computer Science
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.
Cite
@article{arxiv.1207.1276,
title = {Controllers with Minimal Observation Power (Application to Timed Systems)},
author = {Peter Bulychev and Franck Cassez and Alexandre David and Kim G. Larsen and Jean-Francois Raskin and Pierre-Alain Reynier},
journal= {arXiv preprint arXiv:1207.1276},
year = {2012}
}
Comments
This is the full version of the ATVA'12 paper