Queue merge : a binary operator for modeling queueing behavior

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.

[1]  Jan A. Bergstra,et al.  Process Algebra for Synchronous Communication , 1984, Inf. Control..

[2]  Faron Moller.  The Importance of the Left Merge Operator in Process Algebras , 1990, ICALP.

[3]  Jos C. M. Baeten,et al.  A Ground-Complete Axiomatization of Finite State Processes in Process Algebra , 2005, CONCUR.

[4]  Rob J. van Glabbeek,et al.  Branching time and abstraction in bisimulation semantics , 1996, JACM.

[5]  Jos C. M. Baeten,et al.  Process Algebra: Equational Theories of Communicating Processes , 2009 .

[6]  Jan A. Bergstra,et al.  On the Consistency of Koomen's Fair Abstraction Rule , 1987, Theor. Comput. Sci..

[7]  Jos C. M. Baeten,et al.  Process Algebra , 2007, Handbook of Dynamic System Modeling.

[8]  Jan A. Bergstra,et al.  Decidability of bisimulation equivalence for process generating context-free languages , 1987, JACM.

[9]  Luca Aceto,et al.  Structural Operational Semantics , 1999, Handbook of Process Algebra.

[10]  Jan A. Bergstra,et al.  Process algebra semantics for queues , 1983 .

[11]  Jos C. M. Baeten,et al.  A Basic Parallel Process as a Parallel Pushdown Automaton , 2008, EXPRESS.

[12]  Faron Moller,et al.  Infinite Results , 1996, CONCUR.

[13]  Emil L. Post.  Formal Reductions of the General Combinatorial Decision Problem , 1943 .

[14]  Jan A. Bergstra,et al.  Decidability of Bisimulation Equivalence for Processes Generating Context-Free Languages , 1987, PARLE.

[15]  Robert de Simone,et al.  Higher-Level Synchronising Devices in Meije-SCCS , 1985, Theor. Comput. Sci..

[16]  Alessandra Cherubini,et al.  Breath and Depth Grammars and Deque Automata , 1990, Int. J. Found. Comput. Sci..

[17]  Jos C. M. Baeten,et al.  A Context-Free Process as a Pushdown Automaton , 2008, CONCUR.