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.
Type de document :
Communication dans un congrès
CONCUR 2012 - 23rd International Conference on Concurrency Theory, Sep 2012, Newcastle, United Kingdom. Springer, Lecture Notes in Computer Science, 7454, pp.562-577, 2012, CONCUR 2012 – Concurrency Theory. 〈10.1007/978-3-642-32940-1_39〉
Liste complète des métadonnées

https://hal.inria.fr/hal-00909366
Contributeur : Davide Sangiogi <>
Soumis le : mardi 26 novembre 2013 - 11:07:28
Dernière modification le : lundi 12 mars 2018 - 13:09:08

Lien texte intégral

Identifiants

Collections

Citation

Frank S. 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. Springer, Lecture Notes in Computer Science, 7454, pp.562-577, 2012, CONCUR 2012 – Concurrency Theory. 〈10.1007/978-3-642-32940-1_39〉. 〈hal-00909366〉

Partager

Métriques

Consultations de la notice

158