%0 Conference Proceedings
%F BBBBG-lics08
%A Baier, Ch.
%A Bertrand, N.
%A Bouyer, P.
%A Brihaye, Th.
%A Groesser, M.
%T Almost-Sure Model Checking of Infinite Paths in One-Clock Timed Automata
%B {P}roceedings of the 23rd {A}nnual {IEEE} {S}ymposium on {L}ogic in {C}omputer {S}cience ({LICS}'08)
%P 217-226
%I IEEE Computer Society Press
%C Pittsburgh, PA, USA
%X In this paper, we define two relaxed semantics (one based on probabilities and the other one based on the topological notion of largeness) for LTL over infinite runs of timed automata which rule out unlikely sequences of events. We prove that these two semantics match in the framework of single-clock timed automata (and only in that framework), and prove that the corresponding relaxed model-checking problems are PSPACE-Complete. Moreover, we prove that the probabilistic non-Zenoness can be decided for single-clock timed automata in NLOGSPACE
%U http://www.irisa.fr/vertecs/Publis/Ps/BBBBG-lics08.pdf
%U http://dx.doi.org/10.1109/LICS.2008.25
%8 June
%D 2008