Actor系统的可判定性问题
Decidability Problems for Actor Systems
摘要:
我们介绍了一个名义上的演员为基础的语言,并研究其表达能力。我们已经将域的存在/不存在确定为一个关键的功能:动态地创建与域相结合的名称,从而产生图灵完备性。另一方面,对无国籍行为者的限制导致了诸如终止之类的属性是可判定的系统。当参与者的数量是有界的并且状态是只读的时,这个可判定性结果仍然适用于具有状态的参与者。
英文摘要:
We introduce a nominal actor-based language and study its expressive power. We have identified the presence/absence of fields as a crucial feature: the dynamic creation of names in combination with fields gives rise to Turing completeness. On the other hand, restricting to stateless actors gives rise to systems for which properties such as termination are decidable. This decidability result still holds for actors with states when the number of actors is bounded and the state is read-only.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。