Advertisement

Categories of models for concurrency

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

Keywords

Event Structure Partial Function Parallel Composition Springer Lecture Note Communicate Sequential Process 
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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [Ab]
    Abramsky, S., Domain theory as a theory of experiments. In this proceedings (1984).Google Scholar
  2. [Ab1]
    Abramsky, S., Ph. D. thesis, University of London. In preparation.Google Scholar
  3. [Ac]
    Aczel, P., An introduction to inductive definitions. In the handbook of Mathematical Logic, Ed. Barwise, J., North-Holland (1983).Google Scholar
  4. [AM]
    Arbib, M.A.,and Manes,E.G., Arrows, Structures and Functors, The categorical imperative. Academic Press (1975).Google Scholar
  5. [B]
    Brooks, S.D., On the relationship of CCS and CSP, ICALP 1983.Google Scholar
  6. [Br]
    Brauer, W.(Ed.), Net Theory and Applications, Springer-Verlag Lecture Notes in Comp. Sci., vol.84 (1980).Google Scholar
  7. [CH]
    Campbell, R. H., and Habermann, A. N.,, The Specification of Process Synchronisation by Path Expressions. Springer-Verlag Lecture Notes in Comp. Sc. Vol.16 (1974).Google Scholar
  8. [GR]
    Goltz, U. and Reisig, W., Processes of Place/Transition Nets. Icalp 83 and to appear in Information and Control.Google Scholar
  9. [GM]
    Goltz, U. and Mycroft, A., On the relationship of CCS and Petri nets. ICALP 84 Springer-Verlag Lecture Notes in Comp. Sc. Vol.172 (1984).Google Scholar
  10. [H]
    Hoare, C.A.R., Communicating sequential processes. Comm. ACM 21 (1978).Google Scholar
  11. [HBR]
    Hoare, C.A.R., Brookes,S.D., and Roscoe, A.W., A Theory of Communicating Processes, Technical Report PRG-16, Programming Research Group, University of Oxford (1981); in JACM (1984).Google Scholar
  12. [Le]
    Lehmann, D., Categories for fixed-point semantics. FOCS 17 (1976).Google Scholar
  13. [LC]
    Lauer, P. E. and Campbell, R. H., Formal semantics for a class of high-level primitives for coordinating concurrent processes. Acta Informatica 5 pp.297–332 (1974).Google Scholar
  14. [LP]
    Labella, A., and Peterossi, A., Towards a Categorical Understanding of Parallelism. Report of Istituto di Analisi dei Sistemi ed Informatica del C.N.R., Rome (1983).Google Scholar
  15. [LW]
    Larsen, K. and Winskel, G., Using Information Systems to solve Recursive Domain Equations Effectively. Springer Lecture Notes in Comp. Sc., vol. 173 (1984).Google Scholar
  16. [Mac]
    Maclane, S., Categories for the Working Mathematician. Graduate Texts in Mathematics,Springer (1971).Google Scholar
  17. [M1]
    Milner, R., A Calculus of Communicating Systems. Springer Lecture Notes in Comp. Sc. vol. 92 (1980).Google Scholar
  18. [M2]
    Milner, R., Calculi for synchrony and asynchrony, Theoretical Computer Science, pp.267–310 (1983).Google Scholar
  19. [Mi]
    Milne, G., CIRCAL and the representation of communication, concurrency and time. Report of Comp Sc Dept, University of Edinburgh (1983).Google Scholar
  20. [NPW]
    Nielsen, M., Plotkin, G., Winskel, G., Petri nets, Event structures and Domains, part 1. Theoretical Computer Science, vol. 13 (1981).Google Scholar
  21. [Pr]
    Pratt, V. R., On the composition of processes. ACM, Stanford University (1982), and see the paper in this proceedings.Google Scholar
  22. [Pe]
    Peterson, J. L., Petri Net Theory and the Modelling of Systems. Prentice-Hall (1981).Google Scholar
  23. [R]
    Reisig, W., Petri nets. Springer Lecture Notes in Comp. Sc., to appear.Google Scholar
  24. [S]
    Scott, D., Domains for Denotational Semantics, Springer-Verlag Lecture Notes in Comp. Sc. 140 (1982).Google Scholar
  25. [Sh1,2]
    Shields, M., Non-sequential behaviours: 1 and 2. Reports of the Comp. Sc. Dept., University of Edinburgh (part 1: 1982, part 2: 1983).Google Scholar
  26. [Stu]
    Student projects for the course “Models for Concurrency”, Computer Science Dept., University of Aarhus, Denmark (1980).Google Scholar
  27. [Sm]
    Smyth, M.B., Power domains and predicate transformers: a topological view. Proc. of ICALP 83, Springer Lecture Notes in Comp. Sc. vol. 154 (1983).Google Scholar
  28. [W]
    Winskel, G., Events in Computation. Ph.D. thesis, University of Edinburgh (1980).Google Scholar
  29. [W1]
    Winskel, G., Event structure semantics of CCS and related languages, Springer-Verlag Lecture Notes in Comp. Sc. 140 and as a report of the Computer Sc. Dept., University of Aarhus, Denmark (1982).Google Scholar
  30. [W2]
    Winskel, G., Synchronisation trees. Technical Report, Comp. Sc. Dept., Carnegie-Mellon University (1983).To appear in Theoretical Computer Science.Google Scholar
  31. [W3]
    Winskel, G., A New Definition of Morphism on Petri Nets. Springer Lecture Notes in Comp Sc, vol. 166 and also as a report of the Computer Laboratory, University of Cambridge (1984).Google Scholar
  32. [W4]
    Winskel, G., A note on powerdomains and modality. Springer Lecture Notes in Comp Sc, vol. 158 (1984).Google Scholar
  33. [W5]
    Winskel, G., A complete proof system for SCCS with modal assertions. In preparation.Google Scholar

Copyright information

© Springer-Verlag 1985

Authors and Affiliations

  • Glynn Winskel
    • 1
  1. 1.Computer LaboratoryUniversity of CambridgeCambridge

Personalised recommendations