Theoretical Computer Science
The complexity of mean payoff games on graphs
Theoretical Computer Science
Efficient on-the-fly algorithms for the analysis of timed games
CONCUR 2005 - Concurrency Theory
On the optimal reachability problem of weighted timed automata
Formal Methods in System Design
Controller Synthesis with Budget Constraints
HSCC '08 Proceedings of the 11th international workshop on Hybrid Systems: Computation and Control
Automatic Synthesis of Robust and Optimal Controllers --- An Industrial Case Study
HSCC '09 Proceedings of the 12th International Conference on Hybrid Systems: Computation and Control
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
UPPAAL-Tiga: time for playing games!
CAV'07 Proceedings of the 19th international conference on Computer aided verification
Timed control with observation based and stuttering invariant strategies
ATVA'07 Proceedings of the 5th international conference on Automated technology for verification and analysis
Flexible timeline-based plan verification
KI'09 Proceedings of the 32nd annual German conference on Advances in artificial intelligence
QUASY: quantitative synthesis tool
TACAS'11/ETAPS'11 Proceedings of the 17th international conference on Tools and algorithms for the construction and analysis of systems: part of the joint European conferences on theory and practice of software
A hierarchical approach for the synthesis of stabilizing controllers for hybrid systems
ATVA'11 Proceedings of the 9th international conference on Automated technology for verification and analysis
TGA-based controllers for flexible plan execution
KI'11 Proceedings of the 34th Annual German conference on Advances in artificial intelligence
FORMATS'05 Proceedings of the Third international conference on Formal Modeling and Analysis of Timed Systems
Optimal strategies in priced timed game automata
FSTTCS'04 Proceedings of the 24th international conference on Foundations of Software Technology and Theoretical Computer Science
Hi-index | 0.00 |
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.