A theory for observational fault tolerance

DOI10.1016/j.jlap.2007.03.003zbMath1123.68080OpenAlexW1561550178MaRDI QIDQ2643332

Adrian Francalanza, Matthew C. B. Hennessy

Publication date: 23 August 2007

Published in: The Journal of Logic and Algebraic Programming (Search for Journal in Brave)

Full work available at URL: https://www.um.edu.mt/library/oar//handle/123456789/23264

zbMATH Keywords

fault tolerancebisimulationslabelled transition systemsdistributed calculiobervational equivalencesupto techniques

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Reliability, testing and fault tolerance of networks and computer systems (68M15)

Related Items

A theory for observational fault tolerance, ElixirST: a session-based type system for elixir modules, Simulation relations for fault-tolerance, A model of actors and grey failures, A survey of challenges for runtime verification from advanced application domains (beyond software), A Theory of Monitors, A theory of monitors, Safety versus Security in the Quality Calculus

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Confluence for process verification
• On reduction-based process semantics
• Resource access control in systems of mobile agents
• Towards a behavioural theory of access and mobility control in distributed systems
• A theory for observational fault tolerance
• On confluence in the π-calculus
• Typed behavioural equivalences for processes in the presence of subtyping
• Formal Techniques for Networked and Distributed Systems - FORTE 2005
• Advances in Computing Science – ASIAN 2003. Progamming Languages and Distributed Computation Programming Languages and Distributed Computation
• CONCUR 2005 – Concurrency Theory
• Distributed processes and location failures