Skip to main content

K-density, N-density, and finiteness properties

  • Conference paper
  • First Online:
Advances in Petri Nets 1984

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

Abstract

Modelling non-sequential processes by partially ordered sets (posets) leads to the concept of K-density which says that every cut and every line have (exactly) one point in common. The “simplest” example of non-K-density is given by a four-element poset the underlying graph of wich is “N-shaped”; a poset is called N-dense iff every (four-element) N-shaped subposet can be extended to an K-dense subposet by addition of one point. K-density implies N-density; for finite non-empty posets also the converse implication is true. It turns out that much weaker properties are sufficient; especially, it will be proved that an N-dense non-empty poset is K-dense if all cuts are finite.

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.

Similar content being viewed by others

8 References

  1. Best, E.: The Relative Strength of K-Density. In: Lecture Notes in Computer Science Bd. 84: Net Theory and Applications, pp. 261–276. — Berlin: Springer-Verlag (1980)

    Google Scholar 

  2. Goltz, U.; Reisig, W.: The Non-sequential Behaviour of Petri Nets. In: Information and Control 57 (1983), pp. 125–147

    Article  Google Scholar 

  3. Petri, C. A.: Nicht-sequentielle Prozesse. In: Universität Erlangen-Nürnberg, Arbeitsberichte des IIMD, Bd. 9, Nr. 8, S. 57–82 (1976)

    Google Scholar 

  4. Petri, C. A.: Concurrency. In: Lecture Notes in Computer Science Bd. 84: Net Theory and Applications, pp. 251–260. — Berlin: Springer-Verlag (1980)

    Google Scholar 

  5. Plünnecke, H.: Schnitte in Halbordnungen. — St. Augustin: Gesellschaft für Mathematik und Datenverarbeitung Bonn, ISF-Report 81.09 (1981)

    Google Scholar 

  6. Winskel, G.: Events in Computation. — University of Edinburgh, Thesis (December, 1980)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

G. Rozenberg

Rights and permissions

Reprints and permissions

Copyright information

© 1985 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Plünnecke, H. (1985). K-density, N-density, and finiteness properties. In: Rozenberg, G. (eds) Advances in Petri Nets 1984. Lecture Notes in Computer Science, vol 188. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-15204-0_22

Download citation

  • DOI: https://doi.org/10.1007/3-540-15204-0_22

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-15204-0

  • Online ISBN: 978-3-540-39320-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics