Abstract
Stochastic Well Formed Nets (SWNs) are a powerful Petri Net model which allows the computation of performance indices with an aggregation method. Decomposition methods initiated by B. Plateau are another way to reduce the complexity of such a computation. We have shown in a previous work, how to combine these two approaches for systems with synchronous composition. Despite similarities between the asynchronous and synchronous cases, it turns out that the former presents specificities that need theoretical foundations. We undertake this task in the present paper. We derive necessary conditions on the modeled systems that allow for the two methods to be combined. For parallel systems satisfying these necessary conditions we develop a model with the corresponding algorithm. This model, based upon synchronization of “global” tokens moving across submodels, covers a large range of real life systems. An example shows the intuitive ideas behind these developments.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
P. Buchholz. Hierarchies in colored GSPNs. In Proc. of the 14th International Conference on Application and Theory of Petri Nets, number 691 in LNCS, pages 106–125, Chicago, Illinois, USA, June 1993. Springer-Verlag.
P. Buchholz. Aggregation and reduction techniques for hierarchical GCSPN. In Proc. of the 5th International Workshop on Petri Nets and Performance Models, pages 216–225, Toulouse, France, October 19–22 1993. IEEE Computer Society Press.
G. Chiola, C. Dutheillet, G. Franceschinis, and S. Haddad. Stochastic well-formed colored nets and symetrie modeling applications. IEEE Transactions on Computers, 42(11):1343–1360, November 1993.
G. Chiola, G. Franceschinis, R. Gaeta, and M. Ribaudo. Greatspn 1.7: graphical editor and analyzer for timed and stochastic Petri nets. Performance Evaluation, 24(1&2):47–68, 1995.
M. Davio. Kronecker products and shuffle algebra. IEEE Transactions on Computers, 30 (2):116–125, 1981.
S. Donatelli. Superposed generalized stochastic Petri nets: definition and efficient solution. In Robert Valette, editor, Proc. of the 15th International Conference on Application and Theory of Petri Nets, number 815 in LNCS, pages 258–277, Zaragoza, Spain, June 20–24 1994. Springer-Verlag.
C. Dutheillet. Symétries dans les réseaux colorés. Définition, analyse et application à l'évaluation de performance. Thèse, Université Paris VI, Paris, France, January 28 1991.
S. Haddad and P. Moreaux. Asynchronous composition of stochastic high level Petri nets. Research report, LAMSADE, Université Paris Dauphine (to appear).
S. Haddad and P. Moreaux. Evaluation of high level Petri nets by means of aggregation and decomposition. In Proc. of the 6th International Workshop on Petri Nets and Performance Models, pages 11–20, Durham, NC, USA, October 3–6 1995. IEEE Computer Society Press.
J. G. Kemeny and J. L. Snell. Finite Markov Chains. V. Nostrand, Princeton, NJ, 1960.
B. Plateau and J.M. Fourneau. A methodology for solving Markov models of parallel systems. Journal of parallel and distributed computing, 12:370–387, 1991.
Y. Saad and M. H. Schultz. Gmres: A generalized minimal residual algorithm for solving nonsymetric linear systems. SIAM J. Sci. Stat. Comput., 7:856–869, 1986.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Haddad, S., Moreaux, P. (1996). Asynchronous composition of high level Petri Nets: A quantitative approach. In: Billington, J., Reisig, W. (eds) Application and Theory of Petri Nets 1996. ICATPN 1996. Lecture Notes in Computer Science, vol 1091. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61363-3_11
Download citation
DOI: https://doi.org/10.1007/3-540-61363-3_11
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61363-3
Online ISBN: 978-3-540-68505-0
eBook Packages: Springer Book Archive