A model category for local po-spaces (Q2488617): Difference between revisions

Concurrent systems and their programming offer some of the most challenging practical issues in computing theory. While much work in the area has relied on largely procedural methods such as locking and semaphores to reason about such systems, more abstract approaches based on topology and category theory have emerged recently [\textit{P. Gaucher}, Homology Homotopy Appl. 5, No. 1, 549--599, electronic only (2003; Zbl 1069.55008)]. In this paper the idea is that concurrent processes can be modeled using locally partially ordered spaces. The partial ordering allows for the irreversibility of time. That this ordering should be local is to allow for programs with loops in them. Accepting this idea requires that one be able to provide enough of the categorical machinery to define a notion of equivalence for these locally partially ordered spaces. The paper shows that the category of simplicial presheaves on local partially ordered spaces can be given a model structure. A localization of the category that is intended to provide enough equivalences for the context of concurrent systems is described. For the reader interested in concurrency the paper will appear very abstract. For the category theorist the application will probably seem irrelevant. In either case it is unfortunate that no concrete application to concurrency is given.