Bounded stacks, bags and queues
- Cite this paper as:
- Baeten J.C.M., Bergstra J.A. (1997) Bounded stacks, bags and queues. In: Mazurkiewicz A., Winkowski J. (eds) CONCUR '97: Concurrency Theory. CONCUR 1997. Lecture Notes in Computer Science, vol 1243. Springer, Berlin, Heidelberg
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.
Unable to display preview. Download preview PDF.