IEEE Transactions on Software Engineering
Modeling and verification of randomized distributed real-time systems
Modeling and verification of randomized distributed real-time systems
Uniform and Self-Stabilizing Token Rings Allowing Unfair Daemon
IEEE Transactions on Parallel and Distributed Systems
Memory space requirements for self-stabilizing leader election protocols
Proceedings of the eighteenth annual ACM symposium on Principles of distributed computing
Self-Stabilizing Local Mutual Exclusion and Daemon Refinement
DISC '00 Proceedings of the 14th International Conference on Distributed Computing
A Space Optimal, Deterministic, Self-Stabilizing, Leader Election Algorithm for Unidirectional Rings
DISC '01 Proceedings of the 15th International Conference on Distributed Computing
Probabilistic Simulations for Probabilistic Processes
CONCUR '94 Proceedings of the Concurrency Theory
ICDCS '99 Workshop on Self-stabilizing Systems
Parallel composition of stabilizing algorithms
ICDCS '99 Workshop on Self-stabilizing Systems
Composition and Behaviors of Probabilistic I/O Automata
CONCUR '94 Proceedings of the Concurrency Theory
A Space Optimal, Deterministic, Self-Stabilizing, Leader Election Algorithm for Unidirectional Rings
DISC '01 Proceedings of the 15th International Conference on Distributed Computing
Observing locally self-stabilization
Journal of High Speed Networks - Self-Stabilizing Systems, Part 1
Timer-based composition of fault-containing self-stabilizing protocols
Information Sciences: an International Journal
SSS'06 Proceedings of the 8th international conference on Stabilization, safety, and security of distributed systems
Self-stabilizing atomicity refinement allowing neighborhood concurrency
SSS'03 Proceedings of the 6th international conference on Self-stabilizing systems
The truth system: can a system of lying processes stabilize?
SSS'07 Proceedings of the 9h international conference on Stabilization, safety, and security of distributed systems
A tranformational approach for designing scheduler-oblivious self-stabilizing algorithms
SSS'10 Proceedings of the 12th international conference on Stabilization, safety, and security of distributed systems
Proceedings of the 4th International Workshop on Theoretical Aspects of Dynamic Distributed Systems
| Hi-index | 0.00 |
We study a special type of self-stabilizing algorithms composition : the cross-over composition (A B). The cross-over composition is the generalization of the algorithm compiler idea introduced in [3]. The cross-over composition could be seen as a black box with two entries and one exit. The composition goal is to improve the qualities of the first algorithm A, using as medium the second algorithm B. Informally, the obtained algorithm is A after the transfer of B's properties.Here, we provide a complete analysis of the composition, when the algorithms (A and B) are deterministic and/or probabilistic algorithms. Moreover, we show that the cross-over composition is a powerful tool in order to enforce a scheduler to have a fair behavior regarding to A.