Sciweavers

31 search results - page 4 / 7
» Discrete-Time Rewards Model-Checked
Sort
View
IPPS
2007
IEEE
15 years 3 months ago
A Markov Reward Model for Software Reliability
A compositional method for estimating software reliability of many threaded programs is developed. The method uses estimates of the reliability of individual modules and the proba...
YoungMin Kwon, Gul Agha
COMPSAC
2008
IEEE
15 years 3 months ago
A Probabilistic Attacker Model for Quantitative Verification of DoS Security Threats
This work introduces probabilistic model checking as a viable tool-assisted approach for systematically quantifying DoS security threats. The proposed analysis is based on a proba...
Stylianos Basagiannis, Panagiotis Katsaros, Andrew...
ENTCS
2007
158views more  ENTCS 2007»
14 years 9 months ago
Abstraction and Completeness for Real-Time Maude
ion and Completeness for Real-Time Maude Peter Csaba ¨Olveczky a,b and Jos´e Meseguer b a Department of Informatics, University of Oslo b Department of Computer Science, Universi...
Peter Csaba Ölveczky, José Meseguer
INFOCOM
2012
IEEE
12 years 12 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
CORR
2009
Springer
242views Education» more  CORR 2009»
14 years 7 months ago
Adaptive Scheduling of Data Paths using Uppaal Tiga
Abstract. We apply Uppaal Tiga to automatically compute adaptive scheduling strategies for an industrial case study dealing with a state-of-the-art image processing pipeline of a p...
Israa AlAttili, Fred Houben, Georgeta Igna, Steffe...