Laura Bocchi ; Julien Lange ; Simon Thompson ; A. Laura Voinea - A model of actors and grey failures

lmcs:10238 - Logical Methods in Computer Science, November 22, 2023, Volume 19, Issue 4 - https://doi.org/10.46298/lmcs-19(4:13)2023
A model of actors and grey failuresArticle

Authors: Laura Bocchi ; Julien Lange ORCID; Simon Thompson ; A. Laura Voinea

    Existing models for the analysis of concurrent processes tend to focus on fail-stop failures, where processes are either working or permanently stopped, and their state (working/stopped) is known. In fact, systems are often affected by grey failures: failures that are latent, possibly transient, and may affect the system in subtle ways that later lead to major issues (such as crashes, limited availability, overload). We introduce a model of actor-based systems with grey failures, based on two interlinked layers: an actor model, given as an asynchronous process calculus with discrete time, and a failure model that represents failure patterns to inject in the system. Our failure model captures not only fail-stop node and link failures, but also grey failures (e.g., partial, transient). We give a behavioural equivalence relation based on weak barbed bisimulation to compare systems on the basis of their ability to recover from failures, and on this basis we define some desirable properties of reliable systems. By doing so, we reduce the problem of checking reliability properties of systems to the problem of checking bisimulation.


    Volume: Volume 19, Issue 4
    Published on: November 22, 2023
    Accepted on: August 2, 2023
    Submitted on: November 1, 2022
    Keywords: Computer Science - Formal Languages and Automata Theory
    Funding:
      Source : OpenAIRE Graph
    • Session Types for Reliable Distributed Systems (STARDUST); Funder: UK Research and Innovation; Code: EP/T014512/1
    • Behavioural Application Program Interfaces; Funder: European Commission; Code: 778233

    Classifications

    Consultation statistics

    This page has been seen 1449 times.
    This article's PDF has been downloaded 387 times.