Sciweavers

1795 search results - page 70 / 359
» On the Complexity of Circuit Satisfiability
Sort
View
COCOON
2003
Springer
14 years 2 months ago
Petri Nets with Simple Circuits
We study the complexity of the reachability problem for a new subclass of Petri nets called simple-circuit Petri nets, which properly contains several well known subclasses such as...
Hsu-Chun Yen, Lien-Po Yu
ICCAD
1994
IEEE
82views Hardware» more  ICCAD 1994»
14 years 27 days ago
A timing analysis algorithm for circuits with level-sensitive latches
For a logic design with level-sensitive latches, we need to validate timing signal paths which may flush through several latches. We developed efficient algorithms based on the mo...
Jin-fuw Lee, Donald T. Tang, C. K. Wong
WCE
2007
13 years 10 months ago
Avoiding Hazards for Speed-Independent Logic Design
- In the speed-independent logic, the hazards caused by input inverters are identified. The known methods of the elimination of such hazards are based on avoiding input inverters. ...
Igor Lemberski
BIB
2008
93views more  BIB 2008»
13 years 8 months ago
A structured approach for the engineering of biochemical network models, illustrated for signalling pathways
Quantitative models of biochemical networks (signal transduction cascades, metabolic pathways, gene regulatory circuits) are a central component of modern systems biology. Buildin...
Rainer Breitling, David Gilbert, Monika Heiner, Ri...
ISCAS
2007
IEEE
138views Hardware» more  ISCAS 2007»
14 years 3 months ago
A Performance Driven Layout Compaction Optimization Algorithm for Analog Circuits
-- In interconnect-dominated designs, the ability to minimize layout-induced parasitic effects is crucial for rapid design closure. Deep sub-micron effects and ubiquitous interfere...
Henry H. Y. Chan, Zeljko Zilic