Events, Causality and Symmetry

The article discusses causal models, such as Petri nets and event structures, how they have been rediscovered in a wide variety of recent applications and why they are fundamental to computer science. A discussion of their present limitations leads to their extension with symmetry. The consequences, actual and potential, are discussed.

[1]  Dan R. Ghica,et al.  Reasoning about Idealized ALGOL Using Regular Languages , 2000, ICALP.

[2]  Eric Goubault,et al.  SOME GEOMETRIC PERSPECTIVES IN CONCURRENCY THEORY , 2003 .

[3]  Samson Abramsky,et al.  A categorical semantics of quantum protocols , 2004, Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science, 2004..

[4]  Daniele Varacca,et al.  Probability, Nondeterminism and Concurrency: Two Denotational Models for Probabilistic Computation , 2003 .

[5]  Prakash Panangaden,et al.  A Domain of Spacetime Intervals in General Relativity , 2005, Spatial Representation.

[6]  Glynn Winskel,et al.  Presheaf Models for the pi-Calculus , 1997, Category Theory and Computer Science.

[7]  Javier Esparza,et al.  Unfoldings - A Partial-Order Approach to Model Checking , 2008, Monographs in Theoretical Computer Science. An EATCS Series.

[8]  André van Tonder,et al.  A Lambda Calculus for Quantum Computation , 2003, SIAM J. Comput..

[9]  Glynn Winskel,et al.  Probabilistic event structures and domains , 2004, Theor. Comput. Sci..

[10]  Gordon D. Plotkin,et al.  A structural approach to operational semantics , 2004, J. Log. Algebraic Methods Program..

[11]  Glynn Winskel,et al.  Symmetry and Concurrency , 2007, CALCO.

[12]  Mogens Nielsen,et al.  Bisimulations, Games, and Logic , 1994 .

[13]  Igor Walukiewicz.  Local Logics for Traces , 2002, J. Autom. Lang. Comb..

[14]  Albert Benveniste,et al.  True-concurrency probabilistic models: Branching cells and distributed probabilities for event structures , 2006, Inf. Comput..

[15]  Glynn Winskel,et al.  A relational model of non-deterministic dataflow , 1998, Mathematical Structures in Computer Science.

[16]  William B. Ackerman,et al.  Scenarios: A Model of Non-Determinate Computation , 1981, ICFPC.

[17]  Glynn Winskel,et al.  Weak bisimulation and open maps , 1999, Proceedings. 14th Symposium on Logic in Computer Science (Cat. No. PR00158).

[18]  Glynn Winskel,et al.  DI-Domains as a Model of Polymorphism , 1987, MFPS.

[19]  Jean-Yves Girard,et al.  Linear Logic , 1987, Theor. Comput. Sci..

[20]  Andrew D. Gordon,et al.  Typing One-to-One and One-to-Many Correspondences in Security Protocols , 2002, ISSS.

[21]  A. Joyal.  Une théorie combinatoire des séries formelles , 1981 .

[22]  Maciej Koutny,et al.  Logic Synthesis for Asynchronous Circuits Based on STG Unfoldings and Incremental SAT , 2006, Fundam. Informaticae.

[23]  A. Prasad Sistla,et al.  Symmetry and model checking , 1993, Formal Methods Syst. Des..

[24]  Jeremy Gunawardena,et al.  Homotopy and Concurrency , 2001, Bull. EATCS.

[25]  Joshua D. Guttman,et al.  Strand spaces: why is a security protocol correct? , 1998, Proceedings. 1998 IEEE Symposium on Security and Privacy (Cat. No.98CB36186).

[26]  Albert Benveniste,et al.  Probabilistic models for true-concurrency: branching cells and distributed probabilities for event structures , 2006 .

[27]  Glynn Winskel,et al.  Linear Logic in Computer Science: Linearity and Nonlinearity in Distributed Computation , 2004 .

[28]  Glynn Winskel,et al.  Limit Preservation from Naturality , 2004, CTCS.

[29]  Joseph E. Stoy,et al.  Denotational Semantics: The Scott-Strachey Approach to Programming Language Theory , 1981 .

[30]  Marcelo P. Fiore,et al.  Unique factorisation lifting functors and categories of linearly-controlled processes , 2000, Math. Struct. Comput. Sci..

[31]  Eugenio Moggi,et al.  Computational lambda-calculus and monads , 1989, [1989] Proceedings. Fourth Annual Symposium on Logic in Computer Science.

[32]  Glynn Winskel.  Relations in concurrency , 2005, 20th Annual IEEE Symposium on Logic in Computer Science (LICS' 05).

[33]  Glynn Winskel,et al.  Nominal Domain Theory for Concurrency , 2009, CSL.

[34]  Vladimiro Sassone,et al.  A Bayesian Model for Event-based Trust , 2022 .

[35]  Rob J. van Glabbeek,et al.  On the expressiveness of higher dimensional automata , 2006, Theor. Comput. Sci..

[36]  José Meseguer,et al.  Petri Nets Are Monoids , 1990, Inf. Comput..

[37]  Glynn Winskel.  Event Structures as Presheaves —Two Representation Theorems , 1999 .

[38]  Daniele Varacca,et al.  Compositional Event Structure Semantics for the Internal pi -Calculus , 2007, CONCUR.

[39]  A. Joyal,et al.  The geometry of tensor calculus, I , 1991 .

[40]  C. Petri.  Kommunikation mit Automaten , 1962 .

[41]  Irek Ulidowski,et al.  Reversibility and Models for Concurrency , 2007, Electron. Notes Theor. Comput. Sci..

[42]  Pawel Sobocinski.  Reversing graph transformations , 2006, Electron. Commun. Eur. Assoc. Softw. Sci. Technol..

[43]  C. Q. Lee,et al.  The Computer Journal , 1958, Nature.

[44]  L. Nachbin.  Topology and order , 1965 .

[45]  Glynn Winskel,et al.  The unfolding of general Petri nets , 2008, FSTTCS.

[46]  Sam Staton,et al.  Comparing Operational Models of Name-Passing Process Calculi , 2004, CMCS.

[47]  Samson Abramsky.  Event Domains, Stable Functions and Proof-Nets , 2007, Electron. Notes Theor. Comput. Sci..

[48]  C. A. R. Hoare,et al.  Communicating sequential processes , 1978, CACM.

[49]  Benoît Valiron,et al.  On a Fully Abstract Model for a Quantum Linear Functional Language: (Extended Abstract) , 2008, QPL.

[50]  Michael W. Mislove.  On Combining Probability and Nondeterminism , 2006, Electron. Notes Theor. Comput. Sci..

[51]  Tom Ridge,et al.  The semantics of x86-CC multiprocessor machine code , 2009, POPL '09.

[52]  Rob J. van Glabbeek.  The Individual and Collective Token Interpretations of Petri Nets , 2005, CONCUR.

[53]  Nancy A. Lynch,et al.  Distributed Algorithms , 1992, Lecture Notes in Computer Science.

[54]  Glynn Winskel,et al.  A Note on Powerdomains and Modalitiy , 1983, FCT.

[55]  Monika Heiner,et al.  Petri Nets for Systems and Synthetic Biology , 2008, SFM.

[56]  Glynn Winskel,et al.  A New Definition of Morphism on Petri Nets , 1984, STACS.

[57]  Dana S. Scott,et al.  Data Types as Lattices , 1976, SIAM J. Comput..

[58]  Gilles Kahn,et al.  The Semantics of a Simple Language for Parallel Programming , 1974, IFIP Congress.

[59]  Glynn Winskel,et al.  Events in security protocols , 2001, CCS '01.

[60]  Glynn Winskel,et al.  The cartesian closed bicategory of generalised species of structures , 2008 .

[61]  Jean-Yves Girard,et al.  Towards a geometry of interaction , 1989 .

[62]  Kenneth L. McMillan,et al.  A technique of state space search based on unfolding , 1995, Formal Methods Syst. Des..

[63]  Robin Milner,et al.  Communicating and mobile systems - the Pi-calculus , 1999 .

[64]  Vladimiro Sassone,et al.  An axiomatization of the category of Petri net computations , 1998, Mathematical Structures in Computer Science.

[65]  Yves Lafont,et al.  Algebra and Geometry of Rewriting , 2007, Appl. Categorical Struct..

[66]  Pierre-Louis Curien,et al.  L-Nets, Strategies and Proof-Nets , 2005, CSL.

[67]  Glynn Winskel,et al.  Profunctors, open maps and bisimulation , 2004, Mathematical Structures in Computer Science.

[68]  Thorsten Altenkirch,et al.  Foundations of Software Science and Computation Structures: 6th International Conference, FOSSACS 2003 Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2003 Warsaw, Poland, April 7–11, 2003 Proceedings , 2003, Lecture Notes in Computer Science.

[69]  Marek Antoni Bednarczyk,et al.  Categories of asynchronous systems , 1987 .

[70]  Fabio Gadducci,et al.  About permutation algebras, (pre)sheaves and named sets , 2006, High. Order Symb. Comput..

[71]  Andrew M. Pitts,et al.  A First Order Theory of Names and Binding , 2001 .

[72]  Glynn Winskel,et al.  Event Structure Spans for Nondeterministic Dataflow , 2006, EXPRESS.

[73]  Gordon D. Plotkin,et al.  A Powerdomain Construction , 1976, SIAM J. Comput..

[74]  Mikkel Nygaard August.  Strong Correspondence for HOPLA , 2004 .

[75]  David B. Benson.  Counting Paths: Nondeterminism as Linear Algebra , 1984, IEEE Transactions on Software Engineering.

[76]  Glynn Winskel,et al.  Events in computation , 1980 .

[77]  C.-H. Luke Ong,et al.  On Full Abstraction for PCF: I, II, and III , 2000, Inf. Comput..

[78]  Matthew Hennessy,et al.  The Power of the Future Perfect in Program Logics , 1984, Inf. Control..

[79]  John C. Mitchell,et al.  Protocol Composition Logic (PCL) , 2007, Computation, Meaning, and Logic.

[80]  Hartmut Ehrig,et al.  Workshop on Petri Nets and Graph Transformations , 2006, ICGT.

[81]  Glynn Winskel,et al.  Event Structure Semantics for CCS and Related Languages , 1982, ICALP.

[82]  Joshua D. Guttman,et al.  Searching for Shapes in Cryptographic Protocols , 2007, TACAS.

[83]  Glynn Winskel,et al.  Event Structures with Symmetry , 2007, Computation, Meaning, and Logic.

[84]  Glynn Winskel,et al.  Domain theory for concurrency , 2003, Theor. Comput. Sci..

[85]  Glynn Winskel,et al.  Bisimulation from Open Maps , 1994, Inf. Comput..

[86]  Glynn Winskel,et al.  Petri Nets, Event Structures and Domains , 1979, Semantics of Concurrent Computation.

[87]  A. Carboni,et al.  Regular and exact completions , 1998 .

[88]  M. W. Shields.  Concurrent Machines , 1985, Comput. J..

[89]  J. van Leeuwen,et al.  Theoretical Computer Science , 2003, Lecture Notes in Computer Science.

[90]  John C. Mitchell,et al.  Relating strands and multiset rewriting for security protocol analysis , 2000, Proceedings 13th IEEE Computer Security Foundations Workshop. CSFW-13.

[91]  Marco Pistore,et al.  History-Dependent Automata: An Introduction , 2005, SFM.

[92]  Mogens Nielsen,et al.  Models for Concurrency , 1992 .

[93]  Glynn Winskel,et al.  Event Structures as Presheaves -Two Representation Theorems , 1999, CONCUR.

[94]  Glynn Winskel,et al.  Event Structures , 1986, Advances in Petri Nets.

[95]  Leslie Lamport,et al.  Time, clocks, and the ordering of events in a distributed system , 1978, CACM.

[96]  Samy Abbes.  A Cartesian closed category of event structures with quotients , 2006, Discret. Math. Theor. Comput. Sci..

[97]  Robin Milner,et al.  Communication and concurrency , 1989, PHI Series in computer science.

[98]  Vincent Danos,et al.  Scalable Simulation of Cellular Signaling Networks , 2007, APLAS.

[99]  Andrew M. Pitts,et al.  Nominal Logic: A First Order Theory of Names and Binding , 2001, TACS.

[100]  Simon W. Moore,et al.  The next resource war: computation vs. communication , 2008, SLIP '08.

[101]  Radha Jagadeesan,et al.  Full Abstraction for PCF , 1994, Inf. Comput..

[102]  Glynn Winskel,et al.  Petri Nets, Algebras, Morphisms, and Compositionality , 1987, Inf. Comput..

[103]  Albert Benveniste,et al.  Fault Detection and Diagnosis in Distributed Systems: An Approach by Partially Stochastic Petri Nets , 1998, Discret. Event Dyn. Syst..

[104]  Dexter Kozen.  Toward the Automation of Category Theory , 2004 .

[105]  Vincent Danos,et al.  Reversible Communicating Systems , 2004, CONCUR.

[106]  R. Griffiths.  Consistent Quantum Theory , 2001 .