Temporal Structures
- 1 July 1991
- journal article
- research article
- Published by Cambridge University Press (CUP) in Mathematical Structures in Computer Science
- Vol. 1 (2) , 179-213
- https://doi.org/10.1017/s0960129500001286
Abstract
We combine the principles of the Floyd-Warshall-Kleene algorithm, enriched categories, and Birkhoff arithmetic, to yield a useful class of algebras of transitive vertex-labeled spaces. The motivating application is a uniform theory of abstract or parametrized time in which to any given notion of time there corresponds an algebra of concurrent behaviors and their operations, always the same operations but interpreted automatically and appropriately for that notion of time. An interesting side application is a language for succinctly naming a wide range of datatypes.Keywords
This publication has 14 references indexed in Scilit:
- Modeling concurrency by partial orders and nonlinear transition systemsPublished by Springer Nature ,1989
- Linear logicTheoretical Computer Science, 1987
- Modeling concurrency with partial ordersInternational Journal of Parallel Programming, 1986
- Bits and pieces of the theory of institutionsPublished by Springer Nature ,1986
- Variation through enrichmentJournal of Pure and Applied Algebra, 1983
- A representation theorem for models of *-free PDLPublished by Springer Nature ,1980
- Closed CategoriesPublished by Springer Nature ,1966
- A Theorem on Boolean MatricesJournal of the ACM, 1962
- Generalized arithmeticDuke Mathematical Journal, 1942
- An extended arithmeticDuke Mathematical Journal, 1937