Bounded stacks, bags and queues

  • J. C. M. Baeten
  • J. A. Bergstra
Contributions

DOI: 10.1007/3-540-63141-0_8

Part of the Lecture Notes in Computer Science book series (LNCS, volume 1243)
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

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag 1997

Authors and Affiliations

  • J. C. M. Baeten
    • 1
  • J. A. Bergstra
    • 2
    • 3
  1. 1.Department of Mathematics and Computing ScienceEindhoven University of TechnologyMB EindhovenThe Netherlands
  2. 2.Programming Research GroupUniversity of AmsterdamSJ AmsterdamThe Netherlands
  3. 3.Department of PhilosophyUtrecht UniversityCS UtrechtThe Netherlands

Personalised recommendations