Skip to main content
SpringerLink
Log in

Failures semantics and deadlocking of modular petri nets

Extended Abstract

  • Communications
  • Conference paper
  • First Online:
Mathematical Foundations of Computer Science 1988 (MFCS 1988)

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

Abstract

One can construct labelled P/T-nets in a modular fashion by exchanging subnets such that the behaviour of the whole net remains the same. We investigate which subnets can be exchanged such that deadlock-freeness is preserved and show that some variations of the failures semantics, which has been developed for TCSP, are useful in this context.

This work was partially supported by ESPRIT-project No.283

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. André, C.: Use of the behaviour equivalence in place-transition net analysis. In: Girault/Reisig (eds.): Application and theory of Petri nets. Informatik Fachberichte 52, Springer 1982, p. 241–250

    Google Scholar 

  2. André, C.: Structural transformations giving B-equivalent PT-nets. In: Pagnoni/Rozenberg (eds.): Application and theory of Petri nets. Informatik Fachberichte 66, Springer 1983, p. 14–28

    Google Scholar 

  3. André, C.: The behaviour of a Petri net on a subset of transitions. RAIRO Autom. 17, 1983, p. 5–21

    Google Scholar 

  4. Baumgarten, B.: On internal and external characterizations of PT-net building block behaviour. Proc. 7th European workshop on application and theory of Petri nets, Oxford, 1986. A revised version is to appear in: G. Rozenberg (ed.): Advances in Petri Nets, and has appeared as Arbeitspapiere der GMD 254, 1987.

    Google Scholar 

  5. Berthelot, G.: Transformations of Petri nets. Proc. 5th European workshop on appl. and theory of Petri nets, Aarhus, 1984, p. 310–328

    Google Scholar 

  6. Best, E., Fernández, C.: Notations and terminology on Petri net theory, Arbeitspapiere GMD 195, 1986

    Google Scholar 

  7. Brookes, S.D., Hoare, C.A.R., Roscoe, A.W.: A theory of communicating sequential processes, JACM 31 (1984), p. 560–599

    Google Scholar 

  8. Brookes, S.D., Roscoe, A.W.: An improved failures model for communicating processes. In: S.D.Brookes, A.W.Roscoe, G. Winskel (eds.): Seminar on Concurrency (1984) LNCS 197, p. 281–305

    Google Scholar 

  9. De Cindio, F., De Michelis, G., Simone, C.: GAMERU: A language for the analysis and design of human communication pragmatics within organizational systems. In: Proc. 7th European workshop on application and theory of Petri nets, 1986, p. 343–366

    Google Scholar 

  10. Goltz, U.: An exercise in building structured nets. In: Proc. 7th European workshop on application and theory of Petri nets, 1986, p. 73–99

    Google Scholar 

  11. Hack, M.: The equality problem for vector addition systems is undecidable. TCS 2 (1976), p. 77–95

    Google Scholar 

  12. Milner, R.: Lectures on a calculus for communicating systems. In: S.D.Brookes, A.W.Roscoe, G. Winskel: Seminar on Concurrency, LNCS 197, p. 197–230

    Google Scholar 

  13. Müller, K.: Constructable Petri nets. EIK 21 (1985), p. 171–199

    Google Scholar 

  14. Olderog, E.R., Hoare, C.A.R.: Specification-oriented semantics for communicating processes, Acta Informatica 23 (1986), p. 9–66

    Google Scholar 

  15. Pomello, L.: Some equivalence notions for concurrent systems — an overview. Arbeitspapiere der GMD Nr. 103, 1984

    Google Scholar 

  16. Suzuki, I., Murata, T.: A method for stepwise refinement and abstraction of Petri nets. J. Comp. Syst. Sciences 27, 1983, p. 51–76

    Google Scholar 

  17. Taubner, D.: Two net-oriented semantics for TCSP. Univ. Hamburg, Bericht FBI-HH-B-116/85, 1985

    Google Scholar 

  18. Valette, R.: Analysis of Petri nets by stepwise refinements. J. Comp. Syst. Sciences 18, 1979, p. 35–46

    Google Scholar 

  19. Vogler, W.: Behaviour preserving refinements of Petri nets. Proc. 12th Int. workshop on graph theoretic concepts in computer science, Bernried/München, 1986, LNCS 246, p. 82–93

    Google Scholar 

  20. Vogler, W.: Behaviour and life preserving refinements of Petri nets (submitted)

    Google Scholar 

  21. Voss, K.: System specification with labelled nets and the notion of interface equivalence. Arbeitspapiere der GMD Nr. 211, 1986

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. TU München, Germany

    Walter Vogler

Authors
  1. Walter Vogler
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Michal P. Chytil Václav Koubek Ladislav Janiga

Rights and permissions

Reprints and permissions

Copyright information

© 1988 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Vogler, W. (1988). Failures semantics and deadlocking of modular petri nets. In: Chytil, M.P., Koubek, V., Janiga, L. (eds) Mathematical Foundations of Computer Science 1988. MFCS 1988. Lecture Notes in Computer Science, vol 324. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0017178

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation