Sciweavers

21 search results - page 2 / 5
» Approximate Analysis of Probabilistic Processes: Logic, Simu...
Sort
View
TC
2011
12 years 12 months ago
An Architecture for Fault-Tolerant Computation with Stochastic Logic
—Mounting concerns over variability, defects and noise motivate a new approach for digital circuitry: stochastic logic, that is to say, logic that operates on probabilistic signa...
Weikang Qian, Xin Li, Marc D. Riedel, Kia Bazargan...
QEST
2008
IEEE
13 years 11 months ago
Hintikka Games for PCTL on Labeled Markov Chains
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 ...
QEST
2008
IEEE
13 years 11 months ago
Quasi-Birth-Death Processes, Tree-Like QBDs, Probabilistic 1-Counter Automata, and Pushdown Systems
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...
IANDC
2006
117views more  IANDC 2006»
13 years 4 months ago
Statistical probabilistic model checking with a focus on time-bounded properties
Probabilistic verification of continuous-time stochastic processes has received increasing attention in the model-checking community in the past five years, with a clear focus on ...
Håkan L. S. Younes, Reid G. Simmons
WIMOB
2007
IEEE
13 years 11 months ago
Performance Analysis of Ranging Process in IEEE 802.16e OFDMA Systems
In this paper, ranging process in IEEE 802.16e OFDMA systems is analyzed and performance is evaluated. Ranging process provides initial network entry, uplink synchronization, and ...
Doo Hwan Lee, Hiroyuki Morikawa