Skip to main content

Towards a modular analysis of coloured Petri nets

  • Submitted Papers
  • Conference paper
  • First Online:
Application and Theory of Petri Nets 1992 (ICATPN 1992)

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

Included in the following conference series:

Abstract

The use of different High-level Petri net formalisms has made it possible to create Petri net models of large systems. Even though the use of such models allows the modeller to create compact representations of data and action, the size of models has been increasing. A large model can make it difficult to handle the complexity of the modelling as well as the analysis of the total model. It is well-known that the use of a modular approach to modelling has a lot of advantages. A modular approach allows the modeller to consider different parts of the system independently of one another and also to reuse the same module in different systems. A modular approach to analysis is also attractive. It often dramatically decreases the complexity of the analysis task.

In this paper, we present modular CP-nets. They are not intended to be used for practical modelling purposes, but they constitute a formal and general framework for discussing different ways of composing individual CP-nets called modules. Modular CP-nets allow us to study composition without restricting the structure of the individual modules. Modular CP-nets are quite simple and do not include syntactical sugar which is convenient and often necessary when modelling in practice. Instead, they have only a few but very general composition constructs.

The main result of the paper is the possibility of composing analysis results of the individual modules, in order to obtain results which are valid for the entire modular CP-net. For this purpose, we introduce place invariants at the level of modular CP-nets and we show how such place invariants can be obtained from those of the individual modules.

The reader of this paper is assumed to be familiar with the basic definitions of CP-nets and the concept of place invariants. But it is not necessary to be familiar with hierarchical CP-nets.

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. E. Battiston, F. De Cindio, G. Mauri: OBJSA nets systems: a class of high-level nets having objects as domains. In: G. Rozenberg (ed.): Advances in Petri Nets 1988. Lecture Notes in Computer Science, vol 340. Springer-Verlag, 1988, pp. 20–43. Also in [JR91], pp. 189–212.

    Google Scholar 

  2. E. Battiston, L. Petrucci, L. Rapanotti: Establishing a relationship between OBJSA nets systems and algebraic nets schemes. DEMON Esprit BRA n∘ 3148, Technical Report 185, 1991.

    Google Scholar 

  3. S. Christensen, N. Damgaard Hansen: Coloured Petri nets extended with channels for synchronous communication. Daimi PB-390, ISSN 0105-8517, April 1992.

    Google Scholar 

  4. G. Chehaibar: Use of reentrant nets in Modular analysis of coloured Petri nets. In: G. Rozenberg (ed.): Advances in Petri Nets 1991. Lecture Notes in Computer Science, vol 524. Springer-Verlag, 1991, pp. 58–77. Also in [JR91], pp. 596–617.

    Google Scholar 

  5. S. Christensen, L. O. Jepsen: Modelling and simulation of a network management system using hierarchical coloured Petri nets. In Erik Mosekilde (ed.):-Proceedings of the 1991 European Simulation Multiconference. ISBN 0-911801-92-8, pp. 47–52. An extended version available as: Daimi PB-349, ISSN 0105-8517, April 1991.

    Google Scholar 

  6. C. Dimitrovici, U. Hummert, L. Petrucci: Semantics, composition and net properties of algebraic high-level nets. In: G. Rozenberg (ed.): Advances in Petri Nets 1991. Lecture Notes in Computer Science, vol 524. Springer-Verlag, 1991, pp. 93–117.

    Google Scholar 

  7. A. Finkel, C. Johnen, L. Petrucci: Decomposition of Petri nets for parallel analysis. CEDRIC Research Report, November 1991.

    Google Scholar 

  8. A. Finkel, L. Petrucci: Avoiding state explosion by composition of minimal covering graphs. Proceedings of the 3rd Computer-Aided Verification Workshop,Ålborg, Denmark, July 1991, pp. 224–237. To appear in Lecture Notes in Computer Science.

    Google Scholar 

  9. P. Huber, A. M. Jensen, K. Jensen, L. O. Jepsen: Reachability trees for high-level Petri nets. Theoretical Computer Science n∘45, 1986, pp. 261–292. Also in [JR91], pp. 319–350.

    Google Scholar 

  10. P. Huber, K. Jensen and R. M. Shapiro: Hierarchies in coloured Petri nets. In: G. Rozenberg (ed.): Advances in Petri Nets 1990. Lecture Notes in Computer Science, vol 383. Springer-Verlag, 1990, pp. 342–416. Also in [JR91], pp. 215–243.

    Google Scholar 

  11. P. Huber, V. O. Pinci: A formal, executable specification of the ISDN basic rate interface. Proceedings of the 12th International Conference on Application and Theory of Petri Nets, Aarhus, Denmark, 199i, pp. 1–21.

    Google Scholar 

  12. K. Jensen: Coloured Petri nets and the invariant method. Theoretical Computer Science n∘14, 1981, pp. 317–336.

    Article  Google Scholar 

  13. K. Jensen: Coloured Petri nets. In: G. Rozenberg (ed.): Advances in Petri Nets 1986, Part I. Lecture Notes in Computer Science, vol 254. Springer-Verlag, 1986, pp. 248–299.

    Google Scholar 

  14. K. Jensen: Coloured Petri nets: A high level language for system design and analysis. In: G. Rozenberg (ed.): Advances in Petri Nets 1990. Lecture Notes in Computer Science, vol 383. Springer-Verlag, 1990, pp. 342–416. Also in [JR91], pp. 44–119.

    Google Scholar 

  15. K. Jensen: Coloured Petri nets. Basic concepts, analysis methods and practical use. Volume 1: Basic concepts. To appear in EATCS monographs on Theoretical Computer Science, Springer-Verlag 1992.

    Google Scholar 

  16. K. Jensen and G. Rozenberg (eds.): High-level Petri nets: theory and application. Springer-Verlag 1991. ISBN 3-540-54125-X/0-387-54125-X.

    Google Scholar 

  17. Y. Narahari, N. Viswanadham: On the invariants of coloured Petri nets. In: G. Goos and J. Hartmanis (eds.): Advances in Petri Nets 1985. Lecture Notes in Computer Science, vol 222. Springer-Verlag, 1985, pp. 330–341.

    Google Scholar 

  18. W. Reisig: Petri nets and algebraic specifications. Theoretical Computer Science n∘80, 1991, pp. 1–34. Also in [JR91], pp. 137–170.

    Google Scholar 

  19. A. Valmari: Compositional state space generation. Proceedings of the 11th International Conference on Application and Theory of Petri Nets, Paris, France, June 1990, pp. 43–62.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

K. Jensen

Rights and permissions

Reprints and permissions

Copyright information

© 1992 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Christensen, S., Petrucci, L. (1992). Towards a modular analysis of coloured Petri nets. In: Jensen, K. (eds) Application and Theory of Petri Nets 1992. ICATPN 1992. Lecture Notes in Computer Science, vol 616. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-55676-1_7

Download citation

  • DOI: https://doi.org/10.1007/3-540-55676-1_7

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-55676-3

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics