Theoretical Computer Science
Automatic verification of real-time systems with discrete probability distributions
Theoretical Computer Science
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
On the Decidability of Metric Temporal Logic
LICS '05 Proceedings of the 20th Annual IEEE Symposium on Logic in Computer Science
Optimal infinite scheduling for multi-priced timed automata
Formal Methods in System Design
Almost-Sure Model Checking of Infinite Paths in One-Clock Timed Automata
LICS '08 Proceedings of the 2008 23rd Annual IEEE Symposium on Logic in Computer Science
On Omega-Languages Defined by Mean-Payoff Conditions
FOSSACS '09 Proceedings of the 12th International Conference on Foundations of Software Science and Computational Structures: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009
Volume and Entropy of Regular Timed Languages: Discretization Approach
CONCUR 2009 Proceedings of the 20th International Conference on Concurrency Theory
ACM Transactions on Computational Logic (TOCL)
Mean-payoff automaton expressions
CONCUR'10 Proceedings of the 21st international conference on Concurrency theory
Frequencies in forgetful timed automata
FORMATS'12 Proceedings of the 10th international conference on Formal Modeling and Analysis of Timed Systems
Hi-index | 0.00 |
The languages of infinite timed words accepted by timed automata are traditionally defined using Büchi-like conditions. These acceptance conditions focus on the set of locations visited infinitely often along a run, but completely ignore quantitative timing aspects. In this paper we propose a natural quantitative semantics for timed automata based on the so-called frequency, which measures the proportion of time spent in the accepting locations. We study various properties of timed languages accepted with positive frequency, and in particular the emptiness and universality problems.