Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

8

CONCUR
1997
Springer

favoriteEmaildiscussreport

98views Distributed And Parallel Com...» more CONCUR 1997»

Bounded Stacks, Bags and Queues

13 years 8 months ago

Bounded Stacks, Bags and Queues

Download basics.sjtu.edu.cn

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 , or abstraction.

Jos C. M. Baeten, Jan A. Bergstra

Real-time Traffic

Bounded Queue | Bounded Stack | CONCUR 1997 | Distributed And Parallel Computing | Parallel Composition Operator |

claim paper

Related Content

» Layouts of Graph Subdivisions

» Linear Lower Bounds on RealWorld Implementations of Concurrent Objects

» Time and Space Lower Bounds for Implementations Using kCAS

» On the inherent weakness of conditional primitives

» Reachability Analysis of Communicating Pushdown Systems

» Cacheoblivious shortest paths in graphs using buffer heap

» A Type System for Bounded Space and Functional InPlace Update

» Reachability Analysis for Some Models of InfiniteState Transition Systems

» Solovalency and the cost of coordination

Post Info
More Details (n/a)

Added	07 Aug 2010
Updated	07 Aug 2010
Type	Conference
Year	1997
Where	CONCUR
Authors	Jos C. M. Baeten, Jan A. Bergstra

Comments (0)