A Semantic Characterisation for Faults in Replicated Systems

Abstract We describe a process algebraic approach to the semantics of replicated systems. We extend a subset of CCS with a replication operator to model systems with replicated synchronous majority voting. Based on an operational semantics, we define a bisimulation semantics. As the bisimulation semantics does not characterise fault tolerance we define preorders, 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 preorders.

[1]  Padmanabhan Krishnan.  A Semantics for Multiprocessor Systems , 1992, ESOP.

[2]  P. Krishnan,et al.  Pre-Orders for Fault Tolerance , 1992 .

[3]  David Park,et al.  Concurrency and Automata on Infinite Sequences , 1981, Theoretical Computer Science.

[4]  Luigi V. Mancini,et al.  Formalising replicated distributed processing , 1991, [1991] Proceedings Tenth Symposium on Reliable Distributed Systems.

[5]  Flaviu Cristian,et al.  A Rigorous Approach to Fault-Tolerant Programming , 1985, IEEE Transactions on Software Engineering.

[6]  Luca Aceto,et al.  Adding Action Refinement to a Finite Process Algebra , 1991, Inf. Comput..

[7]  Algirdas Avizienis,et al.  The N-Version Approach to Fault-Tolerant Software , 1985, IEEE Transactions on Software Engineering.

[8]  Roberto Gorrieri,et al.  A²CCS: A Simple Extension of CCS for Handling Atomic Actions , 1988, CAAP.

[9]  C. A. R. Hoare,et al.  Communicating sequential processes , 1978, CACM.

[10]  Jan A. Bergstra,et al.  Process theory based on bisimulation semantics , 1988, REX Workshop.

[11]  P. Krishnan,et al.  A Process Algebraic Approach to Fault-Tolerance , 1992 .

[12]  Russ Abbott,et al.  Resourceful systems for fault tolerance, reliability, and safety , 1990, CSUR.

[13]  Kim G. Larsen.  A Context Dependent Equivalence Between Processes , 1987, Theor. Comput. Sci..

[14]  Amir Pnueli,et al.  Linear and Branching Structures in the Semantics and Logics of Reactive Systems , 1985, ICALP.

[15]  Kim S. Larsen,et al.  Fully abstract models for a process language with refinement , 1988, REX Workshop.

[16]  Colin Stirling,et al.  An Introduction to Modal and Temporal Logics for CCS , 1991, Concurrency: Theory, Language, And Architecture.

[17]  Kim G. Larsen,et al.  Modal Specifications , 1989, Automatic Verification Methods for Finite State Systems.

[18]  Jaynarayan H. Lala,et al.  FAULT-TOLERANT PARALLEL PROCESSOR , 1991 .

[19]  Robin Milner,et al.  Communication and concurrency , 1989, PHI Series in computer science.

[20]  Luca Aceto,et al.  Adding Action Refinement to a Finite Process Algebra , 1994, Inf. Comput..

[21]  Padmanabhan Krishnan,et al.  Distributed CCS , 1991, CONCUR.

[22]  Flaviu Cristian,et al.  Understanding fault-tolerant distributed systems , 1991, CACM.

[23]  Matthew Hennessy,et al.  Algebraic theory of processes , 1988, MIT Press series in the foundations of computing.