Sciweavers

119 search results - page 9 / 24
» A Markov Reward Model Checker
Sort
View
ACSD
2008
IEEE
106views Hardware» more  ACSD 2008»
13 years 8 months ago
Time-bounded model checking of infinite-state continuous-time Markov chains
The design of complex concurrent systems often involves intricate performance and dependability considerations. Continuous-time Markov chains (CTMCs) are widely used models for co...
Lijun Zhang, Holger Hermanns, Ernst Moritz Hahn, B...
CORR
2010
Springer
171views Education» more  CORR 2010»
13 years 1 months ago
Online Learning in Opportunistic Spectrum Access: A Restless Bandit Approach
We consider an opportunistic spectrum access (OSA) problem where the time-varying condition of each channel (e.g., as a result of random fading or certain primary users' activ...
Cem Tekin, Mingyan Liu
TGC
2010
Springer
13 years 4 months ago
A Tool for Checking Probabilistic Properties of COWS Services
Abstract. We present a tool developed for fostering probabilistic model checking of services formally specified in Scows, a stochastic enrichment of the Calculus for Orchestration ...
Igor Cappello, Paola Quaglia
ETT
2000
149views Education» more  ETT 2000»
13 years 6 months ago
Channel Allocation with Recovery Strategy in Wireless Networks
With the increasing penetration of wireless communications systems, customers are expecting the same level of service, reliability and performance from the wireless communication s...
Yue Ma, James J. Han, Kishor S. Trivedi
INFOCOM
2012
IEEE
11 years 9 months ago
Approximately optimal adaptive learning in opportunistic spectrum access
—In this paper we develop an adaptive learning algorithm which is approximately optimal for an opportunistic spectrum access (OSA) problem with polynomial complexity. In this OSA...
Cem Tekin, Mingyan Liu