Sciweavers

Share
QEST
2010
IEEE
8 years 1 months ago
Timed Branching Processes
We study Timed Branching Processes (TBPs), a natural extension of (multitype) Branching Processes (BPs) where each entity is equipped with a finite set of private continuous variab...
Ashutosh Trivedi, Dominik Wojtczak
QEST
2010
IEEE
8 years 1 months ago
Automatic Compositional Reasoning for Probabilistic Model Checking of Hardware Designs
Adaptive techniques like voltage and frequency scaling, process variations and the randomness of input data contribute signi cantly to the statistical aspect of contemporary hardwa...
Jayanand Asok Kumar, Shobha Vasudevan
QEST
2010
IEEE
8 years 1 months ago
DTMC Model Checking by SCC Reduction
Discrete-Time Markov Chains (DTMCs) are a widely-used formalism to model probabilistic systems. On the one hand, available tools like PRISM or MRMC offer efficient model checking a...
Erika Ábrahám, Nils Jansen, Ralf Wim...
QEST
2010
IEEE
8 years 1 months ago
Information Hiding in Probabilistic Concurrent Systems
Information hiding is a general concept which refers to the goal of preventing an adversary to infer secret information from the observables. Anonymity and Information Flow are exa...
Miguel E. Andrés, Catuscia Palamidessi, Pet...
QEST
2010
IEEE
8 years 1 months ago
The Measurable Space of Stochastic Processes
Abstract--We introduce a stochastic extension of CCS endowed with structural operational semantics expressed in terms of measure theory. The set of processes is organised as a meas...
Luca Cardelli, Radu Mardare
QEST
2010
IEEE
8 years 1 months ago
Automating the Mean-Field Method for Large Dynamic Gossip Networks
Abstract--We investigate an abstraction method, called meanfield method, for the performance evaluation of dynamic networks with pairwise communication between nodes. It allows us ...
Rena Bakhshi, Jörg Endrullis, Stefan Endrulli...
QEST
2010
IEEE
8 years 1 months ago
Fortuna: Model Checking Priced Probabilistic Timed Automata
We introduce Fortuna, the first tool for model checking priced probabilistic timed automata (PPTAs). Fortuna can handle the combination of real-time, probabilistic and cost feature...
Jasper Berendsen, David N. Jansen, Frits W. Vaandr...
QEST
2010
IEEE
8 years 1 months ago
Canonical Form Based MAP(2) Fitting
The importance of the order two Markovian arrival process (MAP(2)) comes from its compactness, serving either as arrival or service process in applications, and from the nice prope...
Levente Bodrog, Peter Buchholz, Jan Kriege, Mikl&o...
books