The inclusion structure of partially lossy queue monoids and their trace submonoids
The inclusion structure of partially lossy queue monoids and their trace submonoids
复制标题
部分有损队列幺半群及其踪迹子幺半群的包含结构
DOI:
10.1051/ita/2018003
复制
发表时间:
2018
期刊:
影响因子:
--
通讯作者:
E. Prianychnykova
中科院分区:
文献类型:
--
作者:
C. Köcher;D. Kuske;E. Prianychnykova
We model the behavior of a lossy fifo-queue as a monoid of transformations that are induced by sequences of writing and reading. To have a common model for reliable and lossy queues, we split the alphabet of the queue into two parts: the forgettable letters and the letters that are transmitted reliably. We describe this monoid by means of a confluent and terminating semi-Thue system and then study some of the monoid’s algebraic properties. In particular, we characterize completely when one such monoid can be embedded into another as well as which trace monoids occur as submonoids. Surprisingly, these are precisely those trace monoids that embed into the direct product of two free monoids–which gives a partial answer to a question raised by Diekert et al. at STACS 1995.
登录
查看更多内容
影响因子:
0.7
作者:
Martin Huschenbett;D. Kuske;Georg Zetzsche
通讯作者:
Georg Zetzsche
DOI:
--
发表时间:
2002
期刊:
International Symposium on Mathematical Foundations of Computer Science
影响因子:
--
作者:
Benoît Masson;P. Schnoebelen
通讯作者:
P. Schnoebelen
影响因子:
1.1
作者:
Michal Kunc
通讯作者:
Michal Kunc
DOI:
--
发表时间:
2013
期刊:
International Conference on Concurrency Theory
影响因子:
--
作者:
C. Haase;S. Schmitz;P. Schnoebelen
通讯作者:
P. Schnoebelen
影响因子:
1.1
作者:
M. Clerbout;M. Latteux
通讯作者:
M. Latteux