Abstract
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.
Cite
CITATION STYLE
Baeten, J. C. M., & Bergstra, J. A. (1997). Bounded stacks, bags and queues. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1243, pp. 104–118). Springer Verlag. https://doi.org/10.1007/3-540-63141-0_8
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
