期刊文献+

形式验证中同步时序电路的VHDL描述到S^2-FSM的转换 被引量:3

S 2 FSM:A VERIFICATION ORIENTED MODEL OF SYNCHRONOUS SEQUENTIAL CIRCUITS AND ITS MODELING ALGORITHM
下载PDF
导出
摘要 符号模型检查(SymbolicModelChecking,SMC)是一种有效的形式验证方法.该方法主要有2个难点:一个是建模,即如何建立并用有限内存来表示电路的状态机模型;另一个是在此模型基础上的验证算法.由于验证时间和有限状态机模型的大小是直接相关的,因而模型的大小就成为SMC中的关键问题.本文提出一种基于同步电路行为描述的新的有限状态机模型S2-FSM,并给出从同步电路的VHDL描述建立这种模型的过程.由于该模型的状态转换函数是基于时钟周期的,消去了与时钟无关的大量中间变量,所以同Deharbe提出的模型相比,它的状态数大大减少.若干电路的实验结果表明,该模型由于减少了状态规模,建模时间和可达性分析时间大大减少,效果十分显著. Symbolic Model Checking is the state of the art technique for property verification of sequential circuits. One key issue in the method is how to transform a circuit design to the corresponding FSM model with a compact state space. In this paper we present a new model S 2 FSM, which is specific of synchronous circuits, and give the modeling algorithm from synchronous VHDL descriptions. By fully utilizing the features of synchronous circuits, our model reduces the state variables greatly. Experimental results show that our model has much less states, costs much less CPU time in reachability analysis and makes symbolic model checking more practical.
出处 《计算机辅助设计与图形学学报》 EI CSCD 北大核心 1999年第3期196-199,共4页 Journal of Computer-Aided Design & Computer Graphics
基金 国家"九五"项目 211工程资助
关键词 形式验证 VHDL S^2-FSM 同步时序电路 formal verification symbolic model checking VHDL finite state machine binary decision diagram
  • 相关文献

同被引文献61

  • 1刘涛,李国杰.求解SAT问题的分级重排搜索算法[J].软件学报,1996,7(4):201-210. 被引量:8
  • 2Clarke E M,Grumberg O,Peled D A.Model checking[M].MA: MIT Press, 1999.
  • 3Kenneth L McMillan.Symbolic model checking:An approach to the state explosion problem [D]. Carnegie Mellon University, 1992.
  • 4Bryant R E.Graph-based algorithms for Boolean function manipulation [J]. IEEE Transactions on Computers, 1986,35 (8): 677-691.
  • 5IEEE, IEEE Standard VHDL language reference manual [S]. 1993.
  • 6Das B,Sarkar D,Chattopadhyay S.Model checking on state transition diagram [C]. Proceedings of the 2004 Conference on Asia South Pacific Design Automation: Electronic Design and Solution Fair with EDA Technofair Design Automation Conference Asia and South Pacific.Piscataway, NJ:IEEE Press,2004:412-417.
  • 7Deharbe D,Borrione D.Semantics of a verification-oriented subset ofVHDL[C].Correct Hardware Design and Verification Methods(CHARM E' 95), 1995.
  • 8Herrmann R,Pargmann H.Computing binary decision diagrams for VHDL data types [C]. Proceedings of the Conference on European Design Automation, European Design Automation Conference. Los Alamitos, CA: IEEE Computer Society Press, 1994:578-583.
  • 9Tafertshofer P, Ganz A. SAT based ATPG using fast justification and propagation in the implication graph [A]. In:Proceedings of the 18th IEEE/ACM International Conference on Computer-Aided Design(ICCAD 1999), San Jose, CA, 1999.130-146.
  • 10Prasad M K, et al. Why is ATPG easy? [A]. In: Proceedings of the 36th Design Automation Conference, Berkeley, CA,1999. 22-28.

引证文献3

二级引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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