By Topic

Quantitative verification for response times in composite Web service model

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Youssou Kasse ; LAMSADE Laboratory, University of Paris-dauphine ; Lynda Mokdad

In order to check formulas with rewards on multidimensional Continuous Time Markov Chains (CTMC) for composite Web service model, we propose an algorithm based on stochastic comparison. The considered model has heterogeneous servers and the number of elementary Web services can be very large. Thus, the computation of the rewards on the exact model is almost impossible because of the well known problem of the state space explosion. We propose to apply our proposed model checking algorithm on our proposed bounding models in order to perform the verification on the bounds values instead of the exact one. These bounding models provide upper and lower bounds on response times of composite Web service model.

Published in:

Computers and Communications (ISCC), 2011 IEEE Symposium on

Date of Conference:

June 28 2011-July 1 2011