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.
Type de document :
Article dans une revue
Logical Methods in Computer Science, Logical Methods in Computer Science Association, 2014, 104, pp.1 - 29. 〈10.2168/LMCS-10(4:5)2014〉
Liste complète des métadonnées

Littérature citée [32 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/hal-01090952
Contributeur : Zavattaro Gianluigi <>
Soumis le : jeudi 4 décembre 2014 - 13:59:44
Dernière modification le : samedi 27 janvier 2018 - 01:32:17
Document(s) archivé(s) le : lundi 9 mars 2015 - 05:58:27

Fichier

LMCS2014.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

Collections

Citation

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

Partager

Métriques

Consultations de la notice

162

Téléchargements de fichiers

92