A Thesis for Bounded Concurrency

Abstract In recent work, we have investigated the power of bounded cooperative concurrency. The underlying notion involves enriching computational devices with a bounded number of concurrent components that communicate, synchronize, or otherwise cooperate. Comparisons involving succinctness and the time complexity of reasoning about programs have been undertaken. The results, which are extremely robust, show that in all the cases we have addressed bounded cooperative concurrency is of inherent exponential power, regardless of whether nondeterminism and/or pure, unbounded parallelism are also present. In this expository paper we motivate the research and survey the main results.

Authors

• David Harel

Keywords

No keywords are indexed for this paper.