Sciweavers

1414 search results - page 7 / 283
» Cover Time and Broadcast Time
Sort
View
ICCAD
2006
IEEE
124views Hardware» more  ICCAD 2006»
14 years 6 months ago
A linear-time approach for static timing analysis covering all process corners
Abstract—Manufacturing process variations lead to circuit timing variability and a corresponding timing yield loss. Traditional corner analysis consists of checking all process c...
Sari Onaissi, Farid N. Najm
CORR
2011
Springer
191views Education» more  CORR 2011»
13 years 1 months ago
Computing Optimal Coverability Costs in Priced Timed Petri Nets
—We consider timed Petri nets, i.e., unbounded Petri nets where each token carries a real-valued clock. Transition arcs are labeled with time intervals, which specify constraints...
Parosh Aziz Abdulla, Richard Mayr
COLT
1995
Springer
14 years 1 months ago
Exactly Learning Automata with Small Cover Time
We present algorithms for exactly learning unknown environments that can be described by deterministic nite automata. The learner performs a walk on the target automaton, where at...
Dana Ron, Ronitt Rubinfeld
APWEB
2005
Springer
14 years 3 months ago
An Updates Dissemination Protocol for Read-Only Transaction Processing in Mobile Real-Time Computing Environments
Data management issues in mobile computing environments have got lots of concerns of relevant researchers. Among these research topics, data broadcast has been extensively investig...
Guohui Li, Hongya Wang, Jixiong Chen, Yingyuan Xia...
FOSSACS
2009
Springer
14 years 4 months ago
Minimal Cost Reachability/Coverability in Priced Timed Petri Nets
Abstract. We extend discrete-timed Petri nets with a cost model that assigns token storage costs to places and firing costs to transitions, and study the minimal cost reachability...
Parosh Aziz Abdulla, Richard Mayr