Skip to main content
SpringerLink
Log in

Making nets abstract and structured

  • 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

Nets considered here are "abstract" since their places are seen as individual variables, transitions as function names and a firing rule as a predicate stating when a partial function, denoted by a given transition, is defined. Three selected rules expressing the local character of transition's activity are admitted as axioms for interpretation. The nets are "structured" because they can be built up of simpler nets by a concurrency constructor (11) with handshaking. From axioms we infer a necessary and sufficient condition for a net to be decomposable with respect to a given partition of places. In particular, we examine decomposition into atomic, not further decomposable nets. A number of examples illustrate the considerations.

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. W.Brauer (ed.): Net Theory and Applications, LNCS 84 (1980)

    Google Scholar 

  2. L.Czaja: Nets and Their Relation to CSP, Technical Monograph PRG-38, Oxford University Computing Lab. June 1984

    Google Scholar 

  3. H. Genrich, K. Lautenbach: System Modelling with High Level Petri Nets, Theoretical Computer Sci. 13(1981) pp.109–136

    Article  Google Scholar 

  4. C.A.R.Hoare: A Model for Communicating Sequential Processes, Technical Monograph PRG-22, Oxford University Computing Lab. June 1981

    Google Scholar 

  5. K. Jensen: Coloured Petri Nets and Invariant Method, Theoretical Computer Sci. 14(1981), pp.317–336

    Article  Google Scholar 

  6. A.Mazurkiewicz: Semantics of Concurrent Systems: A Modular Fixed Point Trace Approach, Institute of Applied Mathematics and Computer Science, University of Leiden, The Netherlands, Internal Report, 1984

    Google Scholar 

  7. W.Reisig: Petri Nets, An Introduction, EATCS Monograph Series, Springer Verlag, 1985

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Informatics, University of Warsaw, PKiN VIIIp. 00-901, Warsaw, Poland

    Ludwik Czaja

Authors
  1. Ludwik Czaja
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

G. Rozenberg

Rights and permissions

Reprints and permissions

Copyright information

© 1986 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Czaja, L. (1986). Making nets abstract and structured. 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/BFb0016212

Download citation

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

  • 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

Search

Navigation