Distributed processes and location failures

DOI10.1016/S0304-3975(00)00326-1zbMath0989.68007MaRDI QIDQ5958774

Matthew C. B. Hennessy, James Riely

Publication date: 3 March 2002

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

distributed systemsbarbed congruenceprocess semanticssite failure

Mathematics Subject Classification ID

Distributed systems (68M14)

Related Items (15)

Abstractions for fault-tolerant global computing ⋮ Linear forwarders ⋮ A theory for observational fault tolerance ⋮ A model of actors and grey failures ⋮ A timed calculus for wireless systems ⋮ Network Applications of Graph Bisimulation ⋮ A theory of system behaviour in the presence of node and link failure ⋮ A calculus of quality for robustness against unreliable communication ⋮ Analysing input/output-capabilities of mobile processes with a generic type system ⋮ An object based algebra for specifying a fault tolerant software architecture ⋮ Bisimulations in the join-calculus ⋮ MAG\(\pi\): types for failure-prone communication ⋮ Safety versus Security in the Quality Calculus ⋮ The seal calculus ⋮ Extensionality of Spatial Observations in Distributed Systems

Uses Software

• STeP

Cites Work

• Interval logics and their decision procedures. I: An interval logic
• Symbolic bisimulations
• A calculus of mobile processes. II
• On bisimulations for the asynchronous \(\pi\)-calculus
• Lambda-calculi for (strict) parallel functions
• A theory of processes with localities
• A static view of localities
• Comparing locality and causality based equivalences
• Process Algebra
• OBSERVING DISTRIBUTION IN PROCESSES: STATIC AND DYNAMIC LOCALITIES
• A parametric approach to localities
• Proved trees
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Distributed processes and location failures