Decidability Problems for Actor Systems

Boer, Frank de; Jaghoori, Mohammad Mahdi; Laneve, Cosimo; Zavattaro, Gianluigi

doi:10.2168/lmcs-10(4:5)2014

Cited by 3 publications

(4 citation statements)

References 28 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We further introduced the GAC language which features guarded command statements [4] as statements for describing the method bodies in ABS. The standard semantics of guarded statements is extended in ABS to their semantics as suspended processes.…”

Section: Discussionmentioning

confidence: 99%

“…In Figure 5 we introduce so-called guarded command statements (following [4]) as statements for describing the method bodies in ABS. The semantics of the statement □ n i=1 д i → S i consists of a non-deterministic selection of one of the statements S i for which the associated guard д i is enabled.…”

Section: The Gac Languagementioning

confidence: 99%

“…In this paper we investigate the expressive power of cooperative scheduling in ABS. We show that the powerful abstraction of cooperative scheduling in ABS can in fact be modeled by a run to completion model GAC (Guarded ACtor) of active objects which features a guarded-command language ( [4]) for the description of the method bodies. The formal translation of ABS into GAC is given by an intermediate language ABS-SPAWN which uses an explicit spawn operation to model the execution of await statements.…”

mentioning

confidence: 99%

See 2 more Smart Citations

On the nature of cooperative scheduling in active objects

Serbanescu

Boer

2020

Proceedings of the 35th Annual ACM Symposium on Applied Computing

Self Cite

View full text Add to dashboard Cite

Active objects interact via asynchronous messages which specify method invocations. In contrast to the run to completion mode of method execution, mechanisms for suspending the execution of a method allow an active object to schedule cooperatively its methods in a co-routine manner. In this paper, we show how cooperative scheduling can be reduced to a run to completion mode of execution. We do so by a formal translation using a guarded command language for describing the execution of method bodies.

show abstract

Section: Discussionmentioning

confidence: 99%

Section: The Gac Languagementioning

confidence: 99%

mentioning

confidence: 99%

See 1 more Smart Citation

On the nature of cooperative scheduling in active objects

Serbanescu

Boer

2020

Proceedings of the 35th Annual ACM Symposium on Applied Computing

Self Cite

View full text Add to dashboard Cite

show abstract

“…Although there are some works on verification of timed actors [8,11], the lack of efficient model checking algorithm has limited the use of model checking for verification of timed actors.…”

Section: Introductionmentioning

confidence: 99%

Efficient TCTL Model Checking Algorithm for Timed Actors

Khamespanah

Khosravi

Sirjani

2014

Proceedings of the 4th International Workshop on Programming Based on Actors Agents &Amp; Decentralized Control

View full text Add to dashboard Cite

Non-Polynomial time complexity of model checking algorithms for TCTL properties in dense time is one of the obstacles against using model checking for timed systems. Alternatively, polynomial time algorithms are suggested for model checking discrete time models presented as Duration Time Graphs (DTG) versus a subset of TCTL formula (TCTL ≤,≥ ). While TCTL ≤,≥ can be model checked in polynomial time, the problem of model checking for exact time condition (TCTL = ) is an NP-Hard problem unless certain conditions hold. In this work we tackle model checking of timed actors using DTG. At the first step, we propose a reduction technique by folding all the instantaneous transitions, resulting folded timed transition system (FTS). At the second step, we show how the FTS of timed actors with discrete time can be mapped to a DTG. Then, we show when the necessary conditions hold for the FTS of timed actors and hence there is an O(|S| 2 · Φ) algorithm for model checking of complete TCTL properties (including TCTL ≤,≥ and TCTL = ) which have small constant time quantifiers. We use a set of case studies to illustrate the impact of using this technique in different application domains.

show abstract

Actors may synchronize, safely!

Giachino

Henrio

Laneve

et al. 2016

Proceedings of the 18th International Symposium on Principles and Practice of Declarative Programming

Self Cite

View full text Add to dashboard Cite

We study deadlock detection in an actor model with wait-bynecessity synchronizations, a lightweight technique that synchronizes invocations when the corresponding values are strictly needed. This approach relies on the use of futures that are not given an explicit "Future" type. The approach we adopt allow the implicit synchronization on the availability of some value (where the producer of the value might be decided at runtime), whereas previous work allowed only explicit synchronization on the termination of a well-identified request. This way we are able to analyse the dataflow synchronization inherent to languages that feature wait-bynecessity. We provide a type-system and a solver inferring the type of a program so that deadlocks can be identified statically. As a consequence we can automatically verify the absence of deadlocks in actor programs with wait-by-necessity synchronizations.

show abstract

Decidability Problems for Actor Systems

Cited by 3 publications

References 28 publications

On the nature of cooperative scheduling in active objects

On the nature of cooperative scheduling in active objects

Efficient TCTL Model Checking Algorithm for Timed Actors

Actors may synchronize, safely!

Contact Info

Product

Resources

About