14382 search results - page 83 / 2877 » Time in Connectionist Models |
141
click to vote
DAC
2003
ACM
16 years 2 months ago
2003
ACM
Schedulability analysis of real-time embedded systems requires worst case timing guarantees of embedded software performance. This involves not only language level program analysi...
118
click to vote
WCET
2010
14 years 11 months ago
2010
Safe and tight worst-case execution times (WCETs) are important when scheduling hard realtime systems. This paper presents METAMOC, a modular method, based on model checking and s...
117
click to vote
DSN
2007
IEEE
15 years 7 months ago
2007
IEEE
When employing a consensus algorithm for state machine replication, should one optimize for the case that all communication links are usually timely, or for fewer timely links? Do...
111
click to vote
CORR
2008
Springer
15 years 1 months ago
2008
Springer
Probabilistic timed automata are an extension of timed automata with discrete probability distributions. We consider model-checking algorithms for the subclasses of probabilistic t...
119
click to vote
ARTS
1999
Springer
15 years 5 months ago
1999
Springer
Program compilation can be formally defined as a sequence of equivalence-preserving transformations, or refinements, from highlevel language programs to assembler code. Recent mo...