Event Structures with Symmetry

Electronic Notes in Theoretical Computer Science

Volumn 172, Issue , 2007, Pages 611-652

  Winskel, Glynn ^a  

^a UNIVERSITY OF CAMBRIDGE   (United Kingdom)

Author keywords

Event structures; higher order processes; nondeterministic dataflow; Petri net unfolding; pseudo monads; spans; symmetry

Indexed keywords

COMPUTER SCIENCE; DATA FLOW ANALYSIS; PETRI NETS; SEMANTICS;

EVENT STRUCTURES; HIGHER ORDER PROCESSES; NONDETERMINISTIC DATAFLOW; PETRI NET UNFOLDING; PSEUDO MONADS;

DATA STRUCTURES;

EID: 33847689441     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.entcs.2007.02.022     Document Type: Article

References (25)

1. Abramsky S., Jagadeesan R., and Malacaria P. Full Abstraction for PCF. Information and Computation 163 (2000) 409-470
2. Berry, G., Modèles completement adéquats et stables des λ-calculs typés. Thèse de Doctorat d'Etat, Université de Paris VII, 1979
3. Burroni, A., T-catégories. Cahiers de topologie et géométrie différentielle, XII 3, 1971
4. Cattani, G.L., and Winskel, G., Profunctors, open maps and bisimulation. MSCS, 2005
5. Cheng E., Hyland J.M.E., and Power A.J. Pseudo-distributive laws. ENTCS 83 (2004)
6. Crazzolara, F., and Winskel, G., Composing Strand Spaces. FSTTCS'02, 2002
7. Doghmi, S.F., Guttman, J.D., and Thayer, F.J., Searching for shapes in cryptographic protocols. TACAS'07, 2007
8. Hayman, J., and Winskel, G., The unfolding of general Petri nets. Forthcoming
9. Johnstone P. Sketches of an elephant, a topos theory compendium, vol. 1 (2002), OUP
10. Joyal A., Nielsen M., and Winskel G. Bisimulation from open maps. LICS '93 special issue of. Information and Computation 127 2 (1996) 164-185 Available as BRICS report, RS-94-7
11. Kahn G., and Plotkin G.D. Concrete domains. TCS 121 1& 2 (1993) 187-277
12. Koslowski J. A monadic approach to polycategories. Theory and Applications of Categories 14 7 (2005) 125-156
13. Nielsen M., Plotkin G.D., and Winskel G. Petri nets, event structures and domains. TCS 13 1 (1981) 85-108
14. Nygaard, M., Domain theory for concurrency. PhD Thesis, University of Aarhus, 2003
15. Nygaard M., and Winskel G. Domain theory for concurrency. TCS 316 (2004) 153-190
16. Power A.J. 2-Categories. BRICS Lecture Notes (March 1998), Aarhus University
17. Saunders-Evans L., and Winskel G. Event structure spans for non-deterministic dataflow. Proc. Express'06. ENTCS (2006)
18. Saunders-Evans, L., Events with persistence. Forthcoming PhD, University of Cambridge Computer Laboratory
19. Winskel G., and Nielsen M. Models for Concurrency. Handbook of Logic and the Foundations of Computer Science vol. 4 (1995), OUP 1-148
20. Winskel, G., Events in Computation. PhD thesis, Univ. of Edinburgh, available from http://www.cl.cam.ac.uk/users/gw104, 1980
21. Winskel G. Event structure semantics of CCS and related languages. ICALP 82. Springer-Verlag LNCS 140 (1982). http://www.cl.cam.ac.uk/users/gw104 Extended version available from
22. Winskel, G., A new definition of morphism on Petri Nets. STACS'84: 140-150, 1984
23. Winskel G. Event structures. Invited lectures for the Advanced Course on Petri nets, September 1986. Springer LNCS vol. 255 (1987)
24. Winskel G. An introduction to event structures. REX summerschool in temporal logic. Springer LNCS vol. 354 (1988)
25. Winskel, G., Relations in concurrency. Invited talk, LICS'05, 2005