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

J4 ›› 2015, Vol. 37 ›› Issue (05): 951-957.

• 论文 • Previous Articles     Next Articles

Possibilistic bisimulation based on generalized
possibility measures and its logical characterizations 

ZHANG Xingxing,DENG Nanyi,MA Zhanyou,LI Yongming   

  1. (College of Computer Science,Shaanxi Normal University,Xi’an 710062,China)
  • Received:2014-08-12 Revised:2014-10-16 Online:2015-05-25 Published:2015-05-25

Abstract:

Firstly, we define the syntaxe and semantics of the Generalized Possibilistic Computation Tree Logic’s expansion(GPoCTL*), the Generalized Possibilistic Computation Tree Logic’s reduction (GPoCTL-) and the Generalized Possibilistic Reward Computation Tree Logic(GPoRCTL) in terms of the generalized possibility measures. Based on classical bisimulation and generalized possibility measures, we then discuss the possibilistic bisimulation and their properties. Finally, the equivalence relations among GPoCTL,GPoCTL*,GPoCTL-  and bisimiliar states are proved.

Key words: generalized possibility measure;possibilistic bisimulation;computation tree logic