# On the power of bounded concurrency I: finite automata

@article{Drusinsky1994OnTP, title={On the power of bounded concurrency I: finite automata}, author={D. Drusinsky and D. 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

111 Citations

Is your model checker on time? On the complexity of model checking for timed modal logics

- Computer Science
- 2002

- 50
- Open Access

#### References

##### Publications referenced by this paper.

SHOWING 1-5 OF 5 REFERENCES

A Calculus of Communicating Systems

- Mathematics, Computer Science
- 1980

- 4,467
- Highly Influential
- Open Access

Alternation

- 1981

On the complexity of co-automata

- 1988

Propositional dynamic logic with converse

- 1982

Succinctness results for statecharts

- 1989