Category of asynchronous systems and polygonal morphisms
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.
- Published
- 28 October 2016
- Volume
- 2016 (2016)
- License
- CC BY 3.0
Copyright © 2016 Ahmet Husainov. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Cite this article
A. Husainov, Category of asynchronous systems and polygonal morphisms, J. Semigroup Theory Appl. 2016 (2016), 8.
BibTeX
@article{Husainov2016,
author = {Husainov, Ahmet},
title = {Category of asynchronous systems and polygonal morphisms},
journal = {J. Semigroup Theory Appl.},
volume = {2016},
year = {2016},
pages = {8},
doi = {}
}