Abstract
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.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
C. Köcher and D. Kuske—Supported by the DFG-Project “Speichermechanismen als Monoide”, KU 1107/9-1.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Abdulla, P.A., Jonsson, B.: Verifying programs with unreliable channels. Inf. Comput. 127(2), 91–101 (1996)
Brand, D., Zafiropulo, P.: On communicating finite-state machines. J. ACM 30(2), 323–342 (1983)
Cécé, G., Finkel, A., Iyer, S.P.: Unreliable channels are easier to verify than perfect channels. Inf. Comput. 124(1), 20–31 (1996)
Chambart, P., Schnoebelen, P.: The ordinal recursive complexity of lossy channel systems. In: LICS 2008, pp. 205–216. IEEE Computer Society Press (2008)
Diekert, V.: Combinatorics on Traces, vol. 454. Springer, Heidelberg (1990)
Diekert, V., Rozenberg, G.: The Book of Traces. World Scientific, Singapore (1995)
Finkel, A.: Decidability of the termination problem for completely specified protocols. Distrib. Comput. 7(3), 129–135 (1994)
Haase, C., Schmitz, S., Schnoebelen, P.: The power of priority channel systems. Log. Methods Comput. Sci. 10(4), 4 (2014)
Huschenbett, M., Kuske, D., Zetzsche, G.: The monoid of queue actions. In: Semigroup Forum (2017, to appear)
Kambites, M.: Formal languages and groups as memory. Commun. Algebra 37(1), 193–208 (2009)
Köcher, C.: Einbettungen in das Transformationsmonoid einer vergesslichen Warteschlange. Master’s thesis, TU Ilmenau (2016)
Kuske, D., Prianychnykova, O., The trace monoids in the queue monoid, in the direct product of two free monoids. arXiv preprint arXiv:1603.07217 (2016)
Masson, B., Schnoebelen, P.: On verifying fair lossy channel systems. In: Diks, K., Rytter, W. (eds.) MFCS 2002. LNCS, vol. 2420, pp. 543–555. Springer, Heidelberg (2002). doi:10.1007/3-540-45687-2_45
Mazurkiewicz, A.: Concurrent program schemes and their interpretations. DAIMI Rep. Ser. 6(78), 1–51 (1977)
Muscholl, A., Petersen, H.: A note on the commutative closure of star-free languages. Inf. Process. Lett. 57(2), 71–74 (1996)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer International Publishing AG
About this paper
Cite this paper
Köcher, C., Kuske, D. (2017). The Transformation Monoid of a Partially Lossy Queue. In: Weil, P. (eds) Computer Science – Theory and Applications. CSR 2017. Lecture Notes in Computer Science(), vol 10304. Springer, Cham. https://doi.org/10.1007/978-3-319-58747-9_18
Download citation
DOI: https://doi.org/10.1007/978-3-319-58747-9_18
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-58746-2
Online ISBN: 978-3-319-58747-9
eBook Packages: Computer ScienceComputer Science (R0)