Decidability Problems for Actor Systems
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 ris...
Main Authors: | Frank De Boer, Mahdi Jaghoori, Cosimo Laneve, Gianluigi Zavattaro |
---|---|
Format: | Article |
Language: | English |
Published: |
Logical Methods in Computer Science e.V.
2014-12-01
|
Series: | Logical Methods in Computer Science |
Subjects: | |
Online Access: | https://lmcs.episciences.org/1091/pdf |
Similar Items
-
Decidability Results for the Boundedness Problem
by: Achim Blumensath, et al.
Published: (2014-08-01) -
Bounded Reachability Problems are Decidable in FIFO Machines
by: Benedikt Bollig, et al.
Published: (2022-01-01) -
Deciding Conditional Termination
by: Radu Iosif, et al.
Published: (2014-08-01) -
Decidability for Entailments of Symbolic Heaps with Arrays
by: Daisuke Kimura, et al.
Published: (2021-05-01) -
Deciding Equations in the Time Warp Algebra
by: Sam van Gool, et al.
Published: (2024-01-01)