Sciweavers

249 search results - page 29 / 50
» Context Sensitivity in Logical Modeling with Time Delays
Sort
View
CONCUR
2000
Springer
15 years 6 months ago
Verifying Quantitative Properties of Continuous Probabilistic Timed Automata
Abstract. We consider the problem of automatically verifying realtime systems with continuously distributed random delays. We generalise probabilistic timed automata introduced in ...
Marta Z. Kwiatkowska, Gethin Norman, Roberto Segal...
ENTCS
2006
134views more  ENTCS 2006»
15 years 1 months ago
Partial Order Reduction for Probabilistic Branching Time
In the past, partial order reduction has been used successfully to combat the state explosion problem in the context of model checking for non-probabilistic systems. For both line...
Christel Baier, Pedro R. D'Argenio, Marcus Grö...
GIS
2006
ACM
16 years 3 months ago
Analyzing theme, space, and time: an ontology-based approach
The W3C's Semantic Web Activity is illustrating the use of semantics for information integration, search, and analysis. However, the majority of the work in this community ha...
Matthew Perry, Farshad Hakimpour, Amit P. Sheth
RTAS
2008
IEEE
15 years 8 months ago
Bounding Worst-Case Response Time for Tasks with Non-Preemptive Regions
Real-time schedulability theory requires a priori knowledge of the worst-case execution time (WCET) of every task in the system. Fundamental to the calculation of WCET is a schedu...
Harini Ramaprasad, Frank Mueller
ICCAD
2009
IEEE
96views Hardware» more  ICCAD 2009»
14 years 11 months ago
PSTA-based branch and bound approach to the silicon speedpath isolation problem
The lack of good "correlation" between pre-silicon simulated delays and measured delays on silicon (silicon data) has spurred efforts on so-called silicon debug. The ide...
Sari Onaissi, Khaled R. Heloue, Farid N. Najm