Bounded Model Checking for Temporal Epistemic Logic in Synchronous Multi-Agent Systems
DOI:
Author:
Affiliation:

Clc Number:

Fund Project:

  • Article
  • |
  • Figures
  • |
  • Metrics
  • |
  • Reference
  • |
  • Related
  • |
  • Cited by
  • |
  • Materials
  • |
  • Comments
    Abstract:

    This paper presents an approach to the verification of temporal epistemic logic in synchronous multi-Agent systems via bounded model checking (BMC). By incorporating epistemic modalities into temporal logic CTL*, a temporal epistemic logic ECKLn is introduced, and it is interpreted under the semantics of synchronous interpreted system. The temporal epistemic expressive power of ECKLn is greater than that of Penczek and Lomuscio’s logic CTLK. Agents’ knowledge interpreted under synchronous semantics can be skillfully attained by the state position function, which avoids extending the encoding of the states and the transition relation of plain temporal epistemic model for time domain. The technical details and the correctness of the BMC method for logic AECKLn/EECKLn (the universal or existential fragment of ECKLn) are given. A case study of train controller system is presented to illustrate the processing of the BMC method.

    Reference
    Related
    Cited by
Get Citation

骆翔宇,苏开乐,杨晋吉.有界模型检测同步多智体系统的时态认知逻辑.软件学报,2006,17(12):2485-2498

Copy
Share
Article Metrics
  • Abstract:
  • PDF:
  • HTML:
  • Cited by:
History
  • Received:February 22,2005
  • Revised:January 09,2006
  • Adopted:
  • Online:
  • Published:
You are the firstVisitors
Copyright: Institute of Software, Chinese Academy of Sciences Beijing ICP No. 05046678-4
Address:4# South Fourth Street, Zhong Guan Cun, Beijing 100190,Postal Code:100190
Phone:010-62562563 Fax:010-62562533 Email:jos@iscas.ac.cn
Technical Support:Beijing Qinyun Technology Development Co., Ltd.

Beijing Public Network Security No. 11040202500063