Quantitative Model-Checking of One-Clock Timed Automata under Probabilistic Semantics

In a probabilistic semantics for timed automata has been defined in order to rule out unlikely (sequences of) events. The qualitative model-checking problem for LTL properties has been investigated, where the aim is to check whether a given LTL property holds with probability 1 in a timed automaton, and solved for the class of single-clock timed automata. In this paper, we consider the quantitative model-checking problem for omega-regular properties: we aim at computing the exact probability that a given timed automaton satisfies an omega-regular property. We develop a framework in which we can compute a closed-form expression for this probability; we furthermore give an approximation algorithm,and finally prove that we can decide the threshold problem in that framework.

[1]  Dietmar Berwanger,et al.  Admissibility in Infinite Games , 2007, STACS.

[2]  Rajeev Alur,et al.  A Theory of Timed Automata , 1994, Theor. Comput. Sci..

[3]  Thomas A. Henzinger,et al.  Robust Timed Automata , 1997, HART.

[4]  John Odentrantz,et al.  Markov Chains: Gibbs Fields, Monte Carlo Simulation, and Queues , 2000, Technometrics.

[5]  Christel Baier,et al.  Probabilistic and Topological Semantics for Timed Automata , 2007, FSTTCS.

[6]  Krishnendu Chatterjee,et al.  Concurrent games with tail objectives , 2006, Theor. Comput. Sci..

[7]  Javier Esparza,et al.  Model checking probabilistic pushdown automata , 2004, Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science, 2004..

[8]  Jean-François Raskin,et al.  Almost ASAP semantics: from timed models to timed implementations , 2005, Formal Aspects of Computing.

[9]  Patricia Bouyer,et al.  Robust Model-Checking of Linear-Time Properties in Timed Automata , 2006, LATIN.

[10]  Rajeev Alur,et al.  Perturbed Timed Automata , 2005, HSCC.

[11]  Thomas A. Henzinger,et al.  Robust Undecidability of Timed and Hybrid Systems , 2000, HSCC.

[12]  Eryk Kopczynski,et al.  Omega-Regular Half-Positional Winning Conditions , 2007, CSL.

[13]  Fred Kröger,et al.  Temporal Logic of Programs , 1987, EATCS Monographs on Theoretical Computer Science.

[14]  Christel Baier,et al.  Almost-Sure Model Checking of Infinite Paths in One-Clock Timed Automata , 2008, 2008 23rd Annual IEEE Symposium on Logic in Computer Science.

[15]  Patricia Bouyer,et al.  Robust Analysis of Timed Automata via Channel Machines , 2008, FoSSaCS.

[16]  Nicolas Markey,et al.  Robustness and Implementability of Timed Automata , 2004, FORMATS/FTRTFT.

[17]  Alexander Moshe Rabinovich,et al.  Quantitative Analysis of Probabilistic Lossy Channel Systems , 2003, ICALP.

[18]  Christel Baier,et al.  Model-Checking Algorithms for Continuous-Time Markov Chains , 2002, IEEE Trans. Software Eng..

[19]  Mihalis Yannakakis,et al.  The complexity of probabilistic verification , 1995, JACM.