Decidability Problems for Actor Systems - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Logical Methods in Computer Science Year : 2014

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 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.
Fichier principal
Vignette du fichier
LMCS2014.pdf (294.13 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01090952 , version 1 (04-12-2014)

Identifiers

Cite

F. de Boer, Mohammad Mahdi Jaghoori, Cosimo Laneve, Gianluigi Zavattaro. Decidability Problems for Actor Systems. Logical Methods in Computer Science, 2014, 104, pp.1 - 29. ⟨10.2168/LMCS-10(4:5)2014⟩. ⟨hal-01090952⟩

Collections

INRIA INRIA2
104 View
105 Download

Altmetric

Share

Gmail Facebook X LinkedIn More