Search Sciweavers | Sciweavers

13

QEST
2008
IEEE

120views Modeling and Simulation» more QEST 2008»

Hintikka Games for PCTL on Labeled Markov Chains

13 years 11 months ago

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...

Harald Fecher, Michael Huth, Nir Piterman, Daniel ...

claim paper

Read More »

11

click to vote

QEST
2008
IEEE

146views Modeling and Simulation» more QEST 2008»

Symbolic Magnifying Lens Abstraction in Markov Decision Processes

13 years 11 months ago

Download www.ee.ucla.edu

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 ...

Pritam Roy, David Parker, Gethin Norman, Luca de A...

claim paper

Read More »

13

click to vote

QEST
2008
IEEE

135views Modeling and Simulation» more QEST 2008»

Characterization of the E-commerce Storage Subsystem Workload

13 years 11 months ago

Download www.cs.wm.edu

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,...

Xi Zhang, Alma Riska, Erik Riedel

claim paper

Read More »

17

click to vote

QEST
2008
IEEE

145views Modeling and Simulation» more QEST 2008»

Quasi-Birth-Death Processes, Tree-Like QBDs, Probabilistic 1-Counter Automata, and Pushdown Systems

13 years 11 months ago

Download www.era.lib.ed.ac.uk

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...

Kousha Etessami, Dominik Wojtczak, Mihalis Yannaka...

claim paper

Read More »

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers