Theoretical Computer Science
A shorter model theory
Hybrid Automata with Finite Bisimulatioins
ICALP '95 Proceedings of the 22nd International Colloquium on Automata, Languages and Programming
Minimum-Cost Reachability for Priced Timed Automata
HSCC '01 Proceedings of the 4th International Workshop on Hybrid Systems: Computation and Control
Optimal Paths in Weighted Timed Automata
HSCC '01 Proceedings of the 4th International Workshop on Hybrid Systems: Computation and Control
Optimal-Reachability and Control for Acyclic Weighted Timed Automata
TCS '02 Proceedings of the IFIP 17th World Computer Congress - TC1 Stream / 2nd IFIP International Conference on Theoretical Computer Science: Foundations of Information Technology in the Era of Networking and Mobile Computing
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
A classification of symbolic transition systems
ACM Transactions on Computational Logic (TOCL)
Control in o-minimal Hybrid Systems
LICS '06 Proceedings of the 21st Annual IEEE Symposium on Logic in Computer Science
On model-checking timed automata with stopwatch observers
Information and Computation
Improved undecidability results on weighted timed automata
Information Processing Letters
On the expressiveness and decidability of o-minimal hybrid systems
Journal of Complexity - Festschrift for the 70th birthday of Arnold Schönhage
Model-checking one-clock priced timed automata
FOSSACS'07 Proceedings of the 10th international conference on Foundations of software science and computational structures
Almost optimal strategies in one clock priced timed games
FSTTCS'06 Proceedings of the 26th international conference on Foundations of Software Technology and Theoretical Computer Science
Upper and lower bounds on sizes of finite bisimulations of pfaffian hybrid systems
CiE'06 Proceedings of the Second conference on Computability in Europe: logical Approaches to Computational Barriers
FORMATS'05 Proceedings of the Third international conference on Formal Modeling and Analysis of Timed Systems
Reachability problems on extended o-minimal hybrid automata
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
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II
Synthesis of Optimal Control Policies for Some Infinite-State Transition Systems
MPC '08 Proceedings of the 9th international conference on Mathematics of Program Construction
Average-Price and Reachability-Price Games on Hybrid Automata with Strong Resets
FORMATS '08 Proceedings of the 6th international conference on Formal Modeling and Analysis of Timed Systems
Average-Price-per-Reward Games on Hybrid Automata with Strong Resets
VMCAI '09 Proceedings of the 10th International Conference on Verification, Model Checking, and Abstract Interpretation
HSCC '09 Proceedings of the 12th International Conference on Hybrid Systems: Computation and Control
Specifications for decidable hybrid games
Theoretical Computer Science
| Hi-index | 0.00 |
We consider weighted o-minimal hybrid systems, which extend classical o-minimal hybrid systems with cost functions. These cost functions are "observer variables" which increase while the system evolves but do not constrain the behaviour of the system. In this paper, we prove two main results: (i) optimal o-minimal hybrid games are decidable; (ii) the model-checking of WCTL, an extension of CTL which can constrain the cost variables, is decidable over that model. This has to be compared with the same problems in the framework of timed automata where both problems are undecidable in general, while they are decidable for the restricted class of one-clock timed automata.