The inclusion structure of partially lossy queue monoids and their trace submonoids

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.

[1]  Michal Kunc,et al.  Undecidability of the trace coding problem and some decidable cases , 2004, Theor. Comput. Sci..

[2]  Parosh Aziz Abdulla,et al.  Verifying Programs with Unreliable Channels , 1996, Inf. Comput..

[3]  Anil Nerode,et al.  Automatic Presentations of Structures , 1994, LCC.

[4]  Yoshiaki Kakuda,et al.  On Communicating Finite State Machines with Time Constraints for Conformance Testing of Communication Protocols , 1996 .

[5]  Mark Kambites,et al.  Formal Languages and Groups as Memory , 2006, math/0601061.

[6]  Dietrich Kuske,et al.  The Transformation Monoid of a Partially Lossy Queue , 2017, CSR.

[7]  Alain Finkel,et al.  Unreliable Channels are Easier to Verify Than Perfect Channels , 1996, Inf. Comput..

[8]  David B. A. Epstein,et al.  Word processing in groups , 1992 .

[9]  D. Seinsche.  On a property of the class of n-colorable graphs , 1974 .

[10]  Alain Finkel,et al.  Decidability of the termination problem for completely specified protocols , 1994, Distributed Computing.

[11]  Michel Latteux,et al.  Partial Commutations and Faithful Rational Transductions , 1984, Theor. Comput. Sci..

[12]  Anca Muscholl,et al.  On Codings of Traces , 1995, STACS.

[13]  Henning Fernau,et al.  Sequential grammars and automata with valences , 2002, Theor. Comput. Sci..

[14]  Philippe Schnoebelen,et al.  The Power of Priority Channel Systems , 2013, CONCUR.

[15]  Alexei G. Myasnikov,et al.  From automatic structures to automatic groups , 2011, ArXiv.

[16]  Dietrich Kuske,et al.  The Trace Monoids in the Queue Monoid and in the Direct Product of Two Free Monoids , 2016, DLT.

[17]  Philippe Schnoebelen,et al.  The Ordinal Recursive Complexity of Lossy Channel Systems , 2008, 2008 23rd Annual IEEE Symposium on Logic in Computer Science.

[18]  Volker Diekert,et al.  Combinatorics on Traces , 1990, Lecture Notes in Computer Science.

[19]  Volker Diekert,et al.  The Book of Traces , 1995 .

[20]  A. Mazurkiewicz.  Concurrent Program Schemes and their Interpretations , 1977 .

[21]  Mark Kambites,et al.  Rational subsets of polycyclic monoids and valence automata , 2007, Inf. Comput..

[22]  Robert Cori,et al.  Automates et Commutations Partielles , 1985, RAIRO Theor. Informatics Appl..

[23]  Philippe Schnoebelen,et al.  On Verifying Fair Lossy Channel Systems , 2002, MFCS.

[24]  Georg Zetzsche,et al.  The monoid of queue actions , 2017 .