Chu Spaces and Their Interpretation as Concurrent Objects

A Chu space is a binary relation Open image in new window from a set A to an antiset X defined as a set which transforms via converse functions. Chu spaces admit a great many interpretations by virtue of realizing all small concrete categories and most large ones arising in mathematical and computational practice. Of particular interest for computer science is their interpretation as computational processes, which takes A to be a schedule of events distributed in time, X to be an automaton of states forming an information system in the sense of Scott, and the pairs (a, x) in the Open image in new window relation to be the individual transcriptions of the making of history. The traditional homogeneous binary relations of transition on X and precedence on A are recovered as respectively the right and left residuals of the heterogeneous binary relation Open image in new window with itself. The natural algebra of Chu spaces is that of linear logic, made a process algebra by the process interpretation.

[1]  Vaughan R. Pratt,et al.  Gates accept concurrent behavior , 1993, Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science.

[2]  Vaughan R. Pratt,et al.  Some Constructions for Order-Theoretic Models of Concurrency , 1985, Logic of Programs.

[3]  Vaughan R. Pratt,et al.  The Duality of TIme and Information , 1992, CONCUR.

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

[5]  M. Nivat.  Fiftieth volume of theoretical computer science , 1988 .

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

[7]  Vaughan R. Pratt,et al.  Chu spaces: automata with quantum aspects , 1994, Proceedings Workshop on Physics and Computation. PhysComp '94.

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

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

[10]  坂井 利之,et al.  IFIP Congress 74 , 1974 .

[11]  Robin Milner,et al.  A Calculus of Mobile Processes, II , 1992, Inf. Comput..

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

[13]  G. Plotkin,et al.  Connguration Structures , 1995 .

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

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

[16]  Jan A. Bergstra,et al.  Process theory based on bisimulation semantics , 1988, REX Workshop.

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

[18]  Hilary A. Priestley.  Representation of distributive lattices , 1970 .

[19]  Robin Milner.  Action Calculi, or Syntactic Action Structures , 1993, MFCS.

[20]  R. A. G. Seely,et al.  Linear Logic, -Autonomous Categories and Cofree Coalgebras , 1989 .

[21]  Rajagopal Nagarajan,et al.  A typed calculus of synchronous processes , 1995, Proceedings of Tenth Annual IEEE Symposium on Logic in Computer Science.

[22]  Vineet Gupta,et al.  Chu spaces: a model of concurrency , 1994 .

[23]  Boris A. Trakhtenbrot.  Origins and metamorphoses of the Trinity: logic, nets, automata , 1995, Proceedings of Tenth Annual IEEE Symposium on Logic in Computer Science.

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

[25]  Jan A. Bergstra,et al.  Process Algebra for Synchronous Communication , 1984, Inf. Control..

[26]  Vaughan R. Pratt,et al.  The Stone gamut: a coordinatization of mathematics , 1995, Proceedings of Tenth Annual IEEE Symposium on Logic in Computer Science.

[27]  Vaughan R. Pratt,et al.  Time and Information in Sequential and Concurrent Computation , 1994, Theory and Practice of Parallel Programming.

[28]  Carolyn Brown,et al.  A categorical linear framework for Petri nets , 1990, [1990] Proceedings. Fifth Annual IEEE Symposium on Logic in Computer Science.

[29]  Hilary A. Priestley,et al.  Representation of Distributive Lattices by means of ordered Stone Spaces , 1970 .

[30]  Gordon D. Plotkin,et al.  Configuration structures , 1995, Proceedings of Tenth Annual IEEE Symposium on Logic in Computer Science.

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

[32]  Carl A. Gunter,et al.  Nets as Tensor Theories , 1989 .

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

[34]  K. I. Rosenthal.  Quantales and their applications , 1990 .

[35]  Vaughan R. Pratt.  Rational Mechanisms and Natural Mathematics , 1995, TAPSOFT.

[36]  M. Stone.  The theory of representations for Boolean algebras , 1936 .

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

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