Modelling and analysis of distributed software using GSPNs

  • Susanna Donatelli
  • Giuliana Franceschinis
VI Application of Stochastic and Timed Nets
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1492)


This chapter discusses the role that Generalized Stochastic Petri Nets (GSPN) can play in the static analysis of distributed software. The material is organized along two main lines: the need and the advantages of studying both qualitative and quantitative aspects of a program, and the need for doing it in an automatic manner. The role of performance evaluation in the analysis of distributed software is illustrated through a small example, classical in the qualitative approach (the dining philosophers). Although small this example allows to point out the need and the requirements of automatic translation and to discuss the main hypothesis behind program performance evaluation through GSPN models. A procedure for the automatic generation of GSPN models starting from a distributed program written in a CSP-like language, and for the definition of program performance indices in terms of GSPN ones is then given and illustrated by means of a realistic example.


Computer Aided Distributed Software Engineering Verification Performance Analysis Stochastic Petri Nets Automatic Generation of GSPN models 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    M. Ajmone Marsan, G. Balbo, G. Conte, S. Donatelli, and G. Franceschinis. Modelling with Generalized Stochastic Petri Nets. J. Wiley, 1995.Google Scholar
  2. 2.
    M. Ajmone Marsan, A. Bobbio, and S. Donatelli. Petri Nets in Performance Analysis: an Introduction. In this book.Google Scholar
  3. 3.
    G. Balbo, S. Donatelli, and G. Franceschinis. Understanding parallel program behavior through Petri net models. Journal of Parallel and Distributed Computing, 15(3):171–187, July 1992.Google Scholar
  4. 4.
    G. Balbo, S. Donatelli, G. Fanceschinis, A. Mazzeo, N. Mazzocca, and M. Ribaudo. On the computation of performance characteristics of concurrent programs using GSPNs. Performance Evaluation, 19:195–222, 1994.Google Scholar
  5. 5.
    G. Chiola, G. Franceschinis, R. Gaeta, and M. Ribaudo. GreatSPN 1.7: Graphical Editor and Analyzer for Timed and Stochastic Petri Nets. Performance Evaluation, special issue on Performance Modeling Tools, 24(1&2):47–68, November 1995Google Scholar
  6. 6.
    F. De Cindio and O. Botti. Comparing Occam 2 program placements by a GSPN model. In Proc. 4 th Intern. Workshop on Petri Nets and Performance Models, pages 216–221, Melbourne, Australia, December 1991. IEEE-CS Press.Google Scholar
  7. 7.
    S. Donatelli and G. Franceschinis. The PSR methodology: integrating hardware and software models. In Proc. of the 17 th International Conference in Application and Theory of Petri Nets, ICATPN '96, Osaka, Japan, june 1996. Springer Verlag. LNCS, Vol 1091.Google Scholar
  8. 8.
    S. Donatelli, G. Franceschinis, N. Mazzocca, and S. Russo. Software architecture of the EPOCA integrated environment. In Proc. of the 7 th Intern. Conference on Modelling Techniques and Tools for Computer Performance Evaluation, May 1994.Google Scholar
  9. 9.
    S. Donatelli, G. Franceschinis, M. Ribaudo, and S. Russo. Use of GSPNs for concurrent software validation in EPOCA. Information and Software Technology, 36(7):443–448, 1994.Google Scholar
  10. 10.
    G. Franceschinis and M. Ribaudo. Efficient Performance Analysis Techniques for Stochastic Well-formed Nets and Stochastic Process Algebras. In this book.Google Scholar
  11. 11.
    U. Goltz and W. Reisig. CSP programs as nets with individual tokens. In Proc. 5 th Intern. Conference on Application and Theory of Petri Nets, Aarhus, Denmark, June 1984.Google Scholar
  12. 12.
    Ursula Goltz. On representing CCS programs by finite Petri nets. In Mathematical Foundations of Computer Science, volume 324 of LNCS, 1988.Google Scholar
  13. 13.
    Bernd Grahlmann. The Reference Component of PEP. In Ed Brinksma, editor, Proceedings of TACAS'97 (Tools and Algorithms for the Construction and Analysis of Systems), volume 1217 of Lecture Notes in Computer Science, pages 65–80. Springer-Verlag, April 1997.Google Scholar
  14. 14.
    C.A.R. Hoare. Communicating sequential processes. Communications of the ACM, 21(8):666–677, August 1978.Google Scholar
  15. 15.
    R. Milner. A Calculus of Communicating Systems, volume 92 of LNCS. Springer-Verlag, Berlin, Germany, 1980.Google Scholar
  16. 16.
    T. Murata, B. Shenker, and S. Shatz. Detection of Ada static deadlocks using Petri nets invariants. IEEE Transactions on Software Engineering, 15(3):314–326, March 1989.Google Scholar
  17. 17.
    Leo Ojala and Johan Lilius. Development and reachability analysis tools at Helsinki University of Technology. Petri Net Newsletter, (47):36–42, 1994.Google Scholar
  18. 18.
    Lucia Ragliani. Analisi di programmi paralleli mediante modelli GSPN, june 1994.Google Scholar
  19. 19.
    S.M. Shatz and W.K. Cheng. A Petri net framework for automated static analysis of Ada tasking. The Journal of Systems and Software, 8:343–359, October 1987.Google Scholar
  20. 20.
    R. Taylor. A general purpose algorithm for analyzing concurrent programs. Communications of ACM, 26, May 1983.Google Scholar
  21. 21.
    Kimmo Varpaaniemi, Jaakko Halme, Kari Hiekkanen, and Tino Pyssysalo. Prod reference manual. Technical Report B13, Helsinki University of Technology, Digital Systems Laboratory, Espoo, Finland, August 1995. PROD home page URL: Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1998

Authors and Affiliations

  • Susanna Donatelli
    • 1
  • Giuliana Franceschinis
    • 1
  1. 1.Dipartimento di InformaticaUniversità di TorinoTorinoItaly

Personalised recommendations