TY - BOOK

T1 - Queue merge : a binary operator for modeling queueing behavior

AU - Cuijpers, P.J.L.

AU - Koenders, F.A.J.

AU - Pustjens, M.G.P.

AU - Senders, B.A.G.

AU - Tilburg, van, P.J.A.

AU - Verduin, P.

PY - 2009

Y1 - 2009

N2 - 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.

AB - 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.

M3 - Report

T3 - Computer science reports

BT - Queue merge : a binary operator for modeling queueing behavior

PB - Technische Universiteit Eindhoven

CY - Eindhoven

ER -