A Probabilistic Semantics for 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 coincide 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.

[1]  Véronique Bruyère,et al.  On the optimal reachability problem , 2006 .

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

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

[4]  Radha Jagadeesan,et al.  Approximating labelled Markov processes , 2003, Inf. Comput..

[5]  Patricia Bouyer,et al.  On the expressiveness of TPTL and MTL , 2010, Inf. Comput..

[6]  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).

[7]  Thomas A. Henzinger,et al.  Real-time logics: complexity and expressiveness , 1990, [1990] Proceedings. Fifth Annual IEEE Symposium on Logic in Computer Science.

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

[9]  Doron A. Peled,et al.  Calculating Probabilities of Real-Time Test Cases , 2005, FATES.

[10]  Christel Baier,et al.  Model-Checking Algorithms for , 2003 .

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

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

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

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

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

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

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

[18]  Wang Yi,et al.  Uppaal in a nutshell , 1997, International Journal on Software Tools for Technology Transfer.

[19]  Amir Pnueli,et al.  The temporal logic of programs , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).

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

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

[22]  Rajeev Alur,et al.  Model-Checking for Probabilistic Real-Time Systems (Extended Abstract) , 1991, ICALP.

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

[24]  Marta Kwiatkowska,et al.  PRISM 2.0: a tool for probabilistic model checking , 2004 .

[25]  Anuj Puri,et al.  Dynamical Properties of Timed Automata , 1998, Discret. Event Dyn. Syst..

[26]  Thomas A. Henzinger,et al.  A classification of symbolic transition systems , 2000, TOCL.

[27]  Thomas A. Henzinger,et al.  Logics and Models of Real Time: A Survey , 1991, REX Workshop.

[28]  Marta Z. Kwiatkowska,et al.  Automatic verification of real-time systems with discrete probability distributions , 1999, Theor. Comput. Sci..

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

[30]  Joël Ouaknine,et al.  On the decidability of metric temporal logic , 2005, 20th Annual IEEE Symposium on Logic in Computer Science (LICS' 05).

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

[32]  Pierre Wolper,et al.  An Automata-Theoretic Approach to Automatic Program Verification (Preliminary Report) , 1986, LICS.

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

[34]  Stavros Tripakis,et al.  The Tool KRONOS , 1996, Hybrid Systems.

[35]  Thomas A. Henzinger,et al.  Real-Time Logics: Complexity and Expressiveness , 1993, Inf. Comput..

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

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

[38]  Rajeev Alur,et al.  Verifying Automata Specifications of Probabilistic Real-time Systems , 1991, REX Workshop.

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

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

[41]  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.

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

[43]  Jeremy Sproston,et al.  Model Checking for Probabilistic Timed Systems , 2004, Validation of Stochastic Systems.

[44]  Radha Jagadeesan,et al.  Metrics for labelled Markov processes , 2004, Theor. Comput. Sci..

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

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

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

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