A model of actors and grey failures

DOI10.46298/LMCS-19(4:13)2023MaRDI QIDQ6137831zbMATH OpenFDO

Authors

Publication date 16 January 2024

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

Copyright license Creative Commons Attribution 4.0 International

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

zbMATH Keywords

recoverybehavioural equivalenceasynchronous process calculusfail-stopactor systembarbed bisimulationfailure injectiongrey failure

Mathematics Subject Classification ID

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

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.

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

Cites work

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

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)