Decidability Problems for Actor Systems - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2012

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.

Dates and versions

hal-00909366 , version 1 (26-11-2013)

Identifiers

Cite

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⟩

Collections

INRIA INRIA2
108 View
0 Download

Altmetric

Share

Gmail Facebook X LinkedIn More