Abstract
For a large Markovian model, a “product form” is an explicit description of the steady-state behaviour which is otherwise generally untractable. Being first introduced in queueing networks, it has been adapted to Markovian Petri nets. Here we address three relevant issues for product-form Petri nets which were left fully or partially open: (1) we provide a sound and complete set of rules for the synthesis; (2) we characterise the exact complexity of classical problems like reachability; (3) we introduce a new subclass for which the normalising constant (a crucial value for product-form expression) can be efficiently computed.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Ajmone Marsan, M., Balbo, G., Conte, G., Donatelli, S., Franceschinis, G.: Modelling with Generalized Stochastic Petri Nets. John Wiley & Sons, Chichester (1995)
Baccelli, F., Cohen, G., Olsder, G.J., Quadrat, J.P.: Synchronization and Linearity. John Wiley & Sons, New York (1992)
Baskett, F., Chandy, K.M., Muntz, R.R., Palacios, F.: Open, closed and mixed networks of queues with different classes of customers. Journal of the ACM 22(2), 248–260 (1975)
Boucherie, R.J., Sereno, M.: On closed support T-invariants and traffic equations. Journal of Applied Probability (35), 473–481 (1998)
Esparza, J., Nielsen, M.: Decidability issues for Petri nets - a survey. Journal of Informatik Processing and Cybernetics 30(3), 143–160 (1994)
Coleman, J.L., Henderson, W., Taylor, P.G.: Product form equilibrium distributions and a convolution algorithm for stochastic Petri nets. Performance Evaluation 26(3), 159–180 (1996)
Esparza, J.: Reduction and Synthesis of Live and Bounded Free Choice Petri Nets. Information and Computation 114(1), 50–87 (1994)
Feinberg, M.: Lectures on chemical reaction networks. Given at the Math. Research Center, Univ. Wisconsin (1979), http://www.che.eng.ohio-state.edu/~feinberg/LecturesOnReactionNetworks
Haddad, S., Moreaux, P., Sereno, M., Silva, M.: Product-form and stochastic Petri nets: a structural approach. Performance Evaluation 59, 313–336 (2005)
Henderson, W., Lucic, D., Taylor, P.G.: A net level performance analysis of stochastic Petri nets. Journal of Australian Mathematical Soc. Ser. B 31, 176–187 (1989)
Jackson, J.R.: Jobshop-like Queueing Systems. Management Science 10(1), 131–142 (1963)
Kelly, F.: Reversibility and Stochastic Networks. Wiley, New-York (1979)
Lazar, A.A., Robertazzi, T.G.: Markovian Petri Net Protocols with Product Form Solution. In: Proc. of INFOCOM 1987, San Francisco, CA, USA, pp. 1054–1062 (1987)
Li, M., Georganas, N.D.: Parametric Analysis of Stochastic Petri Nets. In: Fifth International Conference on Modelling and Tools for Computer Performance Evaluation, Torino, Italy (1991)
Mairesse, J., Nguyen, H.-T.: Deficiency zero petri nets and product form. In: Franceschinis, G., Wolf, K. (eds.) PETRI NETS 2009. LNCS, vol. 5606, pp. 103–122. Springer, Heidelberg (2009)
Mayr, E., Meyer, A.: The complexity of the word problem for commutative semigroups an polynomial ideals. Advances in Math. 46, 305–329 (1982)
Papadimitriou, C.: Computational Complexity. Addison-Wesley, Reading (1994)
Reiser, M., Lavenberg, S.S.: Mean Value Analysis of Closed Multichain Queueing Networks. Journal of the ACM 27(2), 313–322 (1980)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Haddad, S., Mairesse, J., Nguyen, HT. (2011). Synthesis and Analysis of Product-Form Petri Nets. In: Kristensen, L.M., Petrucci, L. (eds) Applications and Theory of Petri Nets. PETRI NETS 2011. Lecture Notes in Computer Science, vol 6709. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-21834-7_16
Download citation
DOI: https://doi.org/10.1007/978-3-642-21834-7_16
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-21833-0
Online ISBN: 978-3-642-21834-7
eBook Packages: Computer ScienceComputer Science (R0)