Theoretical Computer Science
On conciseness of extensions of timed automata
Journal of Automata, Languages and Combinatorics
Updatable Timed Automata with Additive and Diagonal Constraints
CiE '08 Proceedings of the 4th conference on Computability in Europe: Logic and Theory of Algorithms
Analysis and applications of timed service protocols
ACM Transactions on Software Engineering and Methodology (TOSEM)
Quantitative analysis of real-time systems using priced timed automata
Communications of the ACM
Low dimensional hybrid systems - decidable, undecidable, don't know
Information and Computation
Refining the undecidability frontier of hybrid automata
FSTTCS '05 Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical Computer Science
ACM Computing Surveys (CSUR)
Lower-bound-constrained runs in weighted timed automata
Performance Evaluation
| Hi-index | 0.91 |