Abstract
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.
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.
Original language | English |
---|---|
Title of host publication | Automated Technology for Verification and Analysis : 10th International Symposium, ATVA 2012, Thiruvananthapuram, India, October 3-6, 2012. Proceedings |
Number of pages | 15 |
Volume | 7561 |
Publisher | Springer |
Publication date | Oct 2012 |
Pages | 223-237 |
ISBN (Print) | 978-3-642-33385-9 |
ISBN (Electronic) | 978-3-642-33386-6 |
DOIs | |
Publication status | Published - Oct 2012 |
Event | 10th International Symposium, ATVA 2012 - Thiruvananthapuram, India Duration: 3 Oct 2012 → 6 Oct 2012 Conference number: 10th |
Conference
Conference | 10th International Symposium, ATVA 2012 |
---|---|
Number | 10th |
Country/Territory | India |
City | Thiruvananthapuram |
Period | 03/10/2012 → 06/10/2012 |
Series | Lecture Notes in Computer Science |
---|---|
Volume | 7561 |
ISSN | 0302-9743 |