Event structures

1. Aczel, P., A note on Scott's theory of domains. Unpublished note, Math. Dept., Univ. of Manchester, (1983).

   Google Scholar 

2. Aczel, P., An introduction to inductive definitions. In the handbook of Mathematical Logic, Ed. Barwise, J., North-Holland (1983).

   Google Scholar 

3. Berry, G., Modèles complètement adéquats et stables des lambda-calculs typés. Thèse de Doctorat d'Etat, Université de Paris VII (1979).

   Google Scholar 

4. Brookes, S.D., On the relationship of CCS and CSP. ICALP 1983, in Springer-Verlag Lecture Notes in Comp. Sc., vol.154 (1984).

   Google Scholar 

5. Genrich, H.J., Lautenbach, K., and Thiagarajan, P.S., Elements of general net theory. In Net Theory and Applications, (Ed. Brauer, W.), Springer-Verlag Lecture Notes in Comp. Sci., vol.84 (1980).

   Google Scholar 

6. Curien, P.L., Categorical combinators, sequential algorithms and functional programming. Research notes in theoretical comp. sc., Pitman, London (1986).

   Google Scholar 

7. Coquand, T., Gunter, C., and Winskel, G., Polymorphism and domain equations. Submitted to Third Workshop on the Mathematical Foundations of Programming Language Semantics, New Orleans, LA 1987.

   Google Scholar 

8. Fogh, T., En semantik for synkroniserede parallelle processer. Master's thesis, Comp. Sc., Aarhus Univ., Denmark (1981).

   Google Scholar 

9. Girard, J.Y., The system F of variable types, fifteen years later. Manuscript, (1985).

   Google Scholar 

10. Goltz, U. and Reisig, W., Processes of Place/Transition Nets. Icalp 83 and appears in Information and Control (1984).

    Google Scholar 

11. Hewitt, C., and Baker, H., Actors and continuous functionals. In “Formal description of programming concepts (ed. E.Neuhold), North Holland (1978).

    Google Scholar 

12. Hoare, C.A.R., Communicating sequential processes. Prentice Hall (1985)

    Google Scholar 

13. 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 

14. Kahn, G., and Plotkin, G., Domaines Concrètes. Rapport IRIA Laboria No. 336 (1978).

    Google Scholar 

15. Lamport, L., Time clocks and the ordering of events in a distributed system. CACM 21, (1978).

    Google Scholar 

16. Larsen, K., and Winskel, G., Using information systems to solve recursive domain equations effectively. In the proceedings of the conference on Abstract Datatypes, Sophia-Antipolis, France in June 1984. Full version submitted to the journal “Information and Control” and appears as a report of the Computer Laboratory, University of Cambridge (1983).

    Google Scholar 

17. 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 

18. Mazurkiewicz, A., Concurrent program schemes and their interpretations. Report PB-78 of the Computer Sc. Dept., University of Aarhus, Denmark (1977).

    Google Scholar 

19. Maclane, S., Categories for the Working Mathematician. Graduate Texts in Mathematics, Springer (1971).

    Google Scholar 

20. Milner, R., Fully abstract models of typed lambda-calculi. Theor. Comp. Sc., vol.4(1), 1–23 (1977).

    Google Scholar 

21. Milner, R., A Calculus of Communicating Systems. Springer Lecture Notes in Comp. Sc. vol. 92 (1980).

    Google Scholar 

22. Milner, R., Calculi for synchrony and asynchrony. Theoretical Computer Science 25, pp.267–310 (1983).

    Google Scholar 

23. Montanari, U., and Simonelli, C., On distinguishing between concurrency and nondeterminism. Proc. Ecole de Printemps on Concurrency and Petri nets, Colleville (1980).

    Google Scholar 

24. Nielsen, M., Plotkin, G., Winskel, G., Petri nets, Event structures and Domains, part 1. Theoretical Computer Science, vol. 13 (1981).

    Google Scholar 

25. Plotkin, G.D., LCF considered as a programming language. Theor. Comp. Sc., vol.5(3), 223–256 (1977).

    Google Scholar 

26. Petri, C.A., Nonsequential processes. GMD-ISF Report ISF-77-05 (1977).

    Google Scholar 

27. Pratt, V. R., On the composition of processes. Proc. of the 9th annual ACM symposium on Principles of Programming Languages, (1982).

    Google Scholar 

28. Scott, D. S., Domains for Denotational Semantics. ICALP '82. Springer-Verlag Lecture Notes in Comp. Sc. 140 (1982).

    Google Scholar 

29. Scott, D. S., Lectures on a mathematical theory of computation. Oxford University Computing Laboratory Technical Monograph PRG-19 (1981).

    Google Scholar 

30. 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 

31. Smyth, M.B., The largest cartesian closed category of domains. Theor. Comp. Sc., vol. 27 pp. 109–119 (1983).

    Google Scholar 

32. Stoy, J. Denotational semantics: The Scott-Strachey approach to programming language theory. MIT Press (1977).

    Google Scholar 

33. Winskel, G., Events in Computation. Ph.D. thesis, available as a technical report, Comp. Sc. Dept., University of Edinburgh (1980).

    Google Scholar 

34. Winskel, G., Event structure semantics of CCS and related languages. Proc. ICALP '82. Springer-Verlag Lecture Notes in Comp. Sc. 140 and as a report of the Computer Sc. Dept., University of Aarhus, Denmark (1982).

    Google Scholar 

35. Winskel, G., A representation of completely distributive algebraic lattices. Report of the Computer Science Dept., Carnegie-Mellon University (1983).

    Google Scholar 

36. Winskel, G., Synchronisation trees. In Theoretical Computer Science, May 1985.

    Google Scholar 

37. Winskel, G., A New Definition of Morphism on Petri Nets. Springer Lecture Notes in Comp Sc, vol. 166 (1984).

    Google Scholar 

38. Winskel, G., Categories of Models for Concurrency. In the proceedings of the workshop on the semantics of concurrency, Carnegie-Mellon University, Pittsburgh, Springer Lecture Notes in Computer Science 197 (July 1984), and appears as a report of the Computer Laboratory, University of Cambridge (1984).

    Google Scholar 

39. Winskel, G., Petri nets, algebras, morphisms and compositionality. Report 79 of the Computer Laboratory, University of Cambridge. To appear in Information and Control. An extended abstract appears in “Advances in Petri Nets”, Springer-Verlag Lecture Notes in Comp. Sc. (1985).

    Google Scholar 

Download references