QEST
2010
IEEE
13 years 9 months ago
2010
IEEE
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...
QEST
2010
IEEE
13 years 9 months ago
2010
IEEE
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...
QEST
2010
IEEE
13 years 9 months ago
2010
IEEE
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...
QEST
2010
IEEE
13 years 9 months ago
2010
IEEE
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...
QEST
2010
IEEE
13 years 9 months ago
2010
IEEE
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...
QEST
2010
IEEE
13 years 9 months ago
2010
IEEE
Abstract--We investigate an abstraction method, called meanfield method, for the performance evaluation of dynamic networks with pairwise communication between nodes. It allows us ...
QEST
2010
IEEE
13 years 9 months ago
2010
IEEE
QEST
2010
IEEE
13 years 9 months ago
2010
IEEE
QEST
2010
IEEE
13 years 9 months ago
2010
IEEE
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...
QEST
2010
IEEE
13 years 9 months ago
2010
IEEE
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...