Optimal paths in weighted timed automata
Theoretical Computer Science - Logic, semantics and theory of programming
Efficient on-the-fly algorithms for the analysis of timed games
CONCUR 2005 - Concurrency Theory
Improved undecidability results on weighted timed automata
Information Processing Letters
On the optimal reachability problem of weighted timed automata
Formal Methods in System Design
Optimal infinite scheduling for multi-priced timed automata
Formal Methods in System Design
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
Synthesis of Optimal Strategies Using HyTech
Electronic Notes in Theoretical Computer Science (ENTCS)
Model-checking the Secure Release of a Time-locked Secret over a Network
Electronic Notes in Theoretical Computer Science (ENTCS)
Weighted Timed Automata: Model-Checking and Games
Electronic Notes in Theoretical Computer Science (ENTCS)
An optimized MAC layer to physical device mapping methodology
Mobility '09 Proceedings of the 6th International Conference on Mobile Technology, Application & Systems
Improved undecidability results on weighted timed automata
Information Processing Letters
Efficient on-the-fly algorithms for partially observable timed games
FORMATS'07 Proceedings of the 5th international conference on Formal modeling and analysis of timed systems
A Kleene-Schützenberger theorem for weighted timed automata
Theoretical Computer Science
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
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
A game-theoretic approach to fault diagnosis and identification of hybrid systems
Theoretical Computer Science
A faster algorithm for solving one-clock priced timed games
CONCUR'13 Proceedings of the 24th international conference on Concurrency Theory
Automata-theoretic decision of timed games
Theoretical Computer Science
Hi-index | 0.01 |