On the power of bounded concurrency I

Author:

Drusinsky Doron1,Harel David1

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

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3