The Cayley-graph of the queue monoid: logic and decidability

We investigate the decidability of logical aspects of graphs that arise as Cayley-graphs of the so-called queue monoids. These monoids model the behavior of the classical (reliable) fifo-queues. We answer a question raised by Huschenbett, Kuske, and Zetzsche and prove the decidability of the first-o...

Full description

Bibliographic Details
Published in:38th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science : FSTTCS 2018, December 11-13, 2018, Ahmedabad, India, (2018), Seite 9:1-9:17
Main Author: Abu Zaid, Faried (Author)
Other Involved Persons: Köcher, Chris
Format: electronic Article
Language:English
Physical Description:Online-Ressource
DOI:10.4230/LIPIcs.FSTTCS.2018.9
Local Subject Headings:
Further Information:http://dx.doi.org/10.4230/LIPIcs.FSTTCS.2018.9
http://nbn-resolving.de/urn/resolver.pl?urn=urn:nbn:de:0030-drops-99088
QR Code: Show QR Code