Skip to main content

Stochastic Well-Formed Coloured Nets and Multiprocessor Modelling Applications

  • Chapter
High-level Petri Nets

Abstract

The new class of Stochastic Well-formed coloured Nets (SWN) is defined as a syntactic restriction of Stochastic High-Level Nets. The interest of the introduction of restrictions in the model definition is the possibility of exploiting the Symbolic Reachability Graph (SRG) to reduce the complexity of Markovian performance evaluation with respect to classical Petri net techniques. It turns out that SWNs allow the representation of any colour function in a structured form, so that any unconstraint high-level net can be transformed into a well formed net. Moreover, most constructs useful for the modelling of distributed computer systems and architectures directly match the “well form” restriction, without any need of transformation. A non trivial example of the usefulness of the technique in the performance modelling and evaluation of multiprocessor architectures is included.

This work has been done while G. Chiola was visiting researcher at the Lab. MASI of the University of Paris 6, with the financial support of a NATO-CNR annual research grant.

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

Access this chapter

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. M. K. Molloy. Performance analysis using stochastic Petri nets. IEEE Transaction on Computers, 31 (9): 913–917, September 1982.

    Article  Google Scholar 

  2. M. Ajmone Marsan, G. Balbo, G. Conte, and F. Gregoretti. Modeling bus contention and memory interference in a multiprocessor system. IEEE Transactions on Computers, 32 (1): 60–72, January 1983.

    Article  Google Scholar 

  3. M. Ajmone Marsan, G. Balbo, and G. Conte. A class of generalized stochastic Petri nets for the performance analysis of multiprocessor systems. ACM Transactions on Computer Systems, 2 (1), May 1984.

    Google Scholar 

  4. M. Ajmone Marsan, G. Chiola, and G. Conte. Generalized stochastic Petri net models of multiprocessôrs with cache memories. In Proc. 1 8{ Int. Conf. on Supercomputing Systems, IEEE, St. Petersburg, FL, December 1985.

    Google Scholar 

  5. M. Ajmone Marsan, G. Balbo, and G. Conte. Performance Models of Multiprocessor Systems. MIT Press, Cambridge, USA, 1986.

    Google Scholar 

  6. M. Ajmone Marsan and G. Chiola. Construction of generalized stochastic Petri net models of bus oriented multiprocessor systems by stepwise refinements. In Proc. 2’ Int. Conf. on Modeling Techniques and Tools for Performance Analysis, ACM, Sophia Antipolis, France, June 1985.

    Google Scholar 

  7. M. Ajmone Marsan, G. Balbo, G. Chiola, and G. Conte. Modeling the software architecture of a prototype parallel machine. In Proc. 1987 SIGMETRICS Conference, ACM, Banf, Alberta, Canada, May 1987.

    Google Scholar 

  8. Chuang Lin and C. Marinescu. Stochastic high level Petri nets and applications. IEEE Transactions on Computers, 37 (7): 815–825, July 1988.

    Article  Google Scholar 

  9. 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 

  10. C. Dutheillet and S. Haddad. Aggregation and disaggregation of states in colored stochastic Petri nets: application to a multiprocessor architecture. In Proc. 3rd Intern. Workshop on Petri Nets and Performance Models, IEEE-CS Press, Kyoto, Japan, December 1989.

    Google Scholar 

  11. 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, pages 215–233, Springer Verlag, 1984.

    Google Scholar 

  12. A. Zenie. Colored stochastic Petri nets. In Proc. Int. Workshop on Timed Petri Nets, pages 262–271, IEEE-CS Press, Torino, Italy, July 1985.

    Google Scholar 

  13. J. A. Carrasco. Automated construction of compound Markov chains from generalized stochastic high-level Petri nets. In Proc. 3rd Intern. Workshop on Petri Nets and Performance Models, pages 93–102, IEEE-CS Press, Kyoto, Japan, December 1989.

    Google Scholar 

  14. G. Chiola, C. Dutheillet, G. Franceschinis, and S. Haddad. On well-formed coloured nets and their symbolic reachability graph. In Proc. 11 th International Conference on Application and Theory of Petri Nets, Paris, France, June 1990.

    Google Scholar 

  15. J.G. Kemeni and J.L. Snell. Finite Markov Chains. Van Nostrand, Princeton, NJ, 1960.

    Google Scholar 

  16. Claude Dutheillet. Symétries dans les réseaux colorés: Définition, analyse et application à l’évaluation de performances. PhD thesis, Laboratoire MASI, Université Paris 6, France, January 1991. thèse de l’Université P. et M. Curie (in French).

    Google Scholar 

  17. K. Jensen. Coloured Petri nets and the invariant method. Theoretical Computer Science, 14: 317336, 1981.

    Google Scholar 

  18. G. Chiola, S. Donatelli, and G. Franceschinis. Priorities, Inhibitor Arcs, and Concurrency in P/T nets. Technical Report, Dipartimento di Informatica, Università di Torino, Corso Svizzera 185, 10149 Torino, Italy, January 1991. (submitted to ATPN’91 Aarhus).

    Google Scholar 

  19. G. Chiola, S. Donatelli, and G. Franceschinis. On Parametric P/T nets and their Modelling Power. Technical Report, Dipartimento di Informatica, Università di Torino, Corso Svizzera 185, 10149 Torino, Italy, January 1991. (submitted to ATPN’91 Aarhus).

    Google Scholar 

  20. 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 

  21. M. Ajmone Marsan, G. Balbo, G. Chiola, and G. Conte. Generalized stochastic Petri nets revisited: random switches and priorities. In Proc. Int. Workshop on Petri Nets and Performance Models, pages 44–53, IEEE-CS Press, Madison, WI, USA, August 1987.

    Google Scholar 

  22. M. Ajmone Marsan, G. Balbo, and G. Conte. Comparative performance analysis of single bus multiprocessor architectures. IEEE Transactions on Computers, 31 (12), December 1982.

    Google Scholar 

  23. G. Chiola and G. Franceschinis. Colored GSPN models and automatic symmetry detection. In Proc. 3rd Intern. Workshop on Petri Nets and Performance Models, IEEE-CS Press, Kyoto, Japan, December 1989.

    Google Scholar 

  24. S. Haddad. Generalization of reduction theory to coloured nets. In Proc. 9th Europ. Workshop on Application and Theory of Petri Nets, Venezia, Italy, June 1988.

    Google Scholar 

Download references

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1991 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Chiola, G., Dutheillet, C., Franceschinis, G., Haddad, S. (1991). Stochastic Well-Formed Coloured Nets and Multiprocessor Modelling Applications. In: Jensen, K., Rozenberg, G. (eds) High-level Petri Nets. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-84524-6_19

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-84524-6_19

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-54125-7

  • Online ISBN: 978-3-642-84524-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics