Parallelization of Concurrent Processes in Higher Dimensional Automata(Theory of Rewriting Systems and Its Applications)
Yukihide Takayama · Kyoto University Research Information Repository (Kyoto University) · 1995
In many process algebras, a nondeterministic choice in particular $\mathrm{f}\mathrm{o}\mathrm{r}\ln$ can be translated to a parallel composition with the expansion law.This translation, $\mathrm{w}\mathrm{h}\mathrm{i}\mathrm{c}1_{1}$ we will call par- allelization, is not trivial because we must find subprocesses in rather complex pattern in a given process.This paper gives a parallelization algorithm.The algorithm has a clear geometric meaning, but $\mathrm{t}1_{1}\mathrm{e}$ precise definition needs Bar constructioll in cohomology theory of groups.