Abstract
In this paper, we develop a systematic approach describing spaces of directed paths ‐ up to homotopy equivalence ‐ as finite prodsimplicial complexes, ie with products of simplices as building blocks. This method makes use of a certain poset category of binary matrices related to a given model space. It applies to a class of directed spaces that arise from a certain class of models of computation ‐ still restricted but with a fair amount of generality. In the final section, we outline a generalization to model spaces known as Higher Dimensional Automata. In particular, we describe algorithms that allow us to determine not only the fundamental category of such a model space, but all homological invariants of spaces of directed paths within it. The prodsimplical complexes and their associated chain complexes are finite, but they will, in general, have a huge number of cells and generators.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
