Almost-Sure Model Checking of Infinite Paths in One-Clock Timed Automata

Authors:
Christel Baier;Nathalie Bertrand;Patricia Bouyer;Thomas Brihaye;Marcus GröBer
Affiliations:
-;-;-;-;-
Venue:
LICS '08 Proceedings of the 2008 23rd Annual IEEE Symposium on Logic in Computer Science
Year:
2008

Citing 0
Cited 10

Reachability in Stochastic Timed Games

ICALP '09 Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II
Stochastic real-time games with qualitative timed automata objectives

CONCUR'10 Proceedings of the 21st international conference on Concurrency theory
Measuring performance of continuous-time stochastic processes using timed automata

Proceedings of the 14th international conference on Hybrid systems: computation and control
Efficient CTMC model checking of linear real-time objectives

TACAS'11/ETAPS'11 Proceedings of the 17th international conference on Tools and algorithms for the construction and analysis of systems: part of the joint European conferences on theory and practice of software
Emptiness and universality problems in timed automata with positive frequency

ICALP'11 Proceedings of the 38th international conference on Automata, languages and programming - Volume Part II
Fair adversaries and randomization in two-player games

FOSSACS'10 Proceedings of the 13th international conference on Foundations of Software Science and Computational Structures
Defining Fairness in Reactive and Concurrent Systems

Journal of the ACM (JACM)
Playing optimally on timed automata with random delays

FORMATS'12 Proceedings of the 10th international conference on Formal Modeling and Analysis of Timed Systems
Frequencies in forgetful timed automata

FORMATS'12 Proceedings of the 10th international conference on Formal Modeling and Analysis of Timed Systems
Transient analysis of networks of stochastic timed automata using stochastic state classes

QEST'13 Proceedings of the 10th international conference on Quantitative Evaluation of Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.