Model checking for epistemic and temporal properties of uncertain agents

  • Authors:
  • Zining Cao

  • Affiliations:
  • Department of Computer Science and Engineering, Nanjing University of Aero. & Astro., Nanjing, China

  • Venue:
  • PRIMA'06 Proceedings of the 9th Pacific Rim international conference on Agent Computing and Multi-Agent Systems
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper, we introduce a probabilistic epistemic temporal logic, called PETL, which is a combination of temporal logic and probabilistic knowledge logic. The model checking algorithm is given. Furthermore, we present a probabilistic epistemic temporal logic, called μPETL, which generalizes μ-calculus by adding probabilistic knowledge modality. Similar to μ-calculus, μPETL is a succinct and expressive language. It is showed that temporal modalities such as “always”, “sometime” and “until”, and probabilistic knowledge modalities such as “probabilistic knowledge” and “probabilistic common knowledge” can be expressed in such a logic. PETL is proven to be a sublogic of μPETL. The model checking technique for μPETL is also studied.