Sciweavers

4679 search results - page 160 / 936
» The Timely Computing Base Model and Architecture
Sort
View
SPAA
2005
ACM
15 years 3 months ago
Parallelizing time with polynomial circuits
We study the problem of asymptotically reducing the runtime of serial computations with circuits of polynomial size. We give an algorithmic size-depth tradeoff for parallelizing ...
Ryan Williams
DATE
2006
IEEE
107views Hardware» more  DATE 2006»
15 years 4 months ago
Time domain model order reduction by wavelet collocation method
In this paper, a wavelet based approach is proposed for the model order reduction of linear circuits in time domain. Compared with Chebyshev reduction method, the wavelet reductio...
Xuan Zeng, Lihong Feng, Yangfeng Su, Wei Cai, Dian...
ACSD
2007
IEEE
93views Hardware» more  ACSD 2007»
14 years 11 months ago
SAT-based Unbounded Model Checking of Timed Automata
We present an improvement of the SAT-based Unbounded Model Checking (UMC) algorithm. UMC, a symbolic approach introduced in [7], uses propositional formulas in conjunctive normal ...
Wojciech Penczek, Maciej Szreter
BIRTHDAY
2006
Springer
15 years 1 months ago
Realistic Worst-Case Execution Time Analysis in the Context of Pervasive System Verification
We describe a gate level design of a FlexRay-like bus interface. An electronic control unit (ECU) is obtained by integrating this interface into the design of the verified VAMP pro...
Steffen Knapp, Wolfgang J. Paul
WORDS
2005
IEEE
15 years 3 months ago
Towards Self-Healing Systems via Dependable Architecture and
Self-healing systems focus on how to reducing the complexity and cost of the management of dependability policies and mechanisms without human intervention. This position paper pr...
Hong Mei, Gang Huang, Wei-Tek Tsai