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 de ne a bisimulation semantics. As the bisimulation semantics does not characterise fault tolerance we de ne 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
Citations
|
2762
|
Communication and Concurrency
– Milner
- 1989
|
|
2677
|
Communicating Sequential Processes
– Hoare
- 1995
|
|
1064
|
A Structural Approach to Operational Semantics
– Plotkin
- 1981
|
|
541
|
Concurrency and automata on infinite sequences
– Park
- 1981
|
|
363
|
Algebraic Theory of Processes
– Hennessy
- 1988
|
|
252
|
Understanding fault-tolerant distributed systems
– Cristian
- 1991
|
|
183
|
The N-version Approach to Fault-Tolerant Software
– Avizienis
- 1985
|
|
49
|
Modal specifications
– Larsen
- 1989
|
|
46
|
Adding Action Refinement to a Finite Process Algebra
– Aceto, Hennessy
- 1994
|
|
38
|
A rigorous approach for fault-tolerant programming
– Cristian
- 1985
|
|
36
|
An Introduction to Modal and Temporal Logics for CCS
– Stirling
- 1989
|
|
33
|
and Branching Structures in the Semantics and Logics of Reactive Systems
– Linear
- 1985
|
|
30
|
Process Theory based on Bisimulation Semantics
– Bergstra, Klop
- 1988
|
|
22
|
Fully abstract models for a process language with re nement
– Nielsen, Engberg, et al.
- 1989
|
|
19
|
Concurrency and automata on in nite sequences
– Park
- 1981
|
|
16
|
A Context Dependent Equivalence Between Processes
– Larsen
- 1987
|
|
13
|
Fault Tolerant Parallel Processor
– Harper, Lala
- 1991
|
|
7
|
Distributed CCS
– Krishnan
- 1991
|
|
3
|
The N-version Approach toFault-Tolerant Software
– Avizienis
- 1985
|
|
3
|
A2CCS: A Simple Extension of CCS for Handling Atomic Actions
– Gorrieri, Marchetti, et al.
- 1988
|
|
3
|
Modal speci cations
– Larsen
- 1989
|
|
2
|
Resourceful Systems for Fault Tolerance, Reliability and Safety
– Abbot
- 1990
|
|
2
|
Adding Action Re nement to a Finite Process Algebra
– Aceto, Hennessy
- 1991
|
|
2
|
A Rigorous Approach toFault-Tolerant Programming
– Cristian
- 1985
|
|
2
|
Formalising Replicated Distributed Processing
– Koutny, Mancini, et al.
- 1991
|
|
2
|
A Semantics for Multiprocessor Systems
– Krishnan
- 1992
|
|
2
|
A Process Algebraic Approach to Fault-Tolerance
– Krishnan, McKenzie
- 1992
|
|
1
|
Pre-Orders for Fault-Tolerance
– Krishnan
- 1993
|
|
1
|
A Process Algebraic Approach toFault-Tolerance
– Krishnan, McKenzie
- 1992
|
