627 search results - page 22 / 126 » Efficient On-the-Fly Algorithms for the Analysis of Timed Ga... |
PEPM
1994
ACM
13 years 11 months ago
1994
ACM
We present an efficient base algorithm for binding-time analysis based on constraint solving and the union-find algorithm. In practice it has been used to handle all of Standard M...
ICCAD
2000
IEEE
13 years 11 months ago
2000
IEEE
ct Static timing analysis has traditionally used the PERT method for identifying the critical path of a digital circuit. Due to the influence of the slope of a signal at a particul...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
Concurrent reachability games is a class of games heavily studied by the computer science community, in particular by the formal methods community. Two standard algorithms for app...
DAC
2005
ACM
13 years 9 months ago
2005
ACM
Variability of process parameters makes prediction of digital circuit timing characteristics an important and challenging problem in modern chip design. Recently, statistical stat...
DATE
2003
IEEE
14 years 20 days ago
2003
IEEE
On-chip communication design includes designing software (SW) parts (operating system, device drivers, interrupt service routines, etc.) as well as hardware (HW) parts (on-chip co...