Skip to main content

Transformations and decompositions of nets

  • Conference paper
  • First Online:
Petri Nets: Central Models and Their Properties

Part of the book series: Lecture Notes in Computer Science ((volume 254))

Abstract

We present a set of transformations of place/transition systems which preserve several classical properties of nets namely boundedness, deadlock freeness, liveness and covering by S-invariants. These transformations may simplify or refine a system and allow either to simplify a place/transition system before analysing it or to introduce more details in a given system having some propreties without changing them. We also present a decomposition technique to split a system into subsytems which can be analysed separatly.

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. C.André “systèmes à évolutions parallèles: modélisation par réseaux de Petri à capacités et analyse par abstraction” thèse d'état, Université de Nice, France, February 1981.

    Google Scholar 

  2. C.André “behaviour of a place/transition Net on a subset of transitions” IFB 52 Springer Verlag 1982.

    Google Scholar 

  3. C.André “ Structural transformations giving B-equivalent PT-nets” IFB 66, Springer-Verlag 1983.

    Google Scholar 

  4. G.Berthelot “Transformations et analyse de Réseaux de Petri.Application aux protocoles” Thèse d'état, Université P. et M. Curie, Paris France, June 1983.

    Google Scholar 

  5. G.Berthelot “Checking properties of Nets using transformations” LNCS 222 Advances in Petri Nets 85, G. Rozenberg ed, Springer-Verlag 1986.

    Google Scholar 

  6. N.H. Beldiceanu “Vérification de propriétés de réseaux de Petri à l'aide de règles de production” Rapport de recherche MASI n∘154, Université P. et M. Curie, Paris, France, October 1986

    Google Scholar 

  7. E.Best, C.Fernandez “Notations and terminology on Petri Nets theory” Arbeitspapiere der GMD n∘ 195, January 1986.

    Google Scholar 

  8. F.De Cindio, G.De Michelis, L.Pomello, C.Simone “Exhibited-Behaviour equivalence and Organizational abstraction in concurrent system design” The 5th Int. Conf on Distributed Computing Systems, Denver, Colorado, May 13–17, 1985, IEEE, pp 486–495.

    Google Scholar 

  9. F. De Cindio, G. De Michelis, C. Simone “Giving back some freedom to system designer”. System Research, n∘2.4, 1985.

    Google Scholar 

  10. Genrich, Lautenbach, Thiagarajan “Elements of general Net theory”, LNCS 84, Springer-Verlag 1980.

    Google Scholar 

  11. M.Hack “Extended State-Machine allocatable Nets, an extension of Free Choice Petri Nets results” Cambridge, Massachussets, MIT Project MAC, CSG-Memo 78-1, 1974

    Google Scholar 

  12. S.Haddad. Private conversation, lecture notes and thèse de 3ième cycle Université P. et M. Curie, Paris France, to appear in March1987.

    Google Scholar 

  13. K.Lautenbach “Linear algebraic techniques for Place/Transitions Nets”. Proceedings of the Advanced Course on Petri Nets, Bad Honnef, Germany, September 8–19, 1986.

    Google Scholar 

  14. G.Memmi “Advanced algebraic techniques”. Proceedings of the Advanced Course on Petri Nets, Bad Honnef, Germany. September 8–19, 1986.

    Google Scholar 

  15. R.Milner “A calculus for communicating systems”, LNCS 92, Springer-Verlag 1980.

    Google Scholar 

  16. L.Pomello “Some equivalence notions for concurrent systems: An overview”, LNCS 222 Advances in Petri Nets 85, G.Rozenberg ed. Springer-Verlag 1986.

    Google Scholar 

  17. M.Placide “Transformations de réseaux de Petri préservant des propriétés significatives. Définition des homomorphismes associés” Thèse de 3ième cycle, Université de Nice, France, December 1982.

    Google Scholar 

  18. W.Reisig “Place/Transition Systems” Proceedings of the Advanced Course on Petri Nets, Bad Honnef, Germany. September 8–19, 1986.

    Google Scholar 

  19. I.Suzuki, T.Murata “Stepwise refinements of transitions and places” IFB 52, Springer-Verlag 1982.

    Google Scholar 

  20. R.Valette “Analysis of Petri Nets by stepwise refinement” J. Compt. System Sci., vol 18, n∘1, pp 35–46, February 1979.

    Article  MATH  MathSciNet  Google Scholar 

  21. K.Voss “On the notion of interface in condition/event-systems” IFB 66, Springer-Verlag 1983.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

W. Brauer W. Reisig G. Rozenberg

Rights and permissions

Reprints and permissions

Copyright information

© 1987 Springer-Verlag

About this paper

Cite this paper

Berthelot, G. (1987). Transformations and decompositions of nets. In: Brauer, W., Reisig, W., Rozenberg, G. (eds) Petri Nets: Central Models and Their Properties. Lecture Notes in Computer Science, vol 254. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0046845

Download citation

  • DOI: https://doi.org/10.1007/BFb0046845

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-17905-4

  • Online ISBN: 978-3-540-47919-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics