Queue merge : a binary operator for modeling queueing behavior

P.J.L. Cuijpers, F.A.J. Koenders, M.G.P. Pustjens, B.A.G. Senders, P.J.A. Tilburg, van, P. Verduin

Research output: Book/ReportReportAcademic

33 Downloads (Pure)

Abstract

We propose a process algebra QA, in which it is possible to describe a queue process. This process models a queue data structure in the same way as it is possible to model a bag data structure and a stack data structure using other process algebras. Furthermore we give a proof sketch that every process in this algebra is branching bisimilar to a regular process communicating with this queue. We try to establish a link between processes in QA and languages generated by queue grammars, but fail to map either of those to the other, conjecturing that no algebraic operator can exist which directly models the class of grammars that use a queue.
Original languageEnglish
Place of PublicationEindhoven
PublisherTechnische Universiteit Eindhoven
Number of pages30
Publication statusPublished - 2009

Publication series

NameComputer science reports
Volume0902
ISSN (Print)0926-4515

Fingerprint

Dive into the research topics of 'Queue merge : a binary operator for modeling queueing behavior'. Together they form a unique fingerprint.

Cite this