arXiv Analytics

Sign in

arXiv:math/0701552 [math.AT]AbstractReferencesReviewsResources

Towards a homotopy theory of process algebra

Philippe Gaucher

Published 2007-01-19, updated 2008-05-15Version 4

This paper proves that labelled flows are expressive enough to contain all process algebras which are a standard model for concurrency. More precisely, we construct the space of execution paths and of higher dimensional homotopies between them for every process name of every process algebra with any synchronization algebra using a notion of labelled flow. This interpretation of process algebra satisfies the paradigm of higher dimensional automata (HDA): one non-degenerate full $n$-dimensional cube (no more no less) in the underlying space of the time flow corresponding to the concurrent execution of $n$ actions. This result will enable us in future papers to develop a homotopical approach of process algebras. Indeed, several homological constructions related to the causal structure of time flow are possible only in the framework of flows.

Comments: 33 pages ; LaTeX2e ; 1 eps figure ; package semantics included ; v2 HDA paradigm clearly stated and simplification in a homotopical argument ; v3 "bug" fixed in notion of non-twisted shell + several redactional improvements ; v4 minor correction : the set of labels must not be ordered ; published at http://intlpress.com/HHA/v10/n1/a16/
Journal: Homology Homotopy and Applications, vol. 10 (1):p.353-388, 2008
Categories: math.AT, math.CT
Subjects: 55P99, 68Q85
Related articles: Most relevant | Search more
arXiv:math/0201252 [math.AT] (Published 2002-01-25, updated 2005-05-03)
A Convenient Category for The Homotopy Theory of Concurrency
arXiv:math/0305169 [math.AT] (Published 2003-05-12, updated 2005-05-16)
Homological properties of non-deterministic branchings and mergings in higher dimensional automata
arXiv:2006.05797 [math.AT] (Published 2020-06-10)
Strictifying and taming directed paths in Higher Dimensional Automata