• 中国计算机学会会刊
  • 中国科技核心期刊
  • 中文核心期刊

J4 ›› 2011, Vol. 33 ›› Issue (9): 70-75.

• 论文 • Previous Articles     Next Articles

Computation Tree Logic Based on Possibility Measure

XUE Yan1,LEI Hongxuan2,LI Yongming1   

  1. (1.School of Computer Science,Shaanxi Normal University,Xi’an 710062;
    2.School of Mathematics and Information Science,Neijiang Normal University,Neijiang 641112,China)
  • Received:2011-05-20 Revised:2011-07-26 Online:2011-09-25 Published:2011-09-25

Abstract:

Firstly, the definition of possibilistic Kripke structure is presented, and the possibility measure space based on it is established. The properties of possibilistic Kripke structure are discussesd, such as the possibility of each path is the infimum of the initial distribution and all of the transisiton possibilities, and the possibility measure which is defined in accordance with the possibilistic Kripke structure is reasonable, etc. Secondly, the possibility computation tree logic (PoCTL) is defined, the equivalence between two PoCTL formulae is studied, and the problems whether some PoCTL formulae are equivalent to some CTL formulae are analyzed. Finally, the persistence property corresponding to PoCTL in CTL*are proved.

Key words: possibilistic Kripke structure;possibility measure;possibility computation tree logic;persistence property