By Topic

Steady state solution of MRSPN with mixed preemption policies

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
$31 $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

3 Author(s)
Telek, M. ; Dept. of Telecommun., Tech. Univ. Budapest, Hungary ; Bobbio, A. ; Puliafito, A.

Markov Regenerative Stochastic Petri Nets (MRSPN) have been recently recognized as a valuable tool to model systems with non-exponential timed activities. The usual assumption in the implementation of such models is that at most a single non-exponential transition, with associated enabling memory policy, can be enabled in each marking. More recently, new memory policies have been studied in order to represent more complex and effective preemption mechanisms in real systems. Closed-form solutions in the Laplace transform domain have been provided also in this case. This paper concentrates on the steady-state analysis of MRSPN and provides an unified analytical approach to include mixed memory policies into a single model. A numerical example concludes the paper

Published in:

Computer Performance and Dependability Symposium, 1996., Proceedings of IEEE International

Date of Conference:

4-6 Sep 1996