Efficient approximate transient analysis for a class of deterministic and stochastic Petri nets

Author

Ciardo, Gianfranco ; Li, Guangzhi

Author_Institution

Dept. of Comput. Sci., Coll. of William & Mary, Williamsburg, VA, USA

fYear

1998

fDate

7-9 Sep 1998

Firstpage

34

Lastpage

43

Abstract

Transient analysis of non-Markovian Stochastic Petri nets is a theoretically interesting and practically important problem. We present a new method to compute bounds and an approximation on the average state sojourn times for a special class of deterministic and stochastic Petri nets (DSPNs). In addition to the idea of the subordinated Markov chain traditionally used for the stationary solution of DSPNs, our algorithm makes use of concepts from renewal theory. An application to a finite-capacity queue with a server subject to breakdowns is included

Keywords

Markov processes; Petri nets; performance evaluation; queueing theory; transient analysis; DSPNs; Markov chain; deterministic; deterministic and stochastic Petri nets; finite-capacity queue; non-Markovian Stochastic Petri nets; state sojourn times; Computer science; Delay; Educational institutions; Fault tolerant systems; Interference; Microwave integrated circuits; Petri nets; Stochastic processes; Stochastic systems; Transient analysis;

fLanguage

English

Publisher

ieee

Conference_Titel

Computer Performance and Dependability Symposium, 1998. IPDS '98. Proceedings. IEEE International

Conference_Location

Durham, NC

ISSN

1087-2191

Print_ISBN

0-8186-8679-0

Type

conf

DOI

10.1109/IPDS.1998.707707

Filename

707707