Category of asynchronous systems and polygonal morphisms
Logic in Computer Science
2019-08-06 v1 Category Theory
Abstract
A weak asynchronous system is a trace monoid with a partial action on a set. A polygonal morphism between weak asynchronous systems commutes with the actions and preserves the independence of events. We prove that the category of weak asynchronous systems and polygonal morphisms has all limits and colimits.
Cite
@article{arxiv.1308.1443,
title = {Category of asynchronous systems and polygonal morphisms},
author = {Ahmet A. Husainov},
journal= {arXiv preprint arXiv:1308.1443},
year = {2019}
}
Comments
18 pages