Approximate mean value analysis for stochastic marked graphs

Author

Sereno, Matteo

Author_Institution

Dipartimento di Inf., Torino Univ., Italy

Volume

22

Issue

9

fYear

1996

fDate

9/1/1996 12:00:00 AM

Firstpage

654

Lastpage

664

Abstract

An iterative technique for the computation of approximate performance indices of a class of stochastic Petri net models is presented. The proposed technique is derived from the mean value analysis algorithm for product-form solution stochastic Petri nets. In this paper, we apply the approximation technique to stochastic marked graphs. In principle, the proposed technique can be used for other stochastic Petri net subclasses. In this paper, some of these possible applications are presented. Several examples are presented in order to validate the approximate results

Keywords

Petri nets; approximation theory; graph colouring; iterative methods; performance index; stochastic systems; approximate mean value analysis; approximate performance indices; approximation techniques; computational algorithms; iterative technique; product-form solution; stochastic Petri nets; stochastic marked graphs; Algorithm design and analysis; Approximation algorithms; Concurrent computing; Equations; Iterative algorithms; Linear systems; Performance analysis; Petri nets; Steady-state; Stochastic processes;

fLanguage

English

Journal_Title

Software Engineering, IEEE Transactions on

Publisher

ieee

ISSN

0098-5589

Type

jour

DOI

10.1109/32.541436

Filename

541436