By Topic

A characterization of the stochastic process underlying a stochastic Petri net

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
$33 $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)
G. Ciardo ; Dept. of Comput. Sci., Coll. of William & Mary, Williamsburg, VA, USA ; R. German ; C. Lindemann

Stochastic Petri nets (SPNs) with generally distributed firing times are isomorphic to generalized semi-Markov processes (GSMPs), but simulation is the only feasible approach for their solution. The authors explore a hierarchy of SPN classes where modeling power is reduced in exchange for an increasingly efficient solution. Generalized stochastic Petri nets (GSPNs), deterministic and stochastic Petri nets (DSPNs), semi-Markovian stochastic Petri nets (SM-SPNs), timed Petri nets (TPNs), and generalized timed Petri nets (GTPNs) are particular entries in the hierarchy. Additional classes of SPNs for which it is shown how to compute an analytical solution are obtained by the method of the embedded Markov chain (DSPNs are just one example in this class) and state discretization, which the authors apply not only to the continuous-time case (PH-type distributions), but also to the discrete case

Published in:

Petri Nets and Performance Models, 1993. Proceedings., 5th International Workshop on

Date of Conference:

19-22 Oct 1993