The propositional projection temporal logic(PPTL)has more expressive power than other linear temporal logics
for example
the propositional linear-time temporal logic(PLTL)
and thus is more suitable for use as a specification language in model checking. Hence
a key technique for PPTL model checker is presented. The model checker interprets a ProMeLa model S as a Büchi automaton AS
and transforms PPTL property P to an automaton AP.In order to determine whether S satisfies P or not
the product of automata AS and AP is computed and it is checked whether the product automaton accepts the empty word or not. The checking algorithm is implemented based on SPIN. However
since PPTL contains both finite and infinite models
SPIN cannot be used off-the-shelf. To cope with the problem
the related algorithm in SPIN is modified to support PPTL. Experimental results show that the PPTL model checker can effectively perform model checking against PPTL properties.
关键词
Keywords
references
MIAO Huaikou, ZENG Hongwei. Model checking-based verification of web application [C]∥ICECCS 2007.Piscataway, NJ, USA: IEEE Computer Society Press,2007: 47-55.
WANG Xiaobing, DUAN Zhenhua. Projection temporal logic oriented model checking for web services [J]. Journal of Xi'an Jiaotong University, 2009, 43(4): 39-44.
MEI Jia, MIAO Huaikou, LIU Pan. Applying SMV for security protocol verification [J]. Information Technology Journal, 2009, 8(7):1065-1070.
SHU Xinfeng; DUAN Zhenhua. Modeling and verification of processes scheduling based on projection temporal logic for multi core CPU [J]. Journal of Xi'an Jiaotong University, 2010, 44(3): 52-57.
HOLZMANN G J. The SPIN model checker: primer and reference manual [M]. Reading, Massachusetts, USA: Addison-Wesley, 2003.
LICHTENSTEIN O, PNUELI A. Checking that finite state concurrent programs satisfy their linear specification [C]// Proceedings of the 12th Annual ACM Symposium on Principles of Programming Languages.New York, USA: ACM Press, 1985: 97-107.
DUAN Zhenhua, TIAN Cong, ZHANG Li. A decision procedure for propositional projection temporal logic with infinite models [J]. Acta Informatica, 2008, 45(1): 43-78.
SCHNEIDER F B. Decomposing properties into safety and liveness using predicate logic, TR 87-874 [R]. Ithaca, NY, USA: Cornell University. Computer Science Department, 1987.