Skip to main content
SpringerLink
Log in

Kronecker Algebra and (Stochastic) Petri Nets: Is It Worth the Effort?

  • Conference paper
  • First Online:
Applications and Theory of Petri Nets 2001 (ICATPN 2001)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2075))

Included in the following conference series:

Abstract

The paper discusses the impact that Kronecker algebra had and it is having on the solution of SPN, how this has influenced not only the solution of the stochastic process associated to an SPN, but also the algorithms and the data structures for reachabilityof untimed Petri nets. Special emphasis is put in trying to clarify the advantages and disadvantages of Kronecker based approach, in terms of computational complexity, memorysa vings and applicabilityto the solution of real systems models.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. C. Beounes. Stochastic Petri net modeling for dependabilityev aluation of complex computer system. In Proc. of the International Workshop on Timed Petri nets, Torino, Italy, July 1985. IEEE-CS Press.

    Google Scholar 

  2. M. Scarpa and A. Bobbio. Kronecker representation of stochastic Petri nets with discrete PH distributions. In Proceedings of International Computer Performance and Dependability Symposium-IPDS98, IEEE Computer SocietyPress, 52–61, 1998.

    Google Scholar 

  3. P. Buchholz, and P. Kemper. On generating a hierarchyfor GSPN analysis ACM Performance Evaluation Review, Vol. 26 (2), 1998, pages 5–14.

    Article  Google Scholar 

  4. P. Buchholz. Hierarchical structuring of Superposed GSPN. In Proc. of the 7th Intern. Workshop on Petri Nets and Performance Models, pages 11–90, Saint Malo, France, June 1997. IEEE-CS Press.

    Google Scholar 

  5. P. Buchholz. A hierarchical view of GCSPN’s and its impact on qualitative and quantitative analysis. Journal of Parallel and Distributed Computing, 15(3):207–224, July 1992.

    Article  MATH  MathSciNet  Google Scholar 

  6. P. Buchholz, G. Ciardo, S Donatelli, and P. Kemper. Complexity of memory-efficient Kronecker operations with applications to the solution of Markov models. INFORMS Journal on Computing, vol. 12, n.3, summer 2000.

    Google Scholar 

  7. P. Buchholz and P. Kemper. Numerical analysis of stochastic marked graphs. In Proc. 6th Intern. Workshop on Petri Nets and Performance Models, pages 32–41, Durham, NC, USA, October 1995. IEEE-CS Press.

    Chapter  Google Scholar 

  8. J. Campos, S. Donatelli, and M. Silva. Structured solution of stochastic DSSP systems. In Proc. of the 7th Intern. Workshop on Petri Nets and Performance Models, pages 91–100, Saint Malo, France, June 1997. IEEE-CS Press.

    Google Scholar 

  9. J. Campos, S. Donatelli, and M. Silva. Structured solution of Asynchronously Communicating Stochastic Modules. In IEEE Transactions on Software Engineering, 25(2), April 1999.

    Google Scholar 

  10. G. Ciardo, G. Luettgen, and Siminiceanu. Efficient symbolic state-space construction for asynchronous systems. In Proceedings of the 21st International Conference on Application and Theory of Petri Nets, Lecture Notes in Computer Science 1825, pages 103–122, June 2000. Springer-Verlag.

    Chapter  Google Scholar 

  11. G. Ciardo and S. Donatelli. Kronecker operators and Markov chain solution. Tutorial presentation at the joint ACM SIGMETRICS and PERFORMANCE 1998 conference, June 1998, Wisconsin (USA).

    Google Scholar 

  12. G. Ciardo and A. S. Miner. Storage alternatives for large structured state spaces. In R. Marie, B. Plateau, M. Calzarossa, and G. Rubino, editors, Proc. 9th Int. Conf. on Modelling Techniques and Tools for Computer Performance Evaluation, LNCS 1245, pages 44–57, Saint Malo, France, June 1997. Springer-Verlag.

    Chapter  Google Scholar 

  13. G. Ciardo and M. Tilgner. On the use of Kronecker operators for the solution of generalized stochastic Petri nets. ICASE Report 96-35, Institute for Computer Applications in Science and Engineering, Hampton, VA, May 1996.

    Google Scholar 

  14. G. Ciardo and A. S. Miner. SMART: Simulation and Markovian Analyzer for Reliabilityand Timing. In Proc. IEEE International Computer Performance and Dependability Symposium (IPDS’96), Urbana-Champaign, IL, USA. Sept. 1996. IEEE Comp. Soc. Press.

    Google Scholar 

  15. M. Davio. Kronecker products and shuffle algebra. IEEE Transactions on Computers, 30(2):116–125, 1981.

    MATH  MathSciNet  Google Scholar 

  16. S. Donatelli. Superposed stochastic automata: a class of stochastic Petri nets with parallel solution and distributed state space. Performance Evaluation, 18:21–36, 1993.

    Article  MATH  MathSciNet  Google Scholar 

  17. S. Donatelli. Superposed generalized stochastic Petri nets: definition and efficient solution. In R. Valette, editor, Proc. of the 15th Intern. Conference on Applications and Theory of Petri Nets, volume 815 of Lecture Notes in Computer Science, pages 258–277. Springer-Verlag, Berlin Heidelberg, 1994.

    Google Scholar 

  18. S. Donatelli and P. Kemper. Integrating synchronization with priority into a Kronecker representation Performance evaluation, 44 (1-4), 2001.

    Google Scholar 

  19. S. Donatelli, S. Haddad, and P. Moreaux. Structured characterization of the Markov Chain of phase-type SPN. In Proc. 10th Int. Conf. on Modelling Techniques and Tools for Computer Performance Evaluation, Palma de Mallorca, September 98; LNCS 1469, Springer-Verlag.

    Google Scholar 

  20. P. Fernandes, B. Plateau, and W. J. Stewart. Efficient descriptor-vector multiplication in stochastic automata networks. Journal of the ACM, 45(3), 1998.

    Google Scholar 

  21. P. Fernandes, B. Plateau, and W. J. Stewart. Numerical issues for stochastic automata networks. INRIA research report no 2938, July 1996 (available byftp from ftp://ftp.inria.fr).

  22. S. Haddad, P. Moreaux, and G. Chiola. Efficient handling of phase-type distributions in generalized stochastic Petri nets. In Proc. of the 18th International Conference on Application and Theory of Petri Nets, number 1248 in LNCS, pages 175–194, Toulouse, France, June 23-27 1997. Springer-Verlag.

    Google Scholar 

  23. P. Kemper. Numerical analysis of superposed GSPN. IEEE Transactions on Software Engineering, 22(4):615–628, September 1996.

    Article  MathSciNet  Google Scholar 

  24. P. Kemper. Superposition of generalized stochastic Petri nets and its impact on performance analysis. PhD thesis, Universität Dortmund, 1996.

    Google Scholar 

  25. P. Kemper. Reachabilityanaly sis based on structured representations In Proc. 17th International Conference Application and Theory of Petri Nets, Osaka (JP), June 1996, pp. 269–288, LNCS 1091. Springer, 1996.

    Google Scholar 

  26. P. Kemper. Transient analysis of superposed GSPNs. IEEE Trans. on Software Engineering, 25(2), March/April 1999. Revised and extended version of a paper with same title in 7-th International Conference on Petri Nets and Performance Models-PNPM97, pages 101–110. IEEE Computer Society, 1997.

    Article  MathSciNet  Google Scholar 

  27. P. Kemper. SupGSPN Version 1.0-an analysis engine for superposed GSPNs. Technical report, Universitôt Dortmund, 1997.

    Google Scholar 

  28. P. Kemper F. Bause, P. Buchholz. A toolbox for functional and quantitative analysis of deds. Technical Report 680, Universität Dortmund, 1998.

    Google Scholar 

  29. P. Kemper F. Bause, P. Buchholz. A toolbox for functional and quantitative analysis of DEDS. Short paper at PERFORMANCE TOOLS’98, 10th International Conference on Modelling Techniques and Tools for Computer Performance Evaluation Palma de Mallorca, Spain, 1998; LNCS 1469, Springer-Verlag.

    Google Scholar 

  30. A.S. Miner. Superposition of generalized stochastic Petri nets and its impact on performance analysis. PhD thesis, The college of William and Mary, Williamsburg (USA), 2000.

    Google Scholar 

  31. A. Miner, G. Ciardo and S. Donatelli. Using the exact state space of a Markov model to compute approximate stationarymeasures. In J. Kurose and P. Nain, editors, Proceedings of the 2000 ACM SIGMETRICS Conference on Measurement and Modeling of Computer Systems, pages 207–216, June 2000. ACM Press.

    Google Scholar 

  32. S. Haddad and P. Moreaux. Asynchronous Composition of High Level Petri Nets: A Quantitative Approach. In Proc. of the 17th Intern. Conference on Applications and Theory of Petri Nets, June 1996, LNCS 1091, Springer-Verlag.

    Google Scholar 

  33. B. Plateau and K. Atif. Stochastic automata network for modeling parallel systems. IEEE Transactions on Software Engineering, 17(10):1093–1108, 1991.

    Article  MathSciNet  Google Scholar 

  34. B. Plateau. On the stochastic structure of parallelism and synchronization models for distributed algorithms. In Proc. 1985 ACM SIGMETRICS Conference, pages 147–154, Austin, TX, USA, August 1985. ACM Press.

    Google Scholar 

  35. B. Plateau. PEPS: A package for solving complex Markov models of parallel systems. In R. Puigjaner and D. Poiter, editors, Modeling techniques and tools for computer performance evaluation, pages 291–306. Plenum Press, New York and London, 1990.

    Google Scholar 

  36. W. J. Stewart. Introduction to the Numerical Solution of Markov Chains. Princeton University Press, 1994.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dip. di Informatica, Università di Torino, Corso Svizzera 185, 10149, Torino, Italy

    Susanna Donatelli

Authors
  1. Susanna Donatelli
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Departamento de Informática e Ingeniería de Sistemas Centro Politécnico Superior, Universidad de Zaragoza, María de Luna, 3, 50015, Zaragoza, Spain

    José-Manuel Colom

  2. Department of Computing Science, University of Newcastle upon Tyne, Newcastle upon Tyne, NE1 7RU, UK

    Maciej Koutny

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Donatelli, S. (2001). Kronecker Algebra and (Stochastic) Petri Nets: Is It Worth the Effort?. In: Colom, JM., Koutny, M. (eds) Applications and Theory of Petri Nets 2001. ICATPN 2001. Lecture Notes in Computer Science, vol 2075. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45740-2_1

Download citation

  • DOI: https://doi.org/10.1007/3-540-45740-2_1

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-42252-5

  • Online ISBN: 978-3-540-45740-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation