Logic in Computer Science, Symposium on (2008)
June 24, 2008 to June 27, 2008
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/LICS.2008.25
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-clocktimed automata in NLOGSPACE.
C. Baier, N. Bertrand, M. Gr?Ber, T. Brihaye and P. Bouyer, "Almost-Sure Model Checking of Infinite Paths in One-Clock Timed Automata," 23rd Annual IEEE Symposium on Logic in Computer Science (LICS 2008)(LICS), Pittsburgh, PA, 2008, pp. 217-226.