A theory of system behaviour in the presence of node and link failure

DOI10.1016/J.IC.2007.12.002zbMath1152.68037OpenAlexW4210712301MaRDI QIDQ939442

Adrian Francalanza, Matthew C. B. Hennessy

Publication date: 22 August 2008

Published in: Information and Computation (Search for Journal in Brave)

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

zbMATH Keywords

bisimulationlabelled transition systemsdistributed calculinode and link failurereduction barbed congruence

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Global computing in a dynamic network of tuple spaces
• A framework for security analysis of mobile wireless networks
• 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
• Basic observables for a calculus for global computing
• A Distributed Pi-Calculus
• Unreliable failure detectors for reliable distributed systems
• Typed behavioural equivalences for processes in the presence of subtyping
• CONCUR 2004 - Concurrency Theory
• Automata, Languages and Programming
• A Fault Tolerance Bisimulation Proof for Consensus (Extended Abstract)
• CONCUR 2005 – Concurrency Theory
• Foundations of Software Science and Computation Structures
• CONCUR 2003 - Concurrency Theory
• Distributed processes and location failures
• A calculus of mobile agents

Related Items (8)

Network Conscious π-calculus: A Concurrent Semantics ⋮ ElixirST: a session-based type system for elixir modules ⋮ A model of actors and grey failures ⋮ A formal approach to open multiparty interactions ⋮ Counting the Cost in the Picalculus (Extended Abstract) ⋮ A network-conscious \(\pi\)-calculus and its coalgebraic semantics ⋮ Network-conscious \(\pi\)-calculus -- a model of Pastry ⋮ A survey of challenges for runtime verification from advanced application domains (beyond software)

Uses Software

• tKlaim

This page was built for publication: A theory of system behaviour in the presence of node and link failure