Publication 1999 Issue No. 2 - March/April Abstract - Structured Solution of Asynchronously Communicating Stochastic Modules
 This Article Share Bibliographic References Add to: Digg Furl Spurl Blink Simpy Google Del.icio.us Y!MyWeb Search Similar Articles Articles by Javier Campos Articles by Susanna Donatelli Articles by Manuel Silva
Structured Solution of Asynchronously Communicating Stochastic Modules
March/April 1999 (vol. 25 no. 2)
pp. 147-165
 ASCII Text x Javier Campos, Susanna Donatelli, Manuel Silva, "Structured Solution of Asynchronously Communicating Stochastic Modules," IEEE Transactions on Software Engineering, vol. 25, no. 2, pp. 147-165, March/April, 1999.
 BibTex x @article{ 10.1109/32.761442,author = {Javier Campos and Susanna Donatelli and Manuel Silva},title = {Structured Solution of Asynchronously Communicating Stochastic Modules},journal ={IEEE Transactions on Software Engineering},volume = {25},number = {2},issn = {0098-5589},year = {1999},pages = {147-165},doi = {http://doi.ieeecomputersociety.org/10.1109/32.761442},publisher = {IEEE Computer Society},address = {Los Alamitos, CA, USA},}
 RefWorks Procite/RefMan/Endnote x TY - JOURJO - IEEE Transactions on Software EngineeringTI - Structured Solution of Asynchronously Communicating Stochastic ModulesIS - 2SN - 0098-5589SP147EP165EPD - 147-165A1 - Javier Campos, A1 - Susanna Donatelli, A1 - Manuel Silva, PY - 1999KW - Petri net modelsKW - performance analysisKW - structural decompositionKW - Kronecker algebra.VL - 25JA - IEEE Transactions on Software EngineeringER -

Abstract—Asynchronously Communicating Stochastic Modules (SAM) are Petri nets that can be seen as a set of modules that communicate through buffers, so they are not (yet another) Petri net subclass, but they complement a net with a structured view. This paper considers the problem of exploiting the compositionality of the view to generate the state space and to find the steady-state probabilities of a stochastic extension of SAM in a net-driven, efficient way. Essentially, we give an expression of an auxiliary matrix, ${\schmi{\bf G}}$, which is a supermatrix of the infinitesimal generator of a SAM. ${\schmi{\bf G}}$ is a tensor algebra expression of matrices of the size of the components for which it is possible to numerically solve the characteristic steady-state solution equation ${\schmi {\bf \pi}} \; \cdot \; {\schmi{\bf G}}={\schmi{\bf 0}},$ without the need to explicitly compute ${\schmi{\bf G}}$. Therefore, we obtain a method that computes the steady-state solution of a SAM without ever explicitly computing and storing its infinitesimal generator, and therefore without computing and storing the reachability graph of the system. Some examples of application of the technique are presented and compared to previous approaches

[1] M. Ajmone Marsan, G. Balbo, G. Conte, S. Donatelli, and G. Franceschinis, Modeling with Generalized Stochastic Petri Nets. John Wiley&Sons, 1995.
[2] P. Buchholz, "A Hierarchical View of GCSPNs and Its Impact on Qualitative and Quantitative Analysis," J. Parallel and Distributed Computing, vol. 15, no. 3, pp. 207-224, July 1992.
[3] P. Buchholz, "Numerical Solution Methods Based on Structured Descriptions of Markovian Models," G. Balbo and G. Serazzi, eds., Computer Performance Evaluation. Modeling Techniques and Tools, pp. 251-267, Elsevier, 1992.
[4] P. Buchholz, "A Class of Hierarchical Queuing Networks and Their Analysis," Queueing Systems, vol. 15, pp. 59-80, 1994.
[5] P. Buchholz, G. Ciardo, S Donatelli, and P. Kemper, "Complexity of Kronecker Operations on Sparse Matrices with Applications to the Solution of Markov Models," Icase report 97-66, Inst. for Computer Applications in Science and Engineering, Hampton, Va., 1997.
[6] P. Buchholz and P. Kemper, "Numerical Analysis of Stochastic Marked Graphs," Porch. Sixth Int'l Workshop Petri Nets and Performance Models, pp. 32-41,Durham, N.C., IEEE CS Press, Oct. 1995.
[7] J. Campos, G. Chiola, and M. Silva, "Properties and Performance Bounds for Closed Free Choice Synchronized Monocles Queueing Networks," IEEE Trans. Automatic Control, vol. 36, no. 12, pp. 1,368-1,382, Dec. 1991.
[8] J. Campos, J.M. Colombo, H. Jungnitz, and M. Silva, "Approximate Throughput Computation of Stochastic Marked Graphs," IEEE Trans. Software Eng., vol. 20, no. 7, pp. 526-535, July 1994.
[9] J. Campos, S. Donatelli, and M. Silva, "Structured Solution of Stochastic DSSP Systems," Proc. Seventh Int'l Workshop Petri Nets and Performance Models, pp. 91-100,Saint Malo, France, IEEE CS Press, June 1997.
[10] G. Chiola, "A Graphical Petri Net Tool for Performance Analysis," Proc. Third Int'l Workshop Modeling Techniques and Performance Evaluation,Paris, AFCET, Mar. 1987.
[11] G. Chiola, M. Ajmone Marsan, G. Balbo, and G. Conte, "Generalized Stochastic Petri Nets: A Definition at the Net Level and Its Implications," IEEE Trans. Software Eng., vol. 19, no. 2, pp. 89-107, Feb. 1993.
[12] G. Chiola, S. Donatelli, and G. Franceschinis, "GSPNs versus SPNs: What is the Actual Role of Immediate Transitions? Proc. Fourth Int'l Workshop Petri Nets and Performance Models, pp. 20-31,Melbourne, Australia, IEEE CS Press, Dec. 1991.
[13] G. Chiola, C. Dutheillet, G. Franceschinis, and S. Haddad, “Stochastic Well-Formed Coloured Nets for Symmetric Modeling Applications,” IEEE Trans. Computers, vol. 42, no. 11, Nov. 1993.
[14] G. Ciardo and M. Tilgner, "On the Use of Kronecker Operators for the Solution of Generalized Stochastic Petri Nets," Icase Report 96-35, Inst. for Computer Applications in Science and Engineering, Hampton, Va., 1996.
[15] J.M. Colom, "Análisis Estructural de Redes de Petri, Programación Lineal y Geometría Convexa," PhD thesis, Departamento de Ingeniería Eléctrica e Informática, Universidad de Zaragoza, Spain, Research Report, GISI-RR-89-11, June 1989, in Spanish.
[16] J.M. Colom and M. Silva, "Convex Geometry and Semiflows in P/T Nets. A Comparative Study of Algorithms for Computation of Minimal p-Semiflows," G. Rozenberg, ed., Advances in Petri Nets 1990, Lecture Notes in Computer Science 483, pp. 79-112.Berlin: Springer-Verlag, 1991.
[17] J.M. Colom and M. Silva, "Improving the Linearly Based Characterization of P/T Nets," G. Rozenberg, ed., Advances in Petri Nets 1990, Lecture Notes in Computer Science 483, pp. 113-145.Berlin: Springer-Verlag, 1991.
[18] M. Davio, "Kronecker Products and Shuffle Algebra," IEEE Trans. Computers, vol. 30, no. 2, pp. 116-125, 1981.
[19] F. DiCesare, G. Harhalakis, J. M. Proth, M. Silva, and F.B. Vernadat, eds. Practice of Petri Nets in Manufacturing.London: Chapman&Hall, 1993.
[20] S. Donatelli, "Superposed Stochastic Automata: A Class of Stochastic Petri Nets with Parallel Solution and Distributed State Space," Performance Evaluation, vol. 18, pp. 21-36, 1993.
[21] S. Donatelli, "Superposed Generalized Stochastic Petri Nets: Definition and Efficient Solution," R. Valette, ed., Proc. 15th Int'l Conf. Applications and Theory of Petri Nets, Lecture Notes in Computer Science 815, pp. 258-277.Berlin, Heidelberg: Springer-Verlag, 1994.
[22] A. Gibbons, Algorithmic Graph Theory.London: Cambridge Univ. Press, 1985.
[23] S. Haddad and P. Moreaux, "Evaluation of High Level Petri Nets by Means of Aggregation and Decomposition," Proc. Sixth Int'l Conf. Petri Nets and Performance Models—PNPM'95, pp. 11-20. IEEE Computer Society, 1995.
[24] S. Haddad and P. Moreaux, "Asynchronous Composition of High level Petri Nets: A Quantitative Approach," J. Billington and W. Reisig, eds., Proc. 17th Int'l Conf. Applications and Theory of Petri Nets, Lecture Notes in Computer Science 1091, pp. 192-211.Berlin: Springer-Verlag, 1996.
[25] W. Henderson and P.G. Taylor, "Aggregation Methods in Exact Performance Analysis of Stochastic Petri Nets," Proc. Third Int'l Workshop Petri Nets and Performance Models, pp. 12-18,Kyoto, Japan, IEEE CS Press, Dec. 1989.
[26] P. Kemper, "Numerical Analysis of Superposed GSPN," IEEE Trans. Software Eng., vol. 22, no. 4, pp. 615-628, Sept. 1996.
[27] P. Kemper, "SupGSPN Version 1.0," An Analysis Engine for Superposed GSPNs, technical report, Universität Dortmund, 1997.
[28] P. Kemper, "Transient Analysis of Superposed GSPNs," Proc. Seventh Int'l Conf. Petri Nets and Performance Models—PNPM'97, pp. 101-110. IEEE Computer Society, 1997.
[29] M.K. Molloy, "Performance Analysis Using Stochastic Petri Nets," IEEE Trans. Computers, vol. 31, no. 9, pp. 913-917, Sept. 1982.
[30] T. Murata, “Petri Nets: Properties, Analysis and Application,” Proc. IEEE, vol. 77, no. 4, 1989.
[31] C.J. Pérez-Jiménez, J. Campos, and M. Silva, "State Machine Reduction for the Approximate Performance Evaluation of Manufacturing Systems Modelled with Cooperating Sequential Processes," Proc. IEEE Int'l Conf. Robotics and Automation, pp. 1,159-1,165,Minneapolis, Minn., Apr. 1996.
[32] B. Plateau, "On the Stochastic Structure of Parallelism and Synchronization Models for Distributed Algorithms," Proc. SIGMETRICS Conf., pp. 147-154,Austin, Texas, ACM, Aug. 1985.
[33] L. Recalde, E. Teruel, and M. Silva, "On Well-Formedness Analysis: The Case of Deterministic Systems of Sequential Processes," J. Desel, ed., Structures in Concurrency Theory,Berlin, pp. 279-293. Springer, 1995.
[34] L. Recalde, E. Teruel, and M. Silva, "Modeling and Analysis of Sequential Processes that Cooperate Through Buffers," IEEE Trans. Robotics and Automation, vol. 14, no. 2, pp. 267-277, 1998.
[35] M. Sereno and G. Balbo, "Mean Value Analysis of Stochastic Petri Nets," Performance Evaluation, vol. 29, no. 1, pp. 35-62, 1997.
[36] M.W. Shields, An Introduction to Automata Theory. Blackwell Scientific, 1987.
[37] M. Silva, "Introducing Petri Nets," DiCesare et al. [19] ch. 1.

Index Terms:
Petri net models, performance analysis, structural decomposition, Kronecker algebra.
Citation:
Javier Campos, Susanna Donatelli, Manuel Silva, "Structured Solution of Asynchronously Communicating Stochastic Modules," IEEE Transactions on Software Engineering, vol. 25, no. 2, pp. 147-165, March-April 1999, doi:10.1109/32.761442