Advertisement

Efficient performance analysis techniques for stochastic well-formed nets and stochastic process algebras

  • G. Franceschinis
  • M. Ribaudo
VI Application of Stochastic and Timed Nets
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1492)

Abstract

Stochastic Well Formed Nets and Stochastic Process Algebras are high level description languages for the specification and the performance evaluation of concurrent systems. In both formalisms the performance analysis of the modelled system can be performed by generating a continuous time Markov chain of the size of the model state space: this often leads to the so called state space explosion problem which can prevent the possibility of completing the desired analysis. In this chapter we will present two state space aggregation techniques, each working on one of the two formalisms, allowing efficient performance analysis. The advantages and disadvantages of the two techniques will be discussed and compared.

Keywords

High Level Petri Nets Stochastic Petri Nets Stochastic Process Algebras Performance Evaluation Markov Chains Lumpability 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Greatspn home page. URL:http://www.di.unito.it/WWW/PEgroup/GreatSPN/.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.
    M. Ajmone Marsan, S. Donatelli, G. Franceschinis, and F. Neri. Reductions in Generalized Stochastic Petri Nets and Stochastic Well-formed Nets: An Overview and an Example of Application. In J. Walrand, K. Bagchi, and G. Zobrist, editors, Network Performance Modeling and Simulation. Gordon and Breach Publishers INC, 1997.Google Scholar
  4. 4.
    M. Bernardo, L. Donatiello, and R. Gorrieri. Giving a Net Semantics to Markovian Process Algebras. In Proc. 6th International Workshop on Petri Nets and Performance Models, Durham, NC, 1995.Google Scholar
  5. 5.
    M. Bernardo and R. Gorrieri. A Tutorial on EMPA: A Theory of Concurrent Processes with Nondeterminism, Priorities, Probabilities and Time. Theoretical Computer Science, 1998. to appear.Google Scholar
  6. 6.
    R. Brgan and D. Poitrenaud. An efficient algorithm for the computation of stubborn sets of well formed petri nets. In Proceedings of 16th Int. Conference on Application and Theory of Petri Nets, ICATPN '95, pages 121–140, Torino, Italy, June 1995.Google Scholar
  7. 7.
    P. Buchholz. Exact and ordinary lumpability in finite markov chains. Journal of Appl. Prob., 31:59–75, 1994.Google Scholar
  8. 8.
    P. Buchholz. Markovian Process Algebra: Composition and Equivalence. In U. Herzog and M. Rettelbach, editors, Proc. 2 nd Workshop on Process Algebra and Performance Modelling, Erlangen, 1994.Google Scholar
  9. 9.
    G. Chiola, G. Bruno, and T. Demaria. Introducing a color formalism into generalized stochastic Petri nets. In Proc. 9 th Europ. Workshop on Application and Theory of Petri Nets, Venezia, Italy, June 1988.Google Scholar
  10. 10.
    G. Chiola, C. Dutheillet, G. Franceschinis, and S. Haddad. On Well-Formed coloured nets and their symbolic reachability graph. In Proc. 11 th Intern. Conference on Application and Theory of Petri Nets, Paris, France, June 1990. Reprinted in High-Level Petri Nets. Theory and Application, K. Jensen and G. Rozenberg (editors), Springer Verlag, 1991.Google Scholar
  11. 11.
    G. Chiola, C. Dutheillet, G. Franceschinis, and S. Haddad. Stochastic Well-Formed coloured nets and multiprocessor modelling applications. In K. Jensen and G. Rozenberg, editors, High-Level Petri Nets. Theory and Application. Springer Verlag, 1991.Google Scholar
  12. 12.
    G. Chiola, C. Dutheillet, G. Franceschinis, and S. Haddad. Stochastic well-formed coloured nets for symmetric modelling applications. IEEE Transactions on Computers, 42(11), Nov. 1993.Google Scholar
  13. 13.
    G. Chiola, C. Dutheillet, G. Franceschinis, and S. Haddad. A Symbolic Reachability Graph for Coloured Petri Nets. Theoretical Computer Science B (Logic, semantics and theory of programming), 176(1&2):39–65, April 1997.Google Scholar
  14. 14.
    G. Chiola and G. Franceschinis. A structural colour simplification in Well-Formed coloured nets. In Proc. 4 th Intern. Workshop on Petri Nets and Performance Models, pages 144–153, Melbourne, Australia, Dec. 1991. IEEE-CS Press.Google Scholar
  15. 15.
    G. Chiola, G. Franceschinis, and R. Gaeta. A symbolic simulation mechanism for Well-Formed coloured Petri nets. In Proc. 25 th SCS Annual Simulation Symposium, Orlando, Florida, April 1992.Google Scholar
  16. 16.
    G. Chiola, G. Franceschinis, and R. Gaeta. Modelling symmetric computer architectures by SWNs. In Proc. of the 15 th Intern. Conference on Applications and Theory of Petri Nets, number 815 in Lecture Notes in Computer Science. Springer-Verlag, 1994.Google Scholar
  17. 17.
    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, 1995.Google Scholar
  18. 18.
    E.M. Clarke, R. Enders, T. Filkorn, and S. Jha. Exploiting symmetry in temporal logic model checking. Formal methods in system design, 9:77–104, 1996.Google Scholar
  19. 19.
    S. Donatelli. Superposed stochastic automata: a class of stochastic Petri nets with parallel solution and distributed state space. Performance Evaluation, 18:21–36, 1993.Google Scholar
  20. 20.
    C. Dutheillet and S. Haddad. Regular stochastic Petri nets. In Proc. 10th Intern. Conf. Application and Theory of Petri Nets, Bonn, Germany, June 1989.Google Scholar
  21. 21.
    E. Allen Emerson and A. Prasad Sistla. Symmetry and model checking. Formal methods in system design, 9:105–131, 1996.Google Scholar
  22. 22.
    G. Franceschinis and R.R. Muntz. Bounds for quasi-lumpable markov chains. Performance Evaluation, 20(1), May 1994. (Performance '93. 16th IFIP Working Group 7.3 International Symposium on Computer Performance Modeling, Measurement and Evaluation, Rome, Italy, 27 Sept.–1 Oct. 1993).Google Scholar
  23. 23.
    G. Franceschinis and R.R. Muntz. Computing bounds for the performance indices of quasi-lumpable stochastic well-formed nets. IEEE Transactions on Software Engineering, 20(7), July 1994.Google Scholar
  24. 24.
    S. Gilmore and J. Hillston. The PEPA workbench: A tool to support a Process Algebra based approach to performance modelling. In Proc. Seventh International Conference on Modelling Techniques and Tools for Computer Performance Evaluation, Vienna, 1994.Google Scholar
  25. 25.
    S. Gilmore, J. Hillston, and M. Ribaudo. An Efficient Algorithm for Aggregating PEPA Models. Technical report, University of Edinburgh, 1998.Google Scholar
  26. 26.
    S. Haddad. Une Categorie Regulier de Reseau de Petri de Haut Niveau: Definition, Proprietes et Reductions. PhD thesis, Lab. MASI, Universite P. et M. Curie (Paris 6), Paris, France, Oct 1987. These de Doctorat, RR87/197 (in French).Google Scholar
  27. 27.
    S. Haddad, J-M Ilie, M. Taghelit, and B. Zouari. Symbolic marking graph and partial symmetries. In Proceedings of 16th Int. Conference on Application and Theory of Petri Nets, ICATPN '95, pages 238–257, Torino, Italy, June 1995.Google Scholar
  28. 28.
    S. Haddad and P. Moreaux. Evaluation of High Level Petri nets by means of aggregation and decomposition. In Proc. 6 th Intern. Workshop on Petri Nets and Performance Models, Durham, NC, USA, Oct. 1995.Google Scholar
  29. 29.
    H. Hermanns, U. Herzog, and V. Mertsiotakis. Stochastic Process Algebras-Between LOTOS and Markov Chains. Computer Networks and ISDN Systems, 1998. to appear.Google Scholar
  30. 30.
    H. Hermanns, V. Mertsiotakis, and M. Rettelbach. A Construction and Analysis Tool Based on the Stochastic Process Algebra TIPP. In Proc. of 2nd Int. Workshop on Tools and Algorithms for the Construction and Analysis of Systems (TACAS '96), volume 1055 of LNCS. Springer, 1996.Google Scholar
  31. 31.
    J. Hillston. The Nature of Synchronization. In U. Herzog and M. Rettelbach, editors, Proc. 2 nd Workshop on Process Algebra and Performance Modelling, Erlangen, 1994.Google Scholar
  32. 32.
    J. Hillston. Compositional Markovian modelling using a process algebra. In Proc. 2nd International Workshop on the Numerical Solution of Markov Chains, Raleigh, North Carolina, Jan. 1995.Google Scholar
  33. 33.
    Jane Hillston. A Compositional Approach to Performance Modelling. Cambridge University Press, 1996.Google Scholar
  34. 34.
    C.A.R. Hoare. Communicating Sequential Processes. Prentice-Hall, 1985.Google Scholar
  35. 35.
    P. Huber, A.M. Jensen, L.O. Jepsen, and K. Jensen. Towards reachability trees for high-level Petri nets. In G. Rozenberg, editor, Advances on Petri Nets '84, volume 188 of LNCS, pages 215–233. Springer Verlag, 1984.Google Scholar
  36. 36.
    J-M. Ilie and K. Ajami. Model checking through the symbolic reachability graph. In Proc. of TapSoft'97 Theory and Practice of Software Development — 7th CAAP, LNCS 1214, pages 213–224, Lille, France, April 1997. Springer-Verlag. Extended version in An Automatique Technique for CTL * Model Checking, LIP6 Internal Report n.017, 1997.Google Scholar
  37. 37.
    K. Jensen. An introduction to the practical use of Coloured Petri nets. In this book.Google Scholar
  38. 38.
    K. Jensen. Coloured Petri Nets, Basic Concepts, Analysis Methods and Practical Use Volume 2. Springer Verlag, 1995.Google Scholar
  39. 39.
    K. Jensen and G. Rozenberg, editors. High-Level Petri Nets. Theory and Application. Springer Verlag, 1991.Google Scholar
  40. 40.
    J. B. Jorgensen and L. M. Kristensen. Verification of Coloured Petri Nets Using State Space Equivalneces. In Petri Nets in System Engineering (PSNE '97) Modelling, Verification, and Validation-FBI-HH-B-205/97 Hamburgh, 1997.Google Scholar
  41. 41.
    C. Lin and D.C. Marinescu. On stochastic high level Petri nets. In Proc. Intern. Workshop on Petri Nets and Performance Models, Madison, WI, USA, August 1987. IEEE-CS Press.Google Scholar
  42. 42.
    M. Linqvist. Parametrized reachability trees for predicate transition nets. In Proc. 11 th Intern. Conference on Application and Theory of Petri Nets, Paris, France, June 1990.Google Scholar
  43. 43.
    R. Milner. Communication and Concurrency. Prentice Hall, 1989.Google Scholar
  44. 44.
    D. Park. Concurrency and Automata on Infinite Sequences. In Proc. 5 th GI Conf. on Theoretical Computer Science, volume 104 of LNCS, 1981.Google Scholar
  45. 45.
    G.D. Plotkin. An operational semantics for CSP. Technical Report CSR-114-82, The University of Edinburgh, May 1982.Google Scholar
  46. 46.
    R.Gaeta. Efficient discrete-event simulation of colored petri nets. IEEE Transaction on Software Engineering, 22(9):629–639, Sept. 1996.Google Scholar
  47. 47.
    M. Ribaudo. On the Aggregation Techniques in Stochastic Petri Nets and Stochastic Process Algebras. The Computer Journal, 38(6), 1995.Google Scholar
  48. 48.
    M. Ribaudo. Stochastic Petri nets semantics for stochastic process algebras. In Proc. 6 th Intern. Workshop on Petri Nets and Performance Models, Durham, NC, USA, Oct. 1995.Google Scholar
  49. 49.
    W. H. Sanders and J. F. Meyer. Reduced base model construction methods for stochastic activity networks. IEEE Journal on Selected Areas in Communications, 9(1):25–36, Jan. 1991. Special Issue on Computer-Aided Modeling, Analysis and Design of Communication Networks.Google Scholar
  50. 50.
    A. Valmari. Stubborn sets of coloured petri nets. In Proceedings of 12th Int. Conference on Application and Theory of Petri Nets, ICATPN '91, pages 102–121, Gjern, Denmark, June 1991.Google Scholar
  51. 51.
    A. Zenie. Colored stochastic Petri nets. In Proc. Intern. Workshop on Timed Petri Nets, pages 262–271, Torino, Italy, July 1985. IEEE-CS Press.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1998

Authors and Affiliations

  • G. Franceschinis
    • 1
  • M. Ribaudo
    • 1
  1. 1.Dipartimento di InformaticaUniversità di TorinoTorinoItaly

Personalised recommendations