CONCUR '97: Concurrency Theory

Volume 1243 of the series Lecture Notes in Computer Science pp 104-118


Bounded stacks, bags and queues

  • J. C. M. BaetenAffiliated withDepartment of Mathematics and Computing Science, Eindhoven University of Technology
  • , J. A. BergstraAffiliated withProgramming Research Group, University of AmsterdamDepartment of Philosophy, Utrecht University

* Final gross prices may vary according to local VAT.

Get Access


We prove that a bounded stack can be specified in process algebra with just the operators alternative and sequential composition and iteration. The bounded bag cannot be specified with these operators, but can be specified if we add the parallel composition operator without communication (free merge). The bounded queue cannot even be specified in this signature; we need a form of variable binding such as given by general communication and encapsulation, the state operator, or abstraction.