Abstractions for fault-tolerant global computing
From MaRDI portal
Publication:1881258
DOI10.1016/J.TCS.2003.09.014zbMath1071.68010OpenAlexW2061229529MaRDI QIDQ1881258
Publication date: 4 October 2004
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2003.09.014
Network design and communication in computer systems (68M10) 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 (6)
Abstractions for fault-tolerant global computing ⋮ Distributed speculative execution for reliability and fault tolerance: an operational semantics ⋮ Event-Based Service Coordination ⋮ Causal-consistent rollback in a tuple-based language ⋮ cJoin: Join with communicating transactions ⋮ Controlling Reversibility in Higher-Order Pi
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Fault-tolerant distributed computing
- Detecting causal relationships in distributed computations: In search of the holy grail
- Partial order and contextual net semantics for atomic and locally atomic CC programs
- Mobile ambients
- Asynchronous process calculi: The first- and higher-order paradigms
- Trust and partial typing in open systems of mobile agents
- Decoding choice encodings
- Abstractions for fault-tolerant global computing
- The m-calculus
- Impossibility of distributed consensus with one faulty process
- Time, clocks, and the ordering of events in a distributed system
- The weakest failure detector for solving consensus
- The Two-Phase Commitment Protocol in an Extended π-Calculus
- A Distributed π-Calculus with Local Areas of Communication
- Generative communication in Linda
- Distributed processes and location failures
- A calculus of mobile agents
This page was built for publication: Abstractions for fault-tolerant global computing
