Skip to main content

A Visual Formalism for the Composition of Stochastic Petri Nets

  • Conference paper
  • First Online:
Book cover Computer Performance Evaluation: Modelling Techniques and Tools (TOOLS 2002)

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

Abstract

We introduce a graphically based formalism for parallel system designs, covering both functional and stochastic behaviour. This paper focuses on the combination in one formalism of characteristics of two major approaches to formalisms for concurrent systems, namely Process Algebras and Petri Nets. We define a general form of composition on nets with stochastic delays for transitions. This incorporates place and transition fusion. Then, following the general method of CCS, we define inference rules for deriving the behaviour of a composed net from the behaviour of its components. We give a number of examples to illustrate this synthesis of Petri Nets and Process Algebras.

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. F. Bause and P. S. Kritzinger. Stochastic Petri Nets — An Introduction to the Theory. Advanced Studies in Computer Science. Vieweg, 1996.

    Google Scholar 

  2. E. Best, R. Devillers, and J. Hall. The Petri Box Calculus: A new causal algebra with multi-label communication. In G. Rozenberg, editor, Advances in Petri Nets’ 92, volume 609 of Lecture Notes in Computer Science, pages 21–69. Springer-Verlag, 1992.

    Google Scholar 

  3. S. Christensen and L. Petrucci. Towards a modular analysis of coloured petri nets. In Proc. 13th Int. Conf. on Applications and Theory of Petri Nets, volume 616 of Lecture Notes in Computer Science, pages 113–133. Springer-Verlag, 1992.

    Google Scholar 

  4. G. Clark et al. The Möbius modelling tool. In Proceedings 10th International Workshop on Petri Nets and Performance Models, pages 241–250. IEEE Comput. Soc., 2001.

    Google Scholar 

  5. G. Clark and W. H. Sanders. Implementing a stochastic process algebra within the Möbius execution modeling framework. In Proceedings 9th International Workshop on Process Algebras and Performance Models, 2001.

    Google Scholar 

  6. D. D. Deavours and W. H. Sanders. Möbius: Framework and atomic models. In Proceedings 10th International Workshop on Petri Nets and Performance Models, pages 251–260. IEEE Comput. Soc., 2001.

    Google Scholar 

  7. H. J. Genrich. Predicate/Transition nets. In Petri Nets: Central Models and their Properties, number 254 in Lecture Notes in Computer Science, pages 207–247. Springer-Verlag, 1986.

    Chapter  Google Scholar 

  8. H. Hermanns and M. Rerrelbach. Syntax, semantics, equivalences and axioms for MTIPP. Technical report, Univ. Erlangen-Nurnberg, 1995.

    Google Scholar 

  9. J. Hilston. A Compositional Approach to Performance Modelling. PhD thesis, University of Edinburgh, 1994.

    Google Scholar 

  10. R. P. Hopkins and M. Smith. Stochastic UML and its STOCON semantics. Memo, Dept. CEE, Heriot Watt University, Edinburgh, 2002.

    Google Scholar 

  11. K. Jensen. Coloured Petri Nets. EATCS Monographs on Theoretical Compputer Science. Springer-Verlag, 1992.

    Google Scholar 

  12. H. Macia, V. Valero, and D. de Frutos-Escrig. sPBC: a markovian extension of finite Petri Box Calculus. In Proceedings 9th International Workshop on Petri Nets and Performance Models, pages 207–216. IEEE Comput. Soc., 2001.

    Google Scholar 

  13. R. Milner. Communication and Concurrency. Computer Science. Prentice Hall, 1989.

    Google Scholar 

  14. A. Pagnoni. Stochastic nets and performance evaluation. In Petri Nets: Central Models and their Properties, number 254 in Lecture Notes in Computer Science, pages 460–478. Springer-Verlag, 1986.

    Chapter  Google Scholar 

  15. W. Reisig. Place/Transition systems. In Petri Nets: Central Models and their Properties, number 254 in Lecture Notes in Computer Science, pages 117–141. Springer-Verlag, 1986.

    Chapter  Google Scholar 

  16. M. Ribaudo. On the aggregation techniques in stochastic Petri nets and stochastic process algebras. The Computer Journal (Special Issue — Process Algebra and Performance Modelling), 38(7):600–611, 1995.

    Google Scholar 

  17. I. Rojas. Compositional construction of SWN models. The Computer Journal (Special Issue — Process Algebra and Performance Modelling), 38(7):613–621, 1995.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Hopkins, R., King, P. (2002). A Visual Formalism for the Composition of Stochastic Petri Nets. In: Field, T., Harrison, P.G., Bradley, J., Harder, U. (eds) Computer Performance Evaluation: Modelling Techniques and Tools. TOOLS 2002. Lecture Notes in Computer Science, vol 2324. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46029-2_19

Download citation

  • DOI: https://doi.org/10.1007/3-540-46029-2_19

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-43539-6

  • Online ISBN: 978-3-540-46029-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics