This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
September 1982 (vol. 31 no. 9)
pp. 913-917
M.K. Molloy, Department of Computer Science, School of Natural Sciences, University of Texas
An isomorphism between the behavior of Petri nets with exponentially distributed transition rates and Markov processes is presented. In particular, k-bounded Petri nets are isomorphic to finite Markov processes and can be solved by standard techniques if k is not too large. As a practical example, we solve for the steady state average message delay and throughput on a communication link when the alternating bit protocol is used for error recovery.
Index Terms:
Petri nets with time, Alternating bit protocol, Markovian systems, performance analysis, Petri nets
Citation:
M.K. Molloy, "Performance Analysis Using Stochastic Petri Nets," IEEE Transactions on Computers, vol. 31, no. 9, pp. 913-917, Sept. 1982, doi:10.1109/TC.1982.1676110
Usage of this product signifies your acceptance of the Terms of Use.