A uniformization-based algorithm for continuous-time stochastic games model checking

Abstract Continuous-time Stochastic Game (CTSG) can be seen as a proper model to analyze probabilistic, non-deterministic, and competitive behaviors as found in Stochastic Multi-Player Game (SMG). The difference is that in an SMG the system under design is analyzed in the discrete-time setting. In comparison, in a CTSG, the system transitions occur in the continuous-time setting with exponentially distributed delays. This paper focuses on the model checking of CTSGs and presents a uniformization-based algorithm, called TPA, to approximate the time-bounded reachability probabilities with an arbitrary error bound. We concentrate on CTSGs with bounded transition rates. To illustrate the strength points of our algorithm, we have implemented it in Java, developed some large examples, and compared our results with the ones from an existing algorithm which is based on discretization. In order to express properties specifying these types of probabilities in the continuous-time setting, we adjusted the existing temporal logic, PATL. Thus, properties like the following can be stated and checked over a CTSG: “A coalition of players has a strategy to guarantee to reach the target states within time bound t ∈ Q ⩾ 0 with a probability equal to or greater than threshold P, regardless of the other players' behaviors.”

[1]  Kensuke Tanaka,et al.  On Markov games with the expeded average reward criterion (II) , 1976 .

[2]  Jan Kretínský,et al.  Continuous-Time Stochastic Games with Time-Bounded Reachability , 2013, FSTTCS.

[3]  Flemming Nielson,et al.  Quantitative Verification and Synthesis of Attack-Defence Scenarios , 2016, 2016 IEEE 29th Computer Security Foundations Symposium (CSF).

[4]  Taolue Chen,et al.  Automatic verification of competitive stochastic systems , 2012, Formal Methods in System Design.

[5]  Lijun Zhang,et al.  Efficient approximation of optimal control for continuous-time Markov games , 2016, Inf. Comput..

[6]  Christel Baier,et al.  Approximate Symbolic Model Checking of Continuous-Time Markov Chains , 1999, CONCUR.

[7]  Greg N. Frederickson,et al.  Sequencing Tasks with Exponential Service Times to Minimize the Expected Flow Time or Makespan , 1981, JACM.

[8]  Lijun Zhang,et al.  Model Checking Algorithms for CTMDPs , 2011, CAV.

[9]  M. Alabdullatif,et al.  Graph Transformation Games for Negotiating Features , 2017 .

[10]  Martin R. Neuhäußer,et al.  Model checking nondeterministic and randomly timed systems , 2010 .

[11]  Massoud Pedram,et al.  Stochastic modeling of a power-managed system-construction andoptimization , 2001, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[12]  Jian Lu,et al.  Probabilistic Alternating-time Temporal Logic and Model Checking Algorithm , 2007, Fourth International Conference on Fuzzy Systems and Knowledge Discovery (FSKD 2007).

[13]  Sven Schewe,et al.  Finite optimal control for time-bounded reachability in CTMDPs and continuous-time Markov games , 2010, Acta Informatica.

[14]  Yoav Shoham,et al.  Essentials of Game Theory: A Concise Multidisciplinary Introduction , 2008, Essentials of Game Theory: A Concise Multidisciplinary Introduction.

[15]  Panagiotis Katsaros,et al.  Solving Influence Problems on the DeGroot Model with a Probabilistic Model Checking Tool , 2016, PCI.

[16]  Calin Belta,et al.  Probabilistic control from time-bounded temporal logic specifications in dynamic environments , 2012, 2012 IEEE International Conference on Robotics and Automation.

[17]  Joost-Pieter Katoen,et al.  Delayed Nondeterminism in Continuous-Time Markov Decision Processes , 2009, FoSSaCS.

[18]  Holger Hermanns,et al.  Optimal Continuous Time Markov Decisions , 2015, ATVA.

[19]  Marta Z. Kwiatkowska,et al.  Stochastic Model Checking , 2007, SFM.

[20]  Sven Schewe,et al.  Optimal time-abstract schedulers for CTMDPs and continuous-time Markov games , 2013, Theor. Comput. Sci..

[21]  Tracy Camp,et al.  A survey of mobility models for ad hoc network research , 2002, Wirel. Commun. Mob. Comput..