[1] Moszkowski B C. Executing Temporal Logic [D]. Cambridge: Department of Computer Science, Cambridge University, 1986.
[2] 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: ACM, 1985: 97-107.
[3] Clarke E M, Long D, McMillan K. Compositional Model Checking [C]//Proc LICS'89. New York: IEEE Press, 1986: 353-362.
[4] 曾红卫, 缪淮扣. 构件组合的抽象精化验证 [J]. 软件学报,2008 19(5): 1149-1159.
Zeng Hongwei, Miao Huaikou. Verification of Component Composition Based on Abstraction Refinement [J]. Journal of Software, 2008, 19(5): 1149-1159.
[5] Holzmann GJ. The Spin Model Checker: Primer and Reference Manual [M]. New York: Addison-Wesley, 2003.
[6] Valmari A. The State Explosion Problem [J]. Lecture Notes in Computer Science, Springer-Verlag, 1998(1491): 429-528.
[7] 杨琛. 基于进程代数并发系统的建模与验证研究 [D]. 西安: 西北大学,2006.
[8] Peled D, Wilke T. Stutter-Invariant Temporal Properties are Expressible without the Next-Time Operator [J]. Information Processing Letter, 1997, 63(6):243-246.
[9] 张海滨, 段振华. 区间时序逻辑的模型检查 [J]. 西安电子科技大学学报, 2009, 36(2): 338-342.
Zhang Haibing, Duan Zhenhua. Model Checking Interval Temporal Logic [J]. Journal of Xidian University, 2009, 36(2): 338-342.
[10] Bowman H, Thompson S J. A Decision Procedure and Complete Axiomatization of Finite Interval Temporal Logic with Projection [J]. Journal of Logic and Computation, 2003, 13(2):195-239.
[11] Helmbold D, Luckham D. Debugging Ada Tasking Programs [J]. IEEE Software, 1985, 2(2): 47-57.
[12] Hoare CAR. Communicating Sequential Processes [M]. London: Prentice Hall, 1985. |