Communicating sequential processes
Communicating sequential processes
Atomic actions for fault-tolerance using CSP
IEEE Transactions on Software Engineering
Design of reliable software in distributed systems using the conversation scheme
IEEE Transactions on Software Engineering - Special issue on reliability and safety in real-time process control
Fault-Tolerant SoFtware Reliability Modeling
IEEE Transactions on Software Engineering
A timed model for communicating sequential processes
Theoretical Computer Science - Thirteenth International Colloquim on Automata, Languages and Programming, Renne
The use of GMB in the design of robust software for distributed systems
Software Engineering Journal
Performance Impacts of Look-Ahead Execution in the Conversation Scheme
IEEE Transactions on Computers
Guardians and Actions: Linguistic Support for Robust, Distributed Programs
ACM Transactions on Programming Languages and Systems (TOPLAS)
Petri Net Theory and the Modeling of Systems
Petri Net Theory and the Modeling of Systems
Fault Tolerance: Principles and Practice
Fault Tolerance: Principles and Practice
IEEE Transactions on Software Engineering
Duplex method for mobile communication systems
MSN'05 Proceedings of the First international conference on Mobile Ad-hoc and Sensor Networks
Hi-index | 0.00 |
Limiting the extent of error propagation when faults occur and localizing the subsequent error recovery are common concerns in the design of fault tolerant parallel processing systems. Both activities are made easier if the designer associates fault tolerance mechanisms with the underlying atomic actions of the system. With this in mind, this paper has investigated two methods for the identification of atomic actions in parallel processing systems described using CSP. Explicit trace evaluation forms the basis of the first algorithm, which enables a designer to analyze interprocess communications and thereby locate atomic action boundaries in a hierarchical fashion. The second method takes CSP descriptions of the parallel processes and uses structural arguments to infer the atomic action boundaries. This method avoids the difficulties involved with producing full trace sets, but does incur the penalty of a more complex algorithm.