Logic of Programs 1985: Logics of Programs pp 269-283 | Cite as

Some constructions for order-theoretic models of concurrency

  • Vaughan Pratt
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 193)


We give "tight" and "loose" constructions suitable for specifying processes represented as sets of pomsets (partially ordered multisets). The tight construction is suitable for specifying "primitive" processes; it introduces the dual notions of concurrence and orthocurrence. The loose construction specifies a process in terms of a net of communicating subprocesses; it introduces the notion of a utilization embedding a process in a net.


Partial Order Natural Transformation Concurrent System Predicate Transformer Dual Notion 
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. [B]
    Brauer, W., Net Theory and Applications, Springer-Verlag LNCS 84, 1980.Google Scholar
  2. [BA]
    Brock, J.D. and W.B. Ackerman, Scenarios: A Model of Non-Determinate Computation. In LNCS 107: Formalization of Programming Concepts, J. Diaz and I. Ramos, Eds., Springer-Verlag, New York, 1981, 252–259.Google Scholar
  3. [DH]
    Denvir, T., W. Harwood, M. Jackson, and M. Ray, The Analysis of Concurrent Systems, Proceedings of a Tutorial and Workshop, Cambridge University, Sept. 1983, LNCS, Springer-Verlag, to appear.Google Scholar
  4. [Gis]
    Gischer, J., Partial Orders and the Axiomatic Theory of Shuffle, Ph.D. Thesis, Computer Science Dept., Stanford University, Dec. 1984.Google Scholar
  5. [H]
    Hoare, C.A.R., Communicating Sequential Processes, CACM, 21, 8, 666–672, August, 1978Google Scholar
  6. [K]
    Kahn, G., The Semantics of a Simple Language for Parallel Programming, IFIP 74, North-Holland, Amsterdam, 1974.Google Scholar
  7. [KM]
    Kahn, G. and D.B. MacQueen, Coroutines and Networks of Parallel Processes, IFIP 77, 993–998, North-Holland, Amsterdam, 1977.Google Scholar
  8. [ML]
    Mac Lane, S., Categories for the Working Mathematician, Springer-Verlag, NY, 1971.Google Scholar
  9. [M]
    Milner, R., A Calculus of Communicating Behavior, Springer-Verlag LNCS 92, 1980.Google Scholar
  10. [Pn]
    Pnueli, A., The Temporal Logic of Programs, 18th IEEE Symposium on Foundations of Computer Science, 46–57. Oct. 1977.Google Scholar
  11. [Pr82]
    Pratt, V.R., On the Composition of Processes, Proceedings of the Ninth Annual ACM Symposium on Principles of Programming Languages, Jan. 1982.Google Scholar
  12. [Pr83]
    Pratt, V.R., Two-Way Channel with Disconnect, in [DH], section 3.1.3.Google Scholar
  13. [Pr84]
    Pratt, V.R., The Pomset Model of Parallel Processes: Unifying the Temporal and the Spatial, Proc. CMU/SERC Workshop on Logics of Programs, to appear in Springer Lecture Notes in Computer Science series, Pittsburgh, 1984.Google Scholar
  14. [W84a]
    Winskel, G., A New Definition of Morphism on Petri Nets, Springer Lecture Notes in Computer Science, 166, 1984.Google Scholar
  15. [W84b]
    Winskel, G., Categories of Models for Concurrency, Technical Report no. 58, University of Cambridge, England, undated (rec'd Dec. 1984).Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1985

Authors and Affiliations

  • Vaughan Pratt
    • 1
  1. 1.Stanford UniversityStanford

Personalised recommendations