Hostname: page-component-76fb5796d-vfjqv Total loading time: 0 Render date: 2024-04-26T02:37:24.095Z Has data issue: false hasContentIssue false

Higher dimensional automata revisited

Published online by Cambridge University Press:  01 August 2000

VAUGHAN PRATT
Affiliation:
Department of Computer Science, Stanford University, Stanford, CA 94305-9045

Abstract

The dual of a true concurrency schedule appears to be a false concurrency automaton, a paradox we resolved in a previous paper by extending the latter to higher dimensions. This extension may be formalized via such discrete geometries as n-categories, simplicial complexes, cubical complexes and Chu spaces. We advocate the last as having a clear notion of event, a well-defined process algebra uniformly extending that for event structures, and ease of extension beyond the basic before-during-after analysis.

Type
Research Article
Copyright
2000 Cambridge University Press

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)