Hostname: page-component-74656f9884-2dmjx Total loading time: 0 Render date: 2026-11-09T10:58:49.502Z 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
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

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.

Information

Type
Research Article
Copyright
2000 Cambridge University Press