A model of actors and grey failures

DOI10.46298/LMCS-19(4:13)2023arXiv2210.17508MaRDI QIDQ6137831FDOQ6137831

Authors:

Publication date: 16 January 2024

Published in: Logical Methods in Computer Science (Search for Journal in Brave)

Abstract: 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.

Full work available at URL: https://arxiv.org/abs/2210.17508

Recommendations

• A hierarchy of failures-based models
• A foundation for actor computation
• Actors: A model for reasoning about open distributed systems
• scientific article; zbMATH DE number 4011913
• scientific article; zbMATH DE number 1860623

zbMATH Keywords

recoverybehavioural equivalenceasynchronous process calculusfail-stopactor systembarbed bisimulationfailure injectiongrey failure

Mathematics Subject Classification ID

Logic in computer science (03B70) Computer science (68-XX)

Cites Work

• Process algebra for synchronous communication
• Title not available (Why is that?)
• A calculus of mobile processes. I
• On Communicating Finite-State Machines
• A process algebra for timed systems
• The \(\pi\)-calculus: A theory of mobile processes
• Multiparty Asynchronous Session Types
• Global progress for dynamically interleaved multiparty sessions
• A calculus of mobile agents
• Barbed bisimulation
• Timed, Distributed, Probabilistic, Typed Processes
• The two-phase commitment protocol in an extended \(\pi\)-calculus
• Foundations of Software Science and Computational Structures
• Distributed processes and location failures
• On bisimulations for the asynchronous \(\pi\)-calculus
• A theory of system behaviour in the presence of node and link failure
• Trace and testing equivalence on asynchronous processes
• Title not available (Why is that?)
• Title not available (Why is that?)
• A modal characterization of observational congruence on finite terms of CCS
• Process algebras with localities.
• Simulation relations for fault-tolerance
• A theory for observational fault tolerance
• A theory of reversibility for Erlang
• Models, Languages, and Tools for Concurrent and Distributed Programming
• Session types for link failures
• Global escape in multiparty sessions
• Input urgent semantics for asynchronous timed session types
• Finding race conditions in Erlang with quickcheck and PULSE
• Distributed processes and location failures

This page was built for publication: A model of actors and grey failures

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6137831)