Events, causality and symmetry

Computer Journal

Volumn 54, Issue 1, 2011, Pages 42-57

  Winskel, Glynn ^a  

^a UNIVERSITY OF CAMBRIDGE   (United Kingdom)

Author keywords

concurrency; domain theory; events structures; Petri nets; profunctors; spans; symmetry; unfolding

Indexed keywords

CONCURRENCY; DOMAIN THEORY; EVENTS STRUCTURES; PROFUNCTORS; SPANS; SYMMETRY; UNFOLDING;

GRAPH THEORY; PETRI NETS;

MODEL CHECKING;

EID: 78650888702     PISSN: 00104620     EISSN: 14602067     Source Type: Journal    
DOI: 10.1093/comjnl/bxp052     Document Type: Article

References (109)

1. Cervesato, I., Durgin, N.A, Lincoln, P.D., Mitchell, J.C. and Scedrov, A. (2000) Relating Strands and Multiset Rewriting for Security Protocol Analysis. Proc. 13th IEEE Computer Security Foundations Workshop, Cambridge, UK.
2. Crazzolara, F. and Winskel, G. (2001) Events in Security Protocols. Proc. ACM Conf. Computer and Communications Security, Philadelphia, USA.
3. Thayer, J., Herzog, J. and Guttman, J. (1998) Strand Spaces: Why is a Security Protocol Correct? IEEE Symp. Security and Privacy, Oakland, California, USA.
4. Danos,V., Feret, J., Fontana,W. and Krivine, J. (2007) Scalable Simulation of Cellular Signaling Networks. Proc. APLAS'07, Singapore. Lecture Notes in Computer Science, Vol. 4807. Springer, Berlin.
5. Sorkin, R. (2006) Geometry from order: causal sets.http://www.einstein- online.info/en/spotlights/causal-sets/.
6. Khomenko, V., Koutny, M. and Yakovlev, A. (2006) Logic synthesis for asynchronous circuits based on STG unfolding and incremental SAT. Fund. Inform. 70, 49-73.
7. Abramsky, S. (2007) Event Domains, Stable Functions and Proof Nets. In Cardelli, L., Fiore, M. and Winskel, G. (eds.), Computation, Meaning and Logic: Articles Dedicated to Gordon Plotkin, Electronic Notes in Theoretical Computer Sciences, Vol. 172, pp. 33-67, Elsevier.
8. Curien, P.-L. and Faggian, C. (2005) L-Nets, Strategies and Proof-Nets. Proc. CSL'05, Oxford, UK. Lecture Notes in Computer Science, Vol. 3634. Springer, Berlin.
9. Girard, J.-Y. (1987) Linear logic. Theoret. Comput. Sci., 50, 1-102.
10. Hildebrandt, T., Panangaden, P. and Winskel, G. (2004) A relational model of non-deterministic dataflow. Math. Strut. Comput. Sci., 14, 613-649.
11. Aghasaryan, A., Fabre, E., Benveniste, A., Boubour, R. and Jard, C. (1998) Fault detection and diagnosis in distributed systems: an approach by partially stochastic Petri Nets. Discrete Event Dyn. Syst., Theory Appl., 8.
12. Hayman, J. and Winskel, G. (2006) Independence and Concurrent Separation. Proc. LICS'06, San Francisco, USA.
13. McMillan, K.L. (1995)Atechnique of state space search based on unfolding. Formal Methods Syst. Des., 6, 45-65.
14. Esparza, J. and Heljanko, K. (2008) Unfoldings: A Partial- Order Approach to Model Checking. Monographs in Theoretical Computer Science. An EATCS Series.
15. Lamport, L. (1978) Time, clocks and the ordering of events in a distributed system. Commun. ACM, 21, 558-565.
16. Nielsen, M., Krukow, K. and Sassone, V. (2007) A Bayesian Model for Event-Based Trust. In Cardelli, L., Fiore, M. and Winskel, G. (eds), Computation, Meaning and Logic: Articles Dedicated to Gordon Plotkin, Electronic Notes in Theoretical Computer Sciences, Vol. 172, pp. 499-521, Elsevier.
17. Nielsen, M., Plotkin, G.D. andWinskel, G. (1981) Petri nets, event structures and domains. Theoret. Comput. Sci., 13, 85-108.
18. Winskel, G. and Nielsen, M. (1995) Models for concurrency. Handb. Log. Found. Comput. Sci. 4, 1-148.
19. Bednarczyk, M.A. (1988) Categories of asynchronous systems. PhD Thesis, in Computer Science, Report no. 1/88, University of Sussex, UK.
20. Shields, M.W. (1985) Concurrent machines. Comput. J. 28, 449-465.
21. Plotkin, G.D. (1981) A Structural Approach to Operational Semantics. Technical Report DAIMI FN-19, Aarhus University.
22. Fiore, M., Gambino, N., Hyland, J.M.E. and Winskel, G. (2007) The cartesian closed bicategory of generalised species of structures. J. London Math. Soc., 77, 203-220.
23. Cattani, G.L. andWinskel, G. (2005) Profunctors, open maps and bisimulation. Math. Struct. Comput. Sci. 15, 553-614.
24. Nygaard, M. and Winskel, G. (2004) Domain theory for concurrency. Theoret. Comput. Sci. 316, 153-190.
25. Nygaard, M. (2003) Domain theory for concurrency. PhD Thesis, University of Aarhus.
26. Saunders-Evans, L. and Winskel, G. (2006) Event Structure Spans for Non-deterministic Dataflow. Proc. Express'06, Bonn, Germany. Electronic Notes in Theoretical Computer Sciences, Vol. 175(3).
27. Stoy, J. (1981) Denotational Semantics: The Scott-Strachey Approach to Programming Language Theory. MIT Press.
28. Petri, C.A. (1962) Kommunikation mit Automaten. PhD Thesis, University of Bonn.
29. Scott, D.S. (1976) Data types as lattices. SIAM J Comput., 5, 522-587.
30. Berry, G. (1979) Modèles completement adéquats et stables des ?-calculs typés. Thèse de Doctorat d'Etat, Université de Paris VII.
31. Winskel, G. (1982) Event Structure Semantics of CCS and Related Languages. Proc. ICALP 82, Lecture Notes in Computer Science, Vol. 140. Springer, Berlin. Extended 1983 Version Available from .
32. Winskel, G. (1987) Event Structures. Invited Lectures for the Advanced Course on Petri nets, September 1986, Lecture Notes in Computer Science, Vol. 255. Springer, Berlin.
33. Coquand,T., Gunter, C.A. andWinskel, G. (1987) DI-Domains as a Model of Polymorphism. Proc. MFPS'97, Lecture Notes in Computer Science, Vol. 298. Springer, Berlin.
34. Plotkin, G.D. (1976) A powerdomain construction. SIAM J. Comput. 5, 452-487.
35. Winskel, G. (1983) A Note on Powerdomains and Modalitiy. Proc. FCT, Lecture Notes in Computer Science, Vol. 158. Springer, Berlin.
36. Mislove, M.W. (2006) On combining probability and nondeterminism. Electron. Notes Theor. Comput. Sci., 162, 261-265.
37. Varacca, D. (2003) Two denotational models for probabilistic computation. PhD, Thesis University of Aarhus.
38. Varacca, D. and Winskel, G. (2006) Distributing probability over nondeterminism. Math. Struct. Comput. Sci., 16, 87-113.
39. Kahn, G. (1974) The semantics of a simple language for parallel programming. Inform. Process. 74, 471-475.
40. Lehmann D.J. (1976) Categories for Fixed-Point Semantics. Report No. 15,Warwick University Theory of Computation.
41. Benson, D.B. (1984) Counting paths: nondeterminism as linear algebra. IEEE Trans. Softw. Eng. 10, 785-794.
42. Girard, J.-Y. (1988) Normal functors, power series and lambda calculus. Ann. Pure Appl. Logic, 37, 129-177.
43. Winskel, G. (1984) A New Definition of Morphism on Petri Nets. Proc. STACS'84, Paris, France. Lecture Notes in Computer Science, Vol. 166. Springer, Berlin.
44. Fabre, E. (2007) Bayesian networks of dynamic systems. Habilitation Thesis, IRISA Rennes.
45. Hoare, C.A.R. (1985) Communicating Sequential Processes. Prentice-Hall.
46. Milner, R. (1989) Communication and Concurrency. Prentice-Hall.
47. Cattani, G.L., Stark, I. and Winskel, G. (1997) Presheaf Models for pi-Calculus. Proc. CTCS'97, Ligure, Italy. Lecture Notes in Computer Science, Vol. 1290. Springer, Berlin.
48. Winskel, G. (2004) Linearity and Nonlinearity in Distributed Computation. Linear Logic in Computer Science, CUP.
49. Bunge, M. and Fiore, M.P. (2000) Unique factorisation lifting functors and categories of linearly-controlled processes. Math. Struct. Comput. Sci. 10, 137-163.
50. Fiore, M.P, Cattani, G.L. and Winskel, G. (1999) Weak Bisimulation and Open Maps. Proc. LICS'99.
51. Winskel, G. (2005) Relations in Concurrency. Invited Talk. Proc. LICS'05, Chicago, USA.
52. Abbott, M., Altenkirch, T. and Ghani, N. (2003) Categories of Containers. Proc. FOSSACS'03, Warsaw, Poland. Lecture Notes in Computer Science, Vol. 2620. Springer, Berlin.
53. Joyal,A. (1981) Une théorie combinatoire des séries formelles.Adv. Math., 42, 1-82.
54. Curien, P.-L. (2006) Operads, Clones, and Distributive Laws. Notes for an Invited Talk at Operads 2006, Strasbourg. Available from .
55. Brock, J. and Ackerman, W. (1981) Scenarios: A Model of Non-determinate Computation. Proc. Int. Colloquium on Formalization of Programming Concepts, Peniscola, Spain. Lecture Notes in Computer Science,Vol. 107. Springer, Berlin.
56. Saunders-Evans (=Brace-Evans), L. (2007) Events with persistence. PhD Thesis, University of Cambridge Computer Laboratory.
57. Abbes, S. (2006) A cartesian closed category of event structures with quotients. Discrete Math. Theor. Comput. Sci. 8, 249-272.
58. van Glabbeek, R.J. (2005) On the Expressiveness of Higher Dimensional Automata. Proc. EXPRESS 2004, London, UK. Electronic Notes in Theoretical Computer Sciences, Vol. 128.
59. Milner, R. (1999) Communicating and Mobile Systems: the pi-Calculus. Cambridge University Press.
60. Crafa, S., Varacca, D. andYoshida, N. (2007) Event Structure Semantics for the Internal pi-Calculus. Proc. CONCUR'07, Lisbon, Portugal. Lecture Notes in Computer Science, Vol. 4703. Springer, Berlin.
61. Moggi, E. (1989) Computational Lambda-Calculus and Monads. Proc. LICS'89, Pacific Grove, CA, USA.
62. Winskel, G. (2007) Event Structures with Symmetry. In Cardelli, L., Fiore, M. and Winskel, G. (eds.), Computation, Meaning and Logic: Articles dedicated to Gordon Plotkin, Electronic Notes in Theoretical Computer Sciences, Vol. 172. See .
63. Winskel, G. (2007) Symmetry and Concurrency. Proc. CALCO'07, Bergen, Norway. Lecture Notes in Computer Science, Vol. 4624. Springer, Berlin.
64. Joyal, A., Nielsen, M. and Winskel, G. (1996) Bisimulation from open maps. Inf. Comput., 127, 164-185 (LICS'93 Special Issue).
65. Bednarczyk, M.A. (1991) Hereditary History Preserving Bisimulations or What is the Power of the Future Perfect in Program Logics. ICS PAS Report. Available from http://www.ipipan.gda.pl/~marek/papers.html.
66. Carboni, A. and Vitale, E.M. (1998) Regular and exact completions. J. Pure Appl. Algebra, 125, 79-116.
67. Burroni, A. (1971) T-catégories. Cahiers de topologie et géométrie différentielle, XII 3.
68. Hayman, J. andWinskel, G. (2008) The Unfolding of General Petri Nets. Electronic Proc. FSTTCS 2008, Bangalore, India. .
69. Sassone, V. (1998) An axiomatization of the category of Petri nets computations. Math. Struct. Comput. Sci., 8, 117-151.
70. Winskel, G. (1999) Event Structures as Presheaves-Two Representation Theorems. Proc. CONCUR 1999, Eindhoven, Netherland. Lecture Notes in Computer Science, Vol. 1664. Springer, Berlin.
71. Pitts, A.M. (2003) Nominal Logic, A first order theory of names and binding. Inf. Comput. 186 (TACS2001 Special issue), 165-193.
72. Lynch, N. (1996) Distributed Algorithms. Morgan Kaufmann Publishers, San Mateo, CA.
73. Moore, S., and Greenfield, D. (2008) The Next ResourceWar: Computation vs. Communication. Proc. 10th Int. Workshop on System-Level Interconnect Prediction.
74. Gordon, A. and Jeffrey, A. (2002) Typing One-to-One and One-to-Many Correspondences in Security Protocols. Proc. ISSS 2002, Tokyo, Japan. Lecture Notes in Computer Science, Vol. 2609. Springer, Berlin.
75. Varacca, D., Voelzer, H. andWinskel, G. (2006) Probabilistic event structures and domains. Theoret. Comput. Sci., 358, 173-199.
76. Abbes, S. and Benveniste, A. (2006) Probabilistic models for true-concurrency: branching cells and distributed probabilities for event structures. Inf. Comput. 204, 231-274.
77. Heiner, M., Gilbert, D. and Donaldson, R. (2008) Petri nets for Systems and Synthetic Biology, Lecture Notes in Computer Science, Vol. 5016. Springer, Berlin.
78. Glabbeek, R.J. van (2005) The Individual and Collective Token Interpretations of Petri Nets. Proc. CONCUR 2005, San Francisco, USA. Lecture Notes in Computer Science, Vol. 3653. Springer, Berlin.
79. Ghica , D.R. and McCusker, G. (2000) Reasoning About Idealized Algol using Regular Languages. Proc. ICALP 2000, Geneva. Lecture Notes in Computer Science, Vol. 1853. Springer, Berlin.
80. Emerson, E.A. and Sistla, A.P. (1994) Symmetry and model checking. Formal Methods Syst. Des.
81. Intel Corp., Pentium Processor User's Manual, Vol. 1.
82. Sarkar, S., Sewell, P., Nardelli, F.Z., Owens, S., Ridge, T., Braibant, T., Myreen, M.O. and Alglave, J. (2009) The Semantics of x86-CC Multiprocessor Machine Code. Proc. POPL'09.
83. Gabbay, M.J. (2001) A Theory of inductive definitions with alpha-equivalence. PhD Thesis, Cambridge University.
84. Nygaard, M. (2004) Strong correspondence for HOPLA. http://www.daimi.au. dk/~nygaard/pub/strongcorrespondence.pdf.
85. Griffiths, R.B. (2003) Consistent QuantumTheory. Cambridge University Press.
86. Abramsky, S. and Coecke, B. (2004)A Categorical Semantics of Quantum Protocols. Proc. LICS'04.
87. Selinger, P. and Valiron, B. (2008) On a Fully Abstract Model for a Quantum Linear Functional Language. Proc. QPL 2006, Oxford, Electronic Notes in Theoretical Computer Sciences, Vol. 210, 123-137.
88. van Tonder, A. (2004) A lambda calculus for quantum computation. SIAM J. Comput. 33, 1109-1135.
89. Eppendahl, A. (2007) Knot Theory and Data Distribution. Talk at Universal Structures in Mathematics and Computing (USMC), Australian National University, Canberra, February 2007.
90. Goubault, E. (2003) Some geometric perspectives in concurrency theory. Homology, Homotopy Appl. 5, 95-136.
91. Gunawardena, J. (2001) Homotopy and concurrency. Bull. Eur. Assoc. Theor. Comput. Sci., 54, 184-193
92. Selected for inclusion in Paun, G., Rozenberg, G. and Salomaa, A., (eds) (1994), 'Current trends in Theoretical Computer Science: Entering the 21st Century'.World Scientific.
93. Lafont,Y. (2007) Algebra and geometry of rewriting. Applied Categorical Structures 15, 415-437. Springer-Verlag, Berlin.
94. Nielsen, M. and Clausen, C. (1994) Bisimulations, Games, and Logic. Results and Trends in Theoretical Computer Science: Colloquium in Honor of Arto Salomaa, Lecture Notes in Computer Science, Vol. 812. Springer, Berlin.
95. Walukiewicz, I. (2002) Local logics for traces. Automata. Lang. Comb., 7, 259-290.
96. Datta, A., Derrick, A., Mitchell, J.C. and Roy, A. (2007) Protocol Composition Logic (PCL). In Cardelli, L., Fiore, M. and Winskel, G. (eds.), Computation, Meaning and Logic: Articles Dedicated to Gordon Plotkin, Electronic Notes in Theoretical Computer Sciences, Vol. 172, Elsevier.
97. Doghmi, S.F., Guttman, J.D. and Thayer, F.J. (2007) Searching for Shapes in Cryptographic Protocols. TACAS'07, Braga, Portugal. Lecture Notes in Computer Science, Vol. 4424. Springer, Berlin.
98. Danos, V. and Krivine, J. (2004) Reversible Communicating Systems. Proc. CONCUR'04, London, UK. Lecture Notes in Computer Science, Vol. 3170. Springer, Berlin.
99. Phillips, I. and Ulidowski, I. (2007) Reversibility and Models for Concurrency. Proc. SOS 2007,Warlaw, Poland. Electronic Notes in Theoretical Computer Sciences, Vol. 192(1).
100. Caccamo, M. and Winskel, G. (2005) Limit Preservation from Naturality. CTCS'04, Copenhagen, Denmark. Electronic Notes in Theorectical Computer Sciences, Vol. 122, pp. 3-22.
101. Kozen, D. (2004) Toward the Automation of Category Theory. Technical Report TR2004-1964, Computer Science Department, Cornell University.
102. Abramsky, S., Jagadeesan, R. and Malacaria, P. (2000) Full abstraction for PCF. Inf. Comput. 163, 409-470.
103. Hyland, J.M.E. and Luke Ong, C.-H. (2000)Onfull abstraction for PCF: I, II, and III. Inf. Comput. 163, 285-408.
104. Girard, J.-Y. (1989) Towards a Geometry of Interaction: Categories, Computer Science and Logic, Contemporary Mathematics. American Mathematical Society. 92.
105. Montanari, U. and Pistore, M. (2005) History-Dependent Automata: An Introduction. Proc. of Formal Methods for Mobile Computing, Bertinoro, Italy. Lecture Notes in Computer Science, Vol. 3465. Springer, Berlin.
106. Fiore, M.P. and Staton, S. (2006) Comparing operational models of name-passing process calculi. Inf. Comput. 204, 524-560.
107. Gadducci, F., Miculan, M. and Montanari, U. (2006) About permutation algebras, (pre)sheaves and named sets. High.- Order Symbol. Comput. 19, 283-304.
108. Winskel, G. (1980) Events in computation. PhD Thesis, University of Edinburgh. Available from
109. Winskel, G. (1987) Petri nets, algebras, morphisms and compositionality. Inf. Comput. 72, 197-238.