Sheaf semantics for concurrent interacting objects
- 1 June 1992
- journal article
- Published by Cambridge University Press (CUP) in Mathematical Structures in Computer Science
- Vol. 2 (2) , 159-191
- https://doi.org/10.1017/s0960129500001420
Abstract
This paper uses concepts from sheaf theory to explain phenomena in concurrent systems, including object, inheritance, deadlock, and non-interference, as used in computer security. The approach is very; general, and applies not only to concurrent object oriented systems, but also to systems of differential equations, electrical circuits, hardware description languages, and much more. Time can be discrete or continuous, linear or branching, and distribution is allowed over space as well as time. Concepts from categpru theory help to achieve this generality: objects are modelled by sheaves; inheritance by sheaf morphisms; systems by diagrams; and interconnection by diagrams of diagrams. In addition, behaviour is given by limit, and the result of interconnection by colimit. The approach is illustrated with many examples, including a semantics for a simple concurrent object-based programming language.Keywords
This publication has 17 references indexed in Scilit:
- A categorical manifestoMathematical Structures in Computer Science, 1991
- A categorial theory of objects as observed processesPublished by Springer Nature ,1991
- A compositional proof system on a category of labelled transition systemsInformation and Computation, 1990
- Algebraic implementation of objects over objectsPublished by Springer Nature ,1990
- Objects, object types, and object identificationPublished by Springer Nature ,1989
- Linear logicTheoretical Computer Science, 1987
- Process algebra for synchronous communicationInformation and Control, 1984
- Introduction to Part IPublished by Springer Nature ,1975
- OBJECTSInternational Journal of General Systems, 1974
- Sheaves with values in a categoryTopology, 1965