Abstract

We propose a generalisation of occurrence graphs as a formal model of computational structure. The model is used to define the "atomic occurrence" of a program, to characterise "interference freeness" between programs, and to model error recovery in a decentralized system.

Keywords

atomicity, interference, occurrence graph, error recovery