Product form equilibrium distributions and a convolution algorithm for stochastic Petri nets

1996 ◽  
Vol 26 (3) ◽  
pp. 159-180 ◽  
Author(s):  
J.L. Coleman ◽  
W. Henderson ◽  
P.G. Taylor
1998 ◽  
Vol 35 (2) ◽  
pp. 473-481 ◽  
Author(s):  
Richard J. Boucherie ◽  
Matteo Sereno

The traffic equations are the basis for the exact analysis of product form queueing networks, and the approximate analysis of non-product form queueing networks. Conditions characterising the structure of the network that guarantees the existence of a solution for the traffic equations are therefore of great importance. This note shows that the new condition stating that each transition is covered by a minimal closed support T-invariant, is necessary and sufficient for the existence of a solution for the traffic equations for batch routing queueing networks and stochastic Petri nets.


2005 ◽  
Vol 59 (4) ◽  
pp. 313-336 ◽  
Author(s):  
S. Haddad ◽  
P. Moreaux ◽  
M. Sereno ◽  
M. Silva

Author(s):  
W. Henderson ◽  
D. Lucic ◽  
P. G. Taylor

AbstractStochastic Petri Nets are used extensively to find performance measures for communication protocols. This paper illustrates how equilibrium distributions for the markings of a wide class of nets can be found directly without the need to generate a large state space and then resort to equilibrium balance equations.


Sign in / Sign up

Export Citation Format

Share Document