Skip to Main content Skip to Navigation
New interface
Conference papers

Decidability Problems for Actor Systems

Abstract : We introduce a nominal actor-based language and study its expressive power. We have identified the presence/absence of fields as a relevant 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. Such decidability result holds in actors with states when the number of actors is finite and the state is read-only.
Document type :
Conference papers
Complete list of metadata
Contributor : Davide Sangiogi Connect in order to contact the contributor
Submitted on : Tuesday, November 26, 2013 - 11:07:28 AM
Last modification on : Wednesday, February 2, 2022 - 3:56:16 PM

Links full text




Frank S. De Boer, Mohammad Mahdi Jaghoori, Cosimo Laneve, Gianluigi Zavattaro. Decidability Problems for Actor Systems. CONCUR 2012 - 23rd International Conference on Concurrency Theory, Sep 2012, Newcastle, United Kingdom. pp.562-577, ⟨10.1007/978-3-642-32940-1_39⟩. ⟨hal-00909366⟩



Record views