Homotopy Bisimilarity for Higher-Dimensional Automata
Logic in Computer Science
2014-09-23 v1 Category Theory
Abstract
We introduce a new category of higher-dimensional automata in which the morphisms are functional homotopy simulations, i.e. functional simulations up to concurrency of independent events. For this, we use unfoldings of higher-dimensional automata into higher-dimensional trees. Using a notion of open maps in this category, we define homotopy bisimilarity. We show that homotopy bisimilarity is equivalent to a straight-forward generalization of standard bisimilarity to higher dimensions, and that it is finer than split bisimilarity and incomparable with history-preserving bisimilarity.
Keywords
Cite
@article{arxiv.1409.5865,
title = {Homotopy Bisimilarity for Higher-Dimensional Automata},
author = {Uli Fahrenberg and Axel Legay},
journal= {arXiv preprint arXiv:1409.5865},
year = {2014}
}
Comments
Heavily revised version of arXiv:1209.4927