Fixed-point semantics of computation tree logic based on generalized possibility measures
DENG Nanyi, ZHANG Xingxing, LI Yongming*
(School of Computer Science, Shaanxi Normal University,Xi′an 710119, Shaanxi, China)
Abstract:
Fixed-point semantics of computation tree logic plays an important role in symbolic model checking.Fixed-point semantics of generalized possibilistic computation tree logic is presented, then the greatest or least fixed-point is shown by the method of mathematical induction, which is different from the form in classical model checking.
KeyWords:
generalized possibility measures;computation tree logic; fixed-point characterization;model checking
