Dependent Latch Identification in the Reachable State Space
碩士 === 國立清華大學 === 資訊工程學系 === 96 === The large number of latches in current designs increase the complexity of formal verification and logic synthesis. The reason for this is that the growth of latch number leads the state space to explode exponentially. One solution to this problem is to find the fu...
Main Authors: | Chen-Hsuan Lin, 林辰軒 |
---|---|
Other Authors: | Chun-Yao Wang |
Format: | Others |
Language: | en_US |
Published: |
2008
|
Online Access: | http://ndltd.ncl.edu.tw/handle/91896427385123823516 |
Similar Items
-
On state-space compression and state reachability retrieval of Petri nets
by: Huorong Ren, et al.
Published: (2019-02-01) -
CMOS latch-up simulation
by: LIN, JI-SHAO, et al.
Published: (1992) -
Smooth muscle molecular mechanics in the latch-state
by: Roman, Horia Nicolae
Published: (2014) -
The Phonological Latching Network
by: Joe Stephen Bratsvedal Collins
Published: (2021-03-01) -
On exploring even reachable global state space to verify deadlock freedom of protocols.
by: Nguyen, Tuong M.
Published: (2009)