Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

12

FORMATS
2003
Springer

favoriteEmaildiscussreport

85views Formal Methods» more FORMATS 2003»

On Timing Analysis of Combinational Circuits

13 years 9 months ago

On Timing Analysis of Combinational Circuits

Download www-verimag.imag.fr

In this paper we report some progress in applying timed automata technology to large-scale problems. We focus on the problem of ﬁnding maximal stabilization time for combinational circuits whose inputs change only once and hence they can be modeled using acyclic timed automata. We develop a “divideand-conquer” methodology based on decomposing the circuit into sub-circuits and using timed automata analysis tools to build conservative low-complexity approximations of the sub-circuits to be used as inputs for the rest of the system. Some preliminary results of this methodology are reported.

Ramzi Ben Salah, Marius Bozga, Oded Maler

Real-time Traffic

Acyclic Timed Automata | Automata Technology | FORMATS 2003 | Maximal Stabilization Time |

claim paper

Related Content

» Approximate timing analysis of combinational circuits under the XBD0 model

» Timing analysis of asynchronous circuits using timed automata

» WAVSTAN waveform based variational static timing analysis

» Circuit optimization using statistical static timing analysis

» Design as you see FIT Systemlevel soft error analysis of sequential circuits

» A lineartime approach for static timing analysis covering all process corners

» Symbolic functional and timing verification of transistorlevel circuits

» FASER Fast Analysis of Soft Error Susceptibility for CellBased Designs

» SoftError Tolerance Analysis and Optimization of Nanometer Circuits

Post Info
More Details (n/a)

Added	06 Jul 2010
Updated	06 Jul 2010
Type	Conference
Year	2003
Where	FORMATS
Authors	Ramzi Ben Salah, Marius Bozga, Oded Maler

Comments (0)