Sciweavers

CONCUR
2012
Springer

Decidability Problems for Actor Systems

12 years 1 months ago
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 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.
Frank S. de Boer, Mahdi Mahdi Jaghoori, Cosimo Lan
Added 29 Sep 2012
Updated 29 Sep 2012
Type Journal
Year 2012
Where CONCUR
Authors Frank S. de Boer, Mahdi Mahdi Jaghoori, Cosimo Laneve, Gianluigi Zavattaro
Comments (0)