An introduction to symbolic dynamics and coding
An introduction to symbolic dynamics and coding
Journal of the ACM (JACM)
Model checking
Communications of the ACM
Dynamic Programming and Optimal Control
Dynamic Programming and Optimal Control
A Discipline of Programming
An Automata-Theoretic Approach to Reasoning about Infinite-State Systems
CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
Structure-preserving binary relations for program abstraction
The essence of computation
A classification of symbolic transition systems
ACM Transactions on Computational Logic (TOCL)
Weighted O-Minimal Hybrid Systems Are More Decidable Than Weighted Timed Automata!
LFCS '07 Proceedings of the international symposium on Logical Foundations of Computer Science
Symbolic dynamic programming for first-order MDPs
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
Synthesis of Optimal Strategies Using HyTech
Electronic Notes in Theoretical Computer Science (ENTCS)
Modeling in Event-B: System and Software Engineering
Modeling in Event-B: System and Software Engineering
A Semiring Approach to Equivalences, Bisimulations and Control
RelMiCS '09/AKA '09 Proceedings of the 11th International Conference on Relational Methods in Computer Science and 6th International Conference on Applications of Kleene Algebra: Relations and Kleene Algebra in Computer Science
Model refinement using bisimulation quotients
AMAST'10 Proceedings of the 13th international conference on Algebraic methodology and software technology
Using bisimulations for optimality problems in model refinement
RAMICS'11 Proceedings of the 12th international conference on Relational and algebraic methods in computer science
| Hi-index | 0.00 |
We develop a symbolic, logic-based technique for constructing optimal control policies in some transition systems where state spaces are large or infinite. These systems are presented as iterations of finite sets of guarded assignments which have costs. The optimality objective is to minimize the total costs of system executions reaching the set characterized by a given target predicate. Guards are predicates and control policies are expressed by tuples of guards. The optimal control policy refines the control policy of the given system. It is generated from the target predicate by an iteration based on backwards induction. This iterative procedure amounts to a variant of the symbolic algorithm generating the reachability precondition; the latter characterizes the states from which some system execution reaches the target set. The main difference is the introduction of greedy and cost-dependent iteration steps.