On the Power of Bounded Concurrency I: Finite Automata

@article{Drusinsky1994OnTP,
  title={On the Power of Bounded Concurrency I: Finite Automata},
  author={Doron Drusinsky and David Harel},
  journal={J. ACM},
  year={1994},
  volume={41},
  pages={517-539}
}
We investigate the descriptive succinctness of three fundamental notions for modeling concurrency: nondeterminism and pure parallelism, the two facets of alternation, and bounded cooperative concurrency, whereby a system configuration consists of a bounded number of cooperating states. Our results are couched in the general framework of finite-state automata, but hold for appropriate versions of most concurrent models of computation, such as Petri nets, statecharts or finite-state versions of… CONTINUE READING
Highly Cited
This paper has 145 citations. REVIEW CITATIONS
67 Citations
2 References
Similar Papers

Citations

Publications citing this paper.

145 Citations

01020'92'97'03'09'15
Citations per Year
Semantic Scholar estimates that this publication has 145 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.
Showing 1-2 of 2 references

Succinctness results for statecharts

  • T. HIRST
  • M. SC. dissertation. Bar-IIan Univ., Ramat Gan…
  • 1989
Highly Influential
9 Excerpts

Alternation

  • A. K. CHANDRA, L. J. STOCKMEYER
  • Proceedings of the 17th IEEE Symposzum on…
  • 1976
Highly Influential
11 Excerpts

Similar Papers

Loading similar papers…