A Chu space is a binary relation = | 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 = | 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 = | with itself. The natural algebra of Chu spaces is that of linear logic, made a process algebra by the process interpretation. 1

A workshop on "New Connections between Mathematics and Computer Science" was held at the Isaac Newton Institute for Mathematical Sciences in Cambridge, England from 20-24 November 1995. The workshop was supported by the Engineering and Physical Science Research Council of the United Kingdom, the London Mathematical Society and Hewlett-Packard's Basic Research Institute in the Mathematical Sciences. This document contains a report on the workshop, the abstracts of the talks and the accompanying bibliography. 1 Report on the workshop The interplay between mathematics and computer science has traditionally centered around areas in logic, category theory and discrete mathematics. In recent years new connections between mathematics and computer science have emerged from such unexpected quarters as algebraic topology, differential geometry, dynamical systems and operator algebras. These new developments hold the promise of bringing new insights and powerful mathematical tools to bear on p...

The specification, verification, design and implementation of real-time system is a major software engineering problem. While logical correctness is a major issue in the development of large and complex software systems, real-time system development demands that timing correctness be satisfied additionally. Formal methods of specification and verification are imperative for this task, and there has been considerable research in the area for the past two decades. Of these, state-transition based techniques are numerous and well-developed. This paper attempts to compare the approaches taken by workers in the area and provide an introduction to the major issues facing a real-time system developer who wishes to use one of these formal methods.