Affiliation:
1. Weizmann Institute of Science, Rehovot, Israel
Abstract
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 concurrent programming languages. We exhibit exhaustive sets of upper and lower bounds on the relative succinctness of these features over Σ
*
and Σ
ω
, establishing that:
For example, we prove exponential upper and lower bounds on the simulation of deterministic concurrent automata by AFAs, and triple-exponential bounds on the simulation of alternating concurrent automata by DFAs.
Publisher
Association for Computing Machinery (ACM)
Subject
Artificial Intelligence,Hardware and Architecture,Information Systems,Control and Systems Engineering,Software
Reference27 articles.
1. ~ARMONI R. 1991. On the succinctness gained by bounded cooperative concurrency. M.Sc ~dissertation. The Weizmann Institute of Science Rehovot Israel. ~ARMONI R. 1991. On the succinctness gained by bounded cooperative concurrency. M.Sc ~dissertation. The Weizmann Institute of Science Rehovot Israel.
2. Quasi-realtime languages;~BOOK R. V.;Math. Syst. Theory,1970
3. Alternation
4. Theories of automata on to-tapes: A simplified approach;~CHOUEKA Y.;J. Comput. Syst. ~Sci.,1974
Cited by
59 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. HyperATL*: A Logic for Hyperproperties in Multi-Agent Systems;Logical Methods in Computer Science;2023-05-31
2. Conceptual Design of BCI for Mobile Robot Control;Applied Sciences;2020-04-08
3. A Parametrized Analysis of Algorithms on Hierarchical Graphs;International Journal of Foundations of Computer Science;2019-09
4. Hierarchical Network Formation Games;Tools and Algorithms for the Construction and Analysis of Systems;2017
5. A Parametrized Analysis of Algorithms on Hierarchical Graphs;Descriptional Complexity of Formal Systems;2017