The pomset model of parallel processes: Unifying the temporal and the spatial

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


Partial Order Binary Relation Isomorphism Class Dynamic Logic Canonical Representative 
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.

5. Bibliography

  1. [BA81]
    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
  2. [deB72]
    de Bakker, J.W., and W.P. de Roever, A calculus for recursive program schemes, in Automata, Languages and Programming, (ed. Nivat), 167–196, North Holland, 1972.Google Scholar
  3. [Gis84]
    Gischer, J., Partial Orders and the Axiomatic Theory of Shuffle, Ph.D. Thesis, Computer Science Dept., Stanford University, Dec. 1984.Google Scholar
  4. [Kah74]
    Kahn, G., The Semantics of a Simple Language for Parallel Programming, IFIP 74, North-Holland, Amsterdam, 1974.Google Scholar
  5. [KaM77]
    Kahn, G. and D.B. MacQueen, Coroutines and Networks of Parallel Processes, IFIP 77, 993–998, North-Holland, Amsterdam, 1977.Google Scholar
  6. [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
  7. [W84]
    Winskel, G., Categories of Models for Concurrency, this volume.Google Scholar

Copyright information

© Springer-Verlag 1985

Authors and Affiliations

  • Vaughan Pratt
    • 1
  1. 1.Stanford UniversityStanford

Personalised recommendations