Decidability Problems for Actor Systems
- Cite this paper as:
- de Boer F.S., Jaghoori M.M., Laneve C., Zavattaro G. (2012) Decidability Problems for Actor Systems. In: Koutny M., Ulidowski I. (eds) CONCUR 2012 – Concurrency Theory. CONCUR 2012. Lecture Notes in Computer Science, vol 7454. Springer, Berlin, Heidelberg
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.
Unable to display preview. Download preview PDF.