Gates accept concurrent behavior

We represent concurrent processes as Boolean propositions or gates, cast in the role of accepters of concurrent behavior. This properly extends other mainstream representations of concurrent behavior such as event structures, yet is defined more simply. It admits an intrinsic notion of duality that permits processes to be viewed as either schedules or automata. Its algebraic structure is essentially that of linear logic, with its morphisms being consequence-preserving renamings of propositions, and with its operations forming the core of a natural concurrent programming language.<<ETX>>

[1]  A. Tarski,et al.  Boolean Algebras with Operators , 1952 .

[2]  Wolfgang Reisig,et al.  Petri Nets , 1985, EATCS Monographs on Theoretical Computer Science.

[3]  Ursula Goltz,et al.  Equivalence Notions for Concurrent Systems and Refinement of Actions (Extended Abstract) , 1989, MFCS.

[4]  Glynn Winskel,et al.  A category of labelled Petri nets and compositional proof system , 1988, [1988] Proceedings. Third Annual Information Symposium on Logic in Computer Science.

[5]  Grzegorz Rozenberg,et al.  Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency , 1988, Lecture Notes in Computer Science.

[6]  J. Grabowski,et al.  On partial languages , 1981, Fundam. Informaticae.

[7]  Eric Goubault,et al.  Homology of Higher Dimensional Automata , 1992, CONCUR.

[8]  Vaughan R. Pratt,et al.  On the composition of processes , 1982, POPL '82.

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

[10]  Glynn Winskel,et al.  Petri Nets, Event Structures and Domains, Part I , 1981, Theor. Comput. Sci..

[11]  Manfred Droste.  Event Structures and Domains , 1989, Theor. Comput. Sci..

[12]  Robin Milner,et al.  Calculi for Synchrony and Asynchrony , 1983, Theor. Comput. Sci..

[13]  Irene Greif,et al.  Semantics of communicating parallel processes , 1975 .

[14]  Thomas Streicher,et al.  Games semantics for linear logic , 1991, [1991] Proceedings Sixth Annual IEEE Symposium on Logic in Computer Science.

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

[16]  Glynn Winskel,et al.  An introduction to event structures , 1988, REX Workshop.

[17]  A. Tarski,et al.  Boolean Algebras with Operators. Part I , 1951 .

[18]  Robin Milner,et al.  A Calculus of Communicating Systems , 1980, Lecture Notes in Computer Science.

[19]  Patrick Lincoln,et al.  Linear logic , 1992, SIGA.

[20]  R. McKenzie,et al.  Algebras, Lattices, Varieties , 1988 .

[21]  Robin Milner,et al.  Operational and Algebraic Semantics of Concurrent Processes , 1991, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.

[22]  C. A. Petri.  Fundamentals of a Theory of Asynchronous Information Flow , 1962, IFIP Congress.

[23]  Vaughan R. Pratt,et al.  Modeling concurrency with geometry , 1991, POPL '91.

[24]  Vaughan R. Pratt,et al.  The Second Calculus of Binary Relations , 1993, MFCS.

[25]  José Meseguer,et al.  Temporal Structures , 1989, Mathematical Structures in Computer Science.

[26]  Michael Barr,et al.  *-Autonomous categories and linear logic , 1991, Mathematical Structures in Computer Science.

[27]  C. Hartshorne,et al.  Collected Papers of Charles Sanders Peirce , 1935, Nature.

[28]  P. Halmos.  Finite-Dimensional Vector Spaces , 1960 .