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. © 2011 Springer-Verlag.
CITATION STYLE
Bertrand, N., Bouyer, P., Brihaye, T., & Stainer, A. (2011). Emptiness and universality problems in timed automata with positive frequency. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6756 LNCS, pp. 246–257). https://doi.org/10.1007/978-3-642-22012-8_19
Mendeley helps you to discover research relevant for your work.