A lattice theoretic view of K-density
Part of the Lecture Notes in Computer Science book series (LNCS, volume 188)
KeywordsComplete Lattice Strong Density Finite Degree Great Lower Bound Information System Theory
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.
- E. Best, A Theorem on the Characteristics of Non-sequential Processes. Fundamenta Informaticae, Vol. 3, (1980), 77–94.Google Scholar
- E. Best and A. Merceron, Some Properties of Non-sequential Processes. GMD-ISF report 82.07, Schloβ Birlinghoven, 5205 St. Augustin W. Germany (1982).Google Scholar
- C. Fernandez and P.S. Thiagarajan, D-continuous Causal Nets: A Model of Non-sequential Processes. GMD-ISF report 82.05, Schloβ Birlinghoven, 5205 St. Augustin W. Germany (1982). Also to appear in TCS.Google Scholar
- A.W. Holt et al., Information System Theory Project. Final Report, RADC-TR-G8-305, Applied Data Research Inc., Princeton, New Jersey, USA (1968).Google Scholar
- C.A. Petri, Non-sequential Processes, Interner Bericht ISF-77-5, GMD, Schloβ Birlinghoven, 5205 St. Augustin, W. Germany (1977).Google Scholar
- C.A. Petri, Concurrency. Lecture Notes in Computer Science, Ed. W. Brauer, Vol. 84, 251–260, Springer Verlag (1980).Google Scholar
- J. Winkowski, Behaviours of Concurrent Systems, Theoretical Computer Science 12 (1980), 39–60.Google Scholar
- G. Winskel, Events in Computation, Ph.D. Thesis, University of Edinburgh, Edinburgh, Great Britain (1980).Google Scholar
© Springer-Verlag Berlin Heidelberg 1985