Skip to main content
SpringerLink
Log in

Failures semantics and deadlocking of modular Petri nets

  • Published:
Acta Informatica Aims and scope Submit manuscript

Summary

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 is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

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

    Google Scholar 

  2. André, C.: Structural transformations giving B-equivalent PT-nets. In: Pagnoni, A., Rozenberg, G. (eds.) Application and theory of Petri nets, pp. 14–28. Informatik Fachberichte 66, Berlin Heidelberg New York: Springer 1983

    Google Scholar 

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

    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 has appeared as Arbeitspapiere der GMD 254 (1987)

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

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

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

    Google Scholar 

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

  9. Carstensen, H.: Fairneß bei nebenläufigen Systemen. Eine Untersuchung am Modell der Petrinetze, Uni Hamburg, FB Informatik, Bericht FBI-HH-B-126/87 (1987)

  10. 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, pp. 343–366 (1986)

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

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

    Google Scholar 

  13. Milner, R.: Lectures on a calculus for communicating systems. In: Brookes, S.D., Roscoe, A.W., Winskel, G. (eds.) pp. 197–230. Seminar on Concurrency, LNCS 197

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

    Google Scholar 

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

    Google Scholar 

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

  17. Suzuki, I., Murata, T.: A method for stepwise refinement and abstraction of Petri nets. J. Comput. Syst. Sci. 27, 51–76 (1983)

    Google Scholar 

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

  19. Valette, R.: Analysis of Petri nets by stepwise refinements. J. Comput. Syst. Sci. 18, 35–46 (1979)

    Google Scholar 

  20. 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, pp. 82–93

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

Download references

Author information

Authors and Affiliations

  1. Institut für Informatik, Technische Universität München, Arcisstrasse 21, D-8000, München 2, Federal Republic of Germany

    Walter Vogler

Authors
  1. Walter Vogler
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Vogler, W. Failures semantics and deadlocking of modular Petri nets. Acta Informatica 26, 333–348 (1989). https://doi.org/10.1007/BF00276021

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation