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

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.

[1]  Prakash Panangaden,et al.  Continuous stochastic logic characterizes bisimulation of continuous-time Markov processes , 2003, J. Log. Algebraic Methods Program..

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

[3]  Grégoire Sutre,et al.  An Optimal Automata Approach to LTL Model Checking of Probabilistic Systems , 2003, LPAR.

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

[5]  Philip Wolfe,et al.  Contributions to the theory of games , 1953 .

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

[7]  Nicolas Markey,et al.  Robust Model-Checking of Timed Automata , 2010 .

[8]  J. Kemeny,et al.  Denumerable Markov chains , 1969 .

[9]  Amir Pnueli,et al.  Probabilistic Verification , 1993, Information and Computation.

[10]  Thomas A. Henzinger,et al.  Minimum-Time Reachability in Timed Games , 2007, ICALP.

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

[12]  Joseph Sifakis,et al.  Controller Synthesis for Timed Automata 1 , 1998 .

[13]  Thomas A. Henzinger,et al.  A Comparison of Control Problems for Timed and Hybrid Systems , 2002, HSCC.

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

[15]  Chris M. N. Tofts,et al.  Processes with probabilities, priority and time , 1994, Formal Aspects of Computing.

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

[17]  Moshe Y. Vardi.  Automatic verification of probabilistic concurrent finite state programs , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

[18]  Thomas A. Henzinger,et al.  The Element of Surprise in Timed Games , 2003, CONCUR.

[19]  Stefan Friedrich,et al.  Topology , 2019, Arch. Formal Proofs.

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

[21]  Amir Pnueli,et al.  On the extremely fair treatment of probabilistic algorithms , 1983, STOC.

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

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

[24]  Christel Baier,et al.  On the Verification of Qualitative Properties of Probabilistic Processes under Fairness Constraints , 1998, Inf. Process. Lett..

[25]  Philippe Schnoebelen,et al.  Model Checking Timed Automata with One or Two Clocks , 2004, CONCUR.

[26]  A. Pnueli,et al.  CONTROLLER SYNTHESIS FOR TIMED AUTOMATA , 2006 .

[27]  Daniele Varacca,et al.  Temporal Logics and Model Checking for Fairly Correct Systems , 2006, 21st Annual IEEE Symposium on Logic in Computer Science (LICS'06).

[28]  John C. Oxtoby.  7. THE BANACH-MAZUR GAME AND BANACH CATEGORY THEOREM , 1958 .

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