Skip to main content

Checking properties of nets using transformations

  • Conference paper
  • First Online:
Advances in Petri Nets 1985 (APN 1985)

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

Included in the following conference series:

Abstract

In order to make easier the verification of parallel systems, we present a set of transformations which preserve several classical properties of nets: boundednes, safety, covering by S-invariants, proper termination, home states, unavoidable states, liveness and abstraction. These transformations are powerful enough to construct all other transformations defined before. We conclude with examples of possible utilisations.

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.

Bibliography-References

  1. C.André "Systèmes à évolutions parallèles: modélisation par réseaux de petri à capacité et analyse par abstraction" Thèse d'état, Université de Nice, February 1981

    Google Scholar 

  2. G.Berthelot "vérification de réseaux de Petri" Thèse de troisième cycle, Université Paris 6, 12 January 1978

    Google Scholar 

  3. G.Berthelot, R.Terrat "Petri nets theory for correctness of protocols" IEEE trans. on Com. vol. COM 30 n.12, December 1982

    Google Scholar 

  4. G.Berthelot "Transformations et analyse de réseaux de Petri. Application aux protocoles" Thèse d'état, Université Paris 6, June 1983

    Google Scholar 

  5. G.V.Bochmann, J.Gecsei "A unified method for the specification and verification of protocols" IFIP Congress, Toronto, August 1977

    Google Scholar 

  6. G.W.Brams "Réseaux de Petri: théorie et pratique" Masson editor, Paris, 1982

    Google Scholar 

  7. "Net Theory and Applications" Lecture Notes in Computer Science 84, Springer-Verlag, 1980.

    Google Scholar 

  8. K. Gostelow, V.G. Cerf, G. Estrin, S. Volansky "Proper termination of flow of control in programs involving concurrent processes" SIGPLAN NOTICES 7,11, 1972

    Google Scholar 

  9. M.Hack "Extended state machines allocatables nets, an extension of free choice Petri nets résults" MIT Project MAC CSG memo 78(1),1974

    Google Scholar 

  10. M.Hack "Decision problems for Petri nets and vector addition systems" MIT Project MAC tech. memo 59, 1975

    Google Scholar 

  11. T.Kasai, R.E.Miller "Homomorphisms between models of parallel computation" IBM T.J.Watson center report RC 7796, February 1979

    Google Scholar 

  12. V.E.Kotov "An algebra for parallelism based on Petri nets" Proc. of MFCS 78, LNCS 64, Springer-Verlag 1978

    Google Scholar 

  13. G.Memmi "Méthodes d'analyse de réseaux de petri, réseaux à files et applications aux systèmes temps réels" Thèse d'état, Université Paris 6, 7 June 1983

    Google Scholar 

  14. R.Milner "A calculus of communicating systems" LNCS 92, Springer-Verlag, 1980

    Google Scholar 

  15. M.Moalla, J.Pulou, J.Sifakis "Synchronized Petri nets: a model for the description of non-autonomous systems" Proc. of MFCS 78, LNCS 64, Springer-Verlag

    Google Scholar 

  16. N.V.Stenning "A data transfert protocol" Computer Networks vol. 1 n.2, 1976

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

G. Rozenberg

Rights and permissions

Reprints and permissions

Copyright information

© 1986 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Berthelot, G., Lri-Iie (1986). Checking properties of nets using transformations. In: Rozenberg, G. (eds) Advances in Petri Nets 1985. APN 1985. Lecture Notes in Computer Science, vol 222. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0016204

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-39822-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics