Markov regenerative SPN with non-overlapping activity cycles

Author

Bobbio, Andrea ; Telek, N.

Author_Institution

Dipartimento de Elettronica, Brescia Univ., Italy

fYear

1995

fDate

24-26 Apr 1995

Firstpage

124

Lastpage

133

Abstract

The paper discusses a class of Markov Regenerative Stochastic Petri Nets (MRSPN) characterized by the fact that the stochastic process subordinated to two consecutive regeneration time points is a semi-Markov reward process. This class of SPN´s can accommodate transitions with generally distributed firing time and associated memory policy of both enabling and age type, thus generalizing and encompassing all the previous definitions of MRSPN. An unified analytical procedure is developed for the derivation of closed form expressions for the transient and steady state probabilities

Keywords

Markov processes; Petri nets; reachability analysis; Markov regenerative stochastic Petri nets; associated memory policy; closed form expressions; generally distributed firing time; nonoverlapping activity cycles; semi-Markov reward process; steady state probabilities; stochastic process; transient probabilities; Materials requirements planning; Petri nets; Power system modeling; Random variables; Steady-state; Stochastic processes; Stochastic systems; Telecommunications; Timing; Transient analysis;

fLanguage

English

Publisher

ieee

Conference_Titel

Computer Performance and Dependability Symposium, 1995. Proceedings., International

Conference_Location

Erlangen

Print_ISBN

0-8186-7059-2

Type

conf

DOI

10.1109/IPDS.1995.395811

Filename

395811