In this talk I will discuss a model of long-running transactions (LRT) within the framework of the CSP process algebra. Standard transactions deal with faults by preserving an all or nothing atomicity property. In the context of LRT, which involve the coordination and interaction of activities executed by multiple partners, atomicity is not preserved. In LRT, fault handling can be achieved by defining compensating actions for those actions that cannot be undone automatically. cCSP provides constructs for transaction coordination with support for compensation.