Sciweavers

6308 search results - page 218 / 1262
» Modeling Urgency in Timed Systems
Sort
View
FORMATS
2003
Springer
15 years 9 months ago
Performance Analysis of Probabilistic Timed Automata Using Digital Clocks
Probabilistic timed automata, a variant of timed automata extended with discrete probability distributions, is a specification formalism suitable for describing both nondeterminis...
Marta Z. Kwiatkowska, Gethin Norman, David Parker,...
109
Voted
ASPDAC
2005
ACM
125views Hardware» more  ASPDAC 2005»
15 years 10 months ago
A formalism for functionality preserving system level transformations
— With the rise in complexity of modern systems, designers are spending a significant time on at the system level of abstraction. This paper introduces Model Algebra, a formalis...
Samar Abdi, Daniel Gajski
CVPR
2007
IEEE
16 years 6 months ago
In Situ Evaluation of Tracking Algorithms Using Time Reversed Chains
Automatic evaluation of visual tracking algorithms in the absence of ground truth is a very challenging and important problem. In the context of online appearance modeling, there ...
Hao Wu, Aswin C. Sankaranarayanan, Rama Chellappa
CONCUR
2000
Springer
15 years 9 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...
WSC
2008
15 years 7 months ago
Identifying significant factors affecting Request For Information (RFI) process time
The research is to illustrate how to identify the significant factor(s) affecting the Request For Information (RFI) process cycle time in the context of queueing behavior. Among t...
Chang-sun Chin, Jeffrey S. Russell