Pre-Orders for Fault Tolerance
We describe a process algebraic approach to the semantics of robust systems. We extend a subset of CCS  with multi-set prefixes to model systems with replicated synchronous majority voting. Based on an operational semantics, we define pre-orders which introduces a hierarchy of faulty processes and fault-tolerant processes. We then show how a similar ordering on modal- formulae  can characterise the fault pre-orders.
SubjectsFields of Research::280000 Information, Computing and Communication Sciences::280400 Computation Theory and Mathematics::280499 Computation theory and mathematics not elsewhere classified
- Engineering: Reports