J4 ›› 2011, Vol. 38 ›› Issue (2): 151-156.doi: 10.3969/j.issn.1001-2400.2011.02.027

• Original Articles • Previous Articles     Next Articles

Stutter-invariant propositional interval temporal logic

YANG Chen1,2,3;DUAN Zhenhua1,2   

  1. (1. Research Inst. of Computing Theory & Technology, Xidian Univ., Xi'an  710071, China;
    2. State Key Lab. of Integrated Service Networks, Xidian Univ., Xi'an  710071, China;
    3. State Key Lab. of Software Eng., Wuhan Univ., Wuhan  430072, China)
  • Received:2010-02-10 Online:2011-04-20 Published:2011-05-26
  • Contact: YANG Chen E-mail:yangchen0216@126.com

Abstract:

To apply the propositional interval temporal logic (PITL) in compositional verification with minor risk of state-exlopsion, a stutter-invariant PITL (PITLst) is proposed, which is structure-related since it inherits the structural relativity of PITL operators much like constructs of imperative programming, such as chop operator for sequential composition and projection opertor for iteration, thus when used as a specification language PITLst can specify the structure of concurrent systems. Moreover, it is shown that PITLst can express all stutter-invariant properties expressible in PITL, so it surpports modular abstraction for compositional verification. In this way, the overall system is of small size, so the risk of state-explosion is accordingly reduced. In addition, an automatic gas station system, as an example, is compositionally verified against PITLst properties, which illustrates that PITLst well supports compositional verfication.

Key words: model checking, temporal logic, state explosion


Baidu
map