The Transformation Monoid of a Partially Lossy Queue
The Transformation Monoid of a Partially Lossy Queue
复制标题
部分有损队列的变换幺半群
DOI:
10.1007/978-3-319-58747-9_18
复制
发表时间:
2017
期刊:
影响因子:
--
通讯作者:
D. Kuske
中科院分区:
文献类型:
--
作者:
C. Köcher;D. Kuske
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 monoids 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. The resulting picture is far more diverse than in the case of reliable queues studied before.
登录
查看更多内容
影响因子:
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
影响因子:
0.5
作者:
A. Muscholl;H. Petersen
通讯作者:
H. Petersen
DOI:
--
发表时间:
2013
期刊:
International Conference on Concurrency Theory
影响因子:
--
作者:
C. Haase;S. Schmitz;P. Schnoebelen
通讯作者:
P. Schnoebelen
DOI:
--
发表时间:
1990
期刊:
Lecture Notes in Computer Science
影响因子:
--
作者:
V. Diekert
通讯作者:
V. Diekert