期刊文献+

基于Petri网的模型检测研究 被引量:20

Research on Model-Checking Based on Petri Nets
在线阅读 下载PDF
导出
摘要 模型检测是关于系统属性验证的算法和方法.它通常采用状态空间搜索的方法来检测一个给定的计算模型是否满足某个用时序逻辑公式表示的特定属性.系统模型的状态空间的爆炸问题是模型检测所面临的主要问题,其主要原因是系统自身的并发特性和状态变迁的语义交织.对基于 Petri 网的模型检测理论和验证技术进行了较为详细的研究,着重探讨了基于 Petri 网状态可达图的偏序简化和偏序语义技术、基于自动机的模型etri 网的状态聚合法以及基于系统对称性的参数化和符号模型检测技术,并给出了研究思路以及未来所要进行的重点研究工作.模型检测技术已在通信协议和硬件系统的验证等领域得到成功应用,并且随着各种状态空间简化技术和模型检测算法的不断优化,其在其他应用领域也展示出广泛的应用前景. Model-Checking is a formal verified technique to check on whether a computing model, by searching the model state spaces, satisfies a given property described by an appropriate temporal logic. The main drawback of model checking, the explosion problem of state spaces, is mainly caused by concurrence and the interleaving semantics used to represent any sequences of possible actions. The correlative model-checking theory and techniques based on Petri Nets are investigated in detailed, especially about the following problems, i.e. partial order reduction and partial order semantics techniques based on the state reachability graph, Buchi automata method, state cohesion method based on Petri Nets, and symbolic and parametrized model-checking techniques based on system symmetries. Moreover, the key idea and our main researching work in the future are listed. With the gradual improvement of reducing techniques of state space and optimization of model-checking algorithm, model-checking technique is successfully applied to verify communication protocols and complex hardware logic circuits, and also takes on a wide application prospect in other fields.
出处 《软件学报》 EI CSCD 北大核心 2004年第9期1265-1276,共12页 Journal of Software
基金 国家自然科学基金 国家高技术研究发展计划(863) 国家重点基础研究发展规划(973)~~
关键词 时序逻辑 PETRI网 状态空间 模型检测 Algorithms Automata theory Logic design Mathematical models Network protocols Optimization Semantics State space methods
  • 相关文献

参考文献45

  • 1[1]Clarke EM, Grumberg O, Peled D. Model Checking. Cambridge: MIT Press, 2001.35~49.
  • 2[2]Sistla AP, Clarke EM. The complexity of propositional linear temporal logics. Journal of the ACM, 1985,32(3):733~749.
  • 3[3]Clarke EM, Emerson EA, Sistla AP. Automatic verification of finite state concurrent system using temporal logical specification.ACM Trans. on Programming Language and Systems, 1986,8(2):244~263.
  • 4[4]Lin C. Computer Network and Computer System Performance Eyaluation. Beijing: Tsinghua University Press, 2001 (in Chinese).
  • 5[5]Emerson EA, Halpern JY. Sometimes and Not Never revisited: On branching versus linear time. Journal of the ACM, 1986,33(1):151~178.
  • 6[6]Girault C, Valk R. Petri Nets for System Engineering: A Guide to Modeling, Verification and Application. Springer-Verlag, 2003.
  • 7[7]Vardi MY. Linear vs. Banching tme-A complexity-theoretic perspective. In: Proc. of the 13th Annual IEEE Symp. on Logic in Computer Science. IEEE Computer Society Press, 1998.94~405.
  • 8[8]Bhat G, Cleaveland R, Grumberg O. Efficient on-the-fly model checking for CTL. In: Proc. of the 10th Annual IEEE Symp. on Logic in Computer Science. IEEE Computer Society Press, 1995. 388~397.
  • 9[9]Bryant RE. Graph-Based algorithms for boolean function manipulation. IEEE Trans. on Computers, 1986,35(8):667~691.
  • 10[10]Burch JR, Clarke EM, McMillan KL, Dill DL, Hwang LJ. Symbolic model checking: 1020 states and beyond. Information and Computation, 1998,2:141~170.

同被引文献235

引证文献20

二级引证文献144

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部