Diversity and Adjudication
This work addresses a foundational issue in fault-tolerant computing, but it appears incremental as it builds on existing axiomatic approaches without introducing a new paradigm.
The paper tackles the problem of adjudication in diversity-based systems, where multiple implementations are run in parallel for dependability, by defining and exploring properties of adjudication operators to determine a single result from varied outcomes.
This paper takes an axiomatic and calculational view of diversity (or "N-version programming"), where multiple implementations of the same specification are executed in parallel to increase dependability. The central notion is "adjudication": once we have multiple, potential different, outcomes, how do we come to a single result? Adjudication operators are explicitly defined and some general properties for these explored.