Model Checking for Turn-Based Probability Epistemic Game Structure

In this paper, a turn-based probability epistemic game structure (TPEGS) is proposed to model knowledge preconditions for actions of system and environment firstly, which is an extension of turn-based synchronous game structures with probabilistic transition. Secondly, we introduce probability operator \( P_{\sim \lambda } \) into alternating temporal epistemic logic (ATEL) and define turn-based probability alternating-time temporal epistemic logic (tPATEL) for model checking the properties of TPEGS quantitatively. The probability of agents knowing some precondition before they implement an action can be expressed in tPATEL. Thirdly, we propose a method to compute probability for model checking verification problems of tPATEL based on DTMC and CTMC, and then analyze the time complexity of the method. Then, we are able to convert a part of tPATEL verification problems into the PATL ones by defining the knowledge formula \( K_{a} \phi ,\, E_{As} \phi \) and \( C_{As} \phi \) as atomic propositions. Finally, we study a flight procedure in STAS using PRISM-games to demonstrate the applicability of the above model checking framework and expand the application field of model checking.

[1]  Barteld P. Kooi,et al.  Probabilistic Dynamic Epistemic Logic , 2003, J. Log. Lang. Inf..

[2]  Thomas A. Henzinger,et al.  Alternating-time temporal logic , 2002, JACM.

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

[4]  Joseph Y. Halpern,et al.  Knowledge, probability, and adversaries , 1993, JACM.

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

[6]  Victor Carreño,et al.  Abstract Model of the Sats Concept of Operations: Initial Results and Recommendations , 2013 .

[7]  Bengt Jonsson,et al.  A logic for reasoning about time and reliability , 1990, Formal Aspects of Computing.

[8]  Mark Ryan,et al.  Logic in Computer Science: Modelling and Reasoning about Systems , 2000 .

[9]  Thomas A. Henzinger,et al.  Symbolic model checking for real-time systems , 1992, [1992] Proceedings of the Seventh Annual IEEE Symposium on Logic in Computer Science.

[10]  Taolue Chen,et al.  Synthesis for Multi-objective Stochastic Games: An Application to Autonomous Urban Driving , 2013, QEST.

[11]  Marta Z. Kwiatkowska,et al.  Computing Cumulative Rewards Using Fast Adaptive Uniformization , 2015, ACM Trans. Model. Comput. Simul..

[12]  James F. Allen Planning as Temporal Reasoning , 1991, KR.

[13]  J. Filar,et al.  Competitive Markov Decision Processes , 1996 .

[14]  Ronald Fagin,et al.  A logic for reasoning about probabilities , 1988, [1988] Proceedings. Third Annual Information Symposium on Logic in Computer Science.

[15]  Rajeev Alur,et al.  Model-Checking in Dense Real-time , 1993, Inf. Comput..

[16]  Chris Thachuk,et al.  DNA Walker Circuits: Computational Potential, Design, and Verification , 2013, DNA.

[17]  Mario R. F. Benevides,et al.  Verification of Epistemic Properties in Probabilistic Multi-Agent Systems , 2009, MATES.

[18]  Jim Gray,et al.  Notes on Data Base Operating Systems , 1978, Advanced Course: Operating Systems.