On the solution of GSPN reward models

by: Gianfranco Ciardo, Jogesh Muppala, Kishor S Trivedi

Performance Evaluation, Vol. 12, No. 4. (July 1991), pp. 237-253.

View FullText article

DOI, ScienceDirect

Reviews [Write a review of this article]

There are no reviews of this article

Find related articles from these CiteULike users

muppala, znmeb, Computer_Networks (group), Embedded_Systems_And_Software (group)

Find related articles with these CiteULike tags

markov, performance, petri-net

Abstract

We extend the basic GSPN (generalized stochastic Petri net) model to the GSPN-reward model. This allows the concise specification of both the underlying stochastic process and the rewards attached to the states and the transitions of the stochastic process. The classical method for the steady-state solution of GSPN models, based on the correspondence between GSPNs and continuous-time Markov chains (CTMCs), is compared with a method based on discrete-time Markov chains (DTMCs) previously judged poor. We show that there are GSPNs where the DTMC-based method performs better than the classical method (and others where it performs worse). Finally, we discuss how to perform parametric sensitivity analysis of the measures computed from a GSPN using either solution method.

@article{citeulike:682640, abstract = {We extend the basic GSPN (generalized stochastic Petri net) model to the GSPN-reward model. This allows the concise specification of both the underlying stochastic process and the rewards attached to the states and the transitions of the stochastic process. The classical method for the steady-state solution of GSPN models, based on the correspondence between GSPNs and continuous-time Markov chains (CTMCs), is compared with a method based on discrete-time Markov chains (DTMCs) previously judged poor. We show that there are GSPNs where the DTMC-based method performs better than the classical method (and others where it performs worse). Finally, we discuss how to perform parametric sensitivity analysis of the measures computed from a GSPN using either solution method.}, author = {Ciardo, Gianfranco and Muppala, Jogesh and Trivedi, Kishor S. }, citeulike-article-id = {682640}, doi = {10.1016/0166-5316(91)90003-L}, journal = {Performance Evaluation}, keywords = {markov, performance, petri-net}, month = {July}, number = {4}, pages = {237--253}, posted-at = {2006-06-03 09:30:35}, priority = {2}, title = {On the solution of GSPN reward models}, url = {http://dx.doi.org/10.1016/0166-5316(91)90003-L}, volume = {12}, year = {1991} }

RIS record

TY - JOUR ID - citeulike:682640 L3 - citeulike-article-id:682640 TI - On the solution of GSPN reward models JF - Performance Evaluation VL - 12 IS - 4 SP - 237 EP - 253 N2 - We extend the basic GSPN (generalized stochastic Petri net) model to the GSPN-reward model. This allows the concise specification of both the underlying stochastic process and the rewards attached to the states and the transitions of the stochastic process. The classical method for the steady-state solution of GSPN models, based on the correspondence between GSPNs and continuous-time Markov chains (CTMCs), is compared with a method based on discrete-time Markov chains (DTMCs) previously judged poor. We show that there are GSPNs where the DTMC-based method performs better than the classical method (and others where it performs worse). Finally, we discuss how to perform parametric sensitivity analysis of the measures computed from a GSPN using either solution method. KW - markov KW - performance KW - petri-net AU - Ciardo, Gianfranco AU - Muppala, Jogesh AU - Trivedi, Kishor PY - 1991/07// UR - http://dx.doi.org/10.1016/0166-5316(91)90003-L ER -

RIS BibTeX