Frank De Boer ; Mahdi Jaghoori ; Cosimo Laneve ; Gianluigi Zavattaro - Decidability Problems for Actor Systems

lmcs:1091 - Logical Methods in Computer Science, December 4, 2014, Volume 10, Issue 4 - https://doi.org/10.2168/LMCS-10(4:5)2014
Decidability Problems for Actor SystemsArticle

Authors: Frank De Boer ; Mahdi Jaghoori ; Cosimo Laneve ORCID; Gianluigi Zavattaro

    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.


    Volume: Volume 10, Issue 4
    Published on: December 4, 2014
    Imported on: June 28, 2013
    Keywords: Computer Science - Programming Languages,Computer Science - Logic in Computer Science
    Funding:
      Source : OpenAIRE Graph
    • Engineering Virtualized Services; Funder: European Commission; Code: 610582
    • Highly Adaptable and Trustworthy Software using Formal Models; Funder: European Commission; Code: 231620

    2 Documents citing this article

    Consultation statistics

    This page has been seen 1117 times.
    This article's PDF has been downloaded 363 times.