The relative strength of K-density

Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 84)


K-density is a property of occurrence nets which can be thought of as mathematical models of processes. We study K-density both formally, as compared with other axioms, and informally, as interpreted and compared with the properties of continuity and computability. We show that, in a certain sense, K-density is an axiom of discreteness.


Complete Lattice Infinite Chain Computing Laboratory Redundant Condition Predicate Transformer 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [BES77]
    Best, E.: A Theorem on the Characteristics of Non-Sequential Processes. TR/116, Computing Laboratory, University of Newcastle upon Tyne, November 1977. Also to appear in Fundamenta Informaticae.Google Scholar
  2. [BES80a]
    Best, E.: Atomicity of Activities. In this volume.Google Scholar
  3. [BES80b]
    Best, E.: Notes on Predicate Transformers and Concurrent Programs. TR/145, Computing Laboratory, University of Newcastle upon Tyne, 1979 (to appear).Google Scholar
  4. [DIJ76]
    Dijkstra, E.W.: A Discipline of Programming. Prentice Hall 1976.Google Scholar
  5. [HEB78]
    Hewitt, C. and Baker, H.: Actors and Continuous Functionals. In: Formal Description of Programming Concepts (ed. E. Neuhold), North Holland 1978.Google Scholar
  6. [HOL68]
    Holt, A.W. et al.: Final Report of the Project on Information Systems Theory. Applied Data Research ADR6606, and USAF — Rome Air Development Centre, RADC-TR-68-305, 1968.Google Scholar
  7. [KNU73]
    Knuth, D.E.: The Art of Computer Programming, Vol.1: Fundamental Algorithms. Addison-Wesley Publishing Company, second edition 1973.Google Scholar
  8. [LEV79]
    Levy, E.: Basic Set Theory. Springer Verlag, Berlin-Heidelberg-New York, 1979.Google Scholar
  9. [NPW79]
    Nielsen, M., Plotkin, G. and Winskel, G.: Petri Nets, Event Structures and Domains. In: Semantics of Concurrent Computation, Lecture Notes in Computer Science 70, Springer Verlag, Berlin 1979.Google Scholar
  10. [ORE62]
    Ore, O.: Theory of Graphs. American Mathematical Society, Colloquium Publications, Vol. XXXVIII, Rhode Island 1962.Google Scholar
  11. [PET77]
    Petri, C.A.: Non-Sequential Processes. GMD-ISF Report ISF-77-05, Bonn, June 1977.Google Scholar
  12. [PET80a]
    Petri, C.A.: Introduction to General Net Theory. In this volume.Google Scholar
  13. [PET80b]
    Petri, C.A.: Concurrency. In this volume.Google Scholar
  14. [SCS71]
    Scott, D. and Strachey, C.: Towards a Mathematical Semantics for Computer Languages. Oxford University Computing Laboratory, August 1971.Google Scholar
  15. [SCO76]
    Scott, D.: Data Types as Lattices. SIAM Computing, Vol. 15, No. 3, September 1976, pp. 522–587.CrossRefGoogle Scholar
  16. [WAN77]
    Wand, M.: A Characterisation of Weakest Preconditions. JCSS 15, 1977, pp. 209–212.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1980

Authors and Affiliations

  • E. Best
    • 1
  1. 1.Computing LaboratoryUniversity of Newcastle upon TyneEngland

Personalised recommendations