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.
Document type :
Journal articles
Complete list of metadatas

Cited literature [32 references]  Display  Hide  Download

https://hal.inria.fr/hal-01090952
Contributor : Zavattaro Gianluigi <>
Submitted on : Thursday, December 4, 2014 - 1:59:44 PM
Last modification on : Thursday, July 4, 2019 - 3:56:24 PM
Long-term archiving on : Monday, March 9, 2015 - 5:58:27 AM

File

LMCS2014.pdf
Files produced by the author(s)

Identifiers

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⟩

Share

Metrics

Record views

216

Files downloads

280