Computing path categories of finite directed cubical complexes (Q2352518)

The author is interested in the framework of directed cubical complexes in concurrency theory. When considering paths through such a complex, one would like to model regions through which paths are not allowed. One approach is via the path category construction, yet understanding homotopies of such restricted paths can be computationally problematic. In this paper, conditions are given under which one can reduce to a simpler subcomplex whose path category is included fully faithfully into the path category of the original complex. In the final two sections of the paper, the author considers algorithms for implementing his results and describes software he has developed for this purpose.