Model Checking for Turn-Based Probability Epistemic Game Structure

0Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

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~λ 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 Kaφ, EAsφ and CAsφ 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.

Cite

CITATION STYLE

APA

Zheng, G., Wang, P., Zhang, X., Zhang, C., Li, M., Yang, Y., & Xu, W. (2019). Model Checking for Turn-Based Probability Epistemic Game Structure. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 11354 LNCS, pp. 244–256). Springer Verlag. https://doi.org/10.1007/978-3-030-15127-0_25

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free