Probabilistic Timed Automata with One Clock and Initialised Clock-Dependent Probabilities

Clock-dependent probabilistic timed automata extend classical timed automata with discrete probabilistic choice, where the probabilities are allowed to depend on the exact values of the clocks. Previous work has shown that the quantitative reachability problem for clock-dependent probabilistic timed automata with at least three clocks is undecidable. In this paper, we consider the subclass of clock-dependent probabilistic timed automata that have one clock, that have clock dependencies described by affine functions, and that satisfy an initialisation condition requiring that, at some point between taking edges with non-trivial clock dependencies, the clock must have an integer value. We present an approach for solving in polynomial time quantitative and qualitative reachability problems of such one-clock initialised clock-dependent probabilistic timed automata. Our results are obtained by a transformation to interval Markov decision processes.

[1]  Edmund M. Clarke,et al.  Model Checking , 1999, Handbook of Automated Reasoning.

[2]  Krishnendu Chatterjee,et al.  Qualitative Analysis of Partially-Observable Markov Decision Processes , 2009, MFCS.

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

[4]  Stephan Merz,et al.  Model Checking , 2000 .

[5]  Marcin Jurdzinski,et al.  Model Checking Probabilistic Timed Automata with One or Two Clocks , 2007, Log. Methods Comput. Sci..

[6]  Alberto L. Sangiovanni-Vincentelli,et al.  Polynomial-Time Verification of PCTL Properties of MDPs with Convex Uncertainties , 2013, CAV.

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

[8]  Gethin Norman,et al.  Model checking for probabilistic timed automata , 2012, Formal Methods in System Design.

[9]  Ernst Moritz Hahn,et al.  Model checking stochastic hybrid systems , 2012 .

[10]  Lev V. Utkin,et al.  Interval-Valued Finite Markov Chains , 2002, Reliab. Comput..

[11]  Patricia Bouyer,et al.  Stochastic Timed Games Revisited , 2016, MFCS.

[12]  Kim G. Larsen,et al.  Model Checking One-clock Priced Timed Automata , 2007, Log. Methods Comput. Sci..

[13]  Sebastian Junges,et al.  Alternating Weak Automata from Universal Trees , 2019, CONCUR.

[14]  Jeremy Sproston.  Qualitative Reachability for Open Interval Markov Chains , 2018, RP.

[15]  Christel Baier,et al.  Principles of model checking , 2008 .

[16]  P. Varaiya,et al.  What ' s Decidable about Hybrid Automata ? 1 , 1995 .

[17]  Pravin Varaiya,et al.  What's decidable about hybrid automata? , 1995, STOC '95.

[18]  Kim Guldstrand Larsen,et al.  Specification and refinement of probabilistic processes , 1991, [1991] Proceedings Sixth Annual IEEE Symposium on Logic in Computer Science.

[19]  Joost-Pieter Katoen,et al.  Model Checking of Open Interval Markov Chains , 2015, ASMTA.

[20]  Marta Z. Kwiatkowska,et al.  Automated Verification Techniques for Probabilistic Systems , 2011, SFM.

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

[22]  Di Wu,et al.  Reachability analysis of uncertain systems using bounded-parameter Markov decision processes , 2008, Artif. Intell..

[23]  Joël Ouaknine,et al.  Model-Checking for Real-Time Systems , 1995, FCT.

[24]  Christel Baier,et al.  Stochastic Timed Automata , 2014, Log. Methods Comput. Sci..

[25]  Laurent El Ghaoui,et al.  Robust Control of Markov Decision Processes with Uncertain Transition Matrices , 2005, Oper. Res..

[26]  Benjamin Monmege,et al.  Interval iteration algorithm for MDPs and IMDPs , 2017, Theor. Comput. Sci..

[27]  Nathalie Bertrand,et al.  Deciding the Value 1 Problem for Reachability in 1-Clock Decision Stochastic Timed Automata , 2014, QEST.

[28]  Nathalie Bertrand,et al.  Performance Evaluation of Metro Regulations Using Probabilistic Model-Checking , 2019, RSSRail.

[29]  Jan Krcál,et al.  Probabilistic Bisimulations for PCTL Model Checking of Interval MDPs (extended version) , 2014, SynCoP.

[30]  Lijun Zhang,et al.  Synthesis for PCTL in Parametric Markov Decision Processes , 2011, NASA Formal Methods.

[31]  Robert Givan,et al.  Bounded-parameter Markov decision processes , 2000, Artif. Intell..

[32]  Taolue Chen,et al.  On the complexity of model checking interval-valued discrete time Markov chains , 2013, Inf. Process. Lett..

[33]  Ufuk Topcu,et al.  Synthesis of Human-in-the-Loop Control Protocols for Autonomous Systems , 2016, IEEE Transactions on Automation Science and Engineering.

[34]  Jeremy Sproston.  Probabilistic Timed Automata with Clock-Dependent Probabilities , 2017, RP.

[35]  Rocco De Nicola,et al.  Revisiting Trace and Testing Equivalences for Nondeterministic and Probabilistic Processes , 2012, Log. Methods Comput. Sci..

[36]  T. Henzinger,et al.  Model-Checking ω-Regular Properties of Interval Markov Chains , 2008 .

[37]  Mahesh Viswanathan,et al.  Model-Checking Markov Chains in the Presence of Uncertainties , 2006, TACAS.

[38]  John N. Tsitsiklis,et al.  The Complexity of Markov Decision Processes , 1987, Math. Oper. Res..