On the power of bounded concurrency I: finite automata

  title={On the power of bounded concurrency I: finite automata},
  author={D. Drusinsky and D. Harel},
  journal={J. ACM},
  • D. Drusinsky, D. Harel
  • Published 1994
  • Computer Science
  • J. ACM
  • 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
    Weak alternating automata are not that weak
    • 159
    • Open Access
    Weak alternating automata are not that weak
    • 137
    • Open Access
    Weak alternating automata and tree automata emptiness
    • 122
    • Open Access
    Communicating Hierarchical State Machines
    • 116
    Extended Temporal Logic Revisited
    • 51
    • Open Access
    Model checking of hierarchical state machines
    • 172
    • Open Access
    Executable object modeling with statecharts
    • 624


    Publications referenced by this paper.
    A Calculus of Communicating Systems
    • 4,467
    • Highly Influential
    • Open Access
    • 1981
    On the complexity of co-automata
    • 1988
    Propositional dynamic logic with converse
    • 1982
    Succinctness results for statecharts
    • 1989