Verification of asynchronous circuits using time Petri net unfolding
暂无分享,去创建一个
[1] Bin Zhou,et al. Verification of Bounded Delay Asynchronous Circuits with Timed Traces , 1999, AMAST.
[2] Rajeev Alur,et al. A Theory of Timed Automata , 1994, Theor. Comput. Sci..
[3] P. Merlin,et al. Recoverability of Communication Protocols - Implications of a Theoretical Study , 1976, IEEE Transactions on Communications.
[4] M. Diaz,et al. Modeling and Verification of Time Dependent Systems Using Time Petri Nets , 1991, IEEE Trans. Software Eng..
[5] Walter Vogler,et al. An Improvement of McMillan's Unfolding Algorithm , 1996, Formal Methods Syst. Des..
[6] Sérgio Vale Aguiar Campos,et al. Symbolic Model Checking , 1993, CAV.
[7] Henrik Hulgaard. Timing analysis and verification of timed asynchronous circuits , 1996 .
[8] Alex Yakovlev,et al. Combining partial orders and symbolic traversal for efficient verification of asynchronous circuits , 1995, Proceedings of ASP-DAC'95/CHDL'95/VLSI'95 with EDA Technofair.
[9] Alexandre Yakovlev,et al. Signal Graphs: From Self-Timed to Timed Ones , 1985, PNPM.
[10] Tomas Rokicki. Representing and modeling digital circuits , 1994 .