Affiliations: Sobolev Institute of Mathematics, SB RAS, 4, Acad. Koptyug avenue, 630090, Novosibirsk, Russia | A.P. Ershov Institute of Informatics Systems, SB RAS, 6, Acad. Lavrentiev avenue, 630090, Novosibirsk, Russia, virb@iis.nsk.su | Carl von Ossietzky University of Oldenburg, D-26111 Oldenburg, Germany
Note: [] Address for correspondence: A.P. Ershov Institute of Informatics Systems, SB RAS, 6, Acad. Lavrentiev avenue, 630090, Novosibirsk, Russia Also works: Novosibirsk State University, 2, Pirogova st., Novosibirsk, 630090, Russia
Abstract: The intention of the paper is to show how several categorical (open morphisms, path morphisms and coalgebraic morphisms based) approaches to an abstract characterization of bisimulation relate to each other and to behavioral bisimulations, in the setting of higher dimensional automata. Such a relating makes it possible to develop a metatheory designed for unified definition and study of equivalences in true concurrency semantics.
