19 search results - page 4 / 4 » qest 2008 |
99
Voted
QEST
2008
IEEE
15 years 7 months ago
2008
IEEE
We present Hintikka games for formulae of the probabilistic temporal logic PCTL and countable labeled Markov chains as models, giving an operational account of the denotational se...
116
Voted
QEST
2008
IEEE
15 years 7 months ago
2008
IEEE
Magnifying Lens Abstraction in Markov Decision Processes ∗ Pritam Roy1 David Parker2 Gethin Norman2 Luca de Alfaro1 Computer Engineering Dept, UC Santa Cruz, Santa Cruz, CA, USA ...
123
Voted
QEST
2008
IEEE
15 years 7 months ago
2008
IEEE
This paper characterizes the workload seen at the storage subsystem of an e-commerce system. Measurements are conducted on multi-tiered systems running three different benchmarks,...
106
Voted
QEST
2008
IEEE
15 years 7 months ago
2008
IEEE
We begin by observing that (discrete-time) QuasiBirth-Death Processes (QBDs) are equivalent, in a precise sense, to (discrete-time) probabilistic 1-Counter Automata (p1CAs), and b...