52 search results - page 10 / 11 » Verifying Linear Duration Constraints of Timed Automata |
TOPLAS
2008
13 years 7 months ago
2008
lem of inferring termination from such abstract information is not the halting problem for programs and may well be decidable. If this is the case, the decision algorithm forms a &...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
Abstract-- This work analyzes the high-SNR asymptotic error performance of outage-limited communications with fading, where the number of bits that arrive at the transmitter during...
FMOODS
2003
13 years 8 months ago
2003
Performance analysis of computing systems, in particular distributed computing systems, is a complex process. Analysing the complex flows and interactions between a set of distribu...
ECAI
2010
Springer
13 years 8 months ago
2010
Springer
Abstract. Interval temporal logics formalize reasoning about interval structures over (usually) linearly ordered domains, where time intervals are the primitive ontological entitie...
DAGSTUHL
2008
13 years 9 months ago
2008
The research on real-time scheduling has mostly focused on the development of algorithms that allows to test whether the constraints imposed on the task execution (often expressed ...