Communicating sequential processes
Communicating sequential processes
Verification of multiprocess probabilistic protocols
Distributed Computing
Hierarchical correctness proofs for distributed algorithms
PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
Parallel program design: a foundation
Parallel program design: a foundation
Bisimulation through probabilistic testing (preliminary report)
POPL '89 Proceedings of the 16th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Fast randomized consensus using shared memory
Journal of Algorithms
Reasoning about probabilistic algorithms
PODC '90 Proceedings of the ninth annual ACM symposium on Principles of distributed computing
Process algebra
Proving probabilistic correctness statements: the case of Rabin's algorithm for mutual exclusion
PODC '92 Proceedings of the eleventh annual ACM symposium on Principles of distributed computing
Randomized mutual exclusion algorithms revisited
PODC '92 Proceedings of the eleventh annual ACM symposium on Principles of distributed computing
Proving time bounds for randomized distributed algorithms
PODC '94 Proceedings of the thirteenth annual ACM symposium on Principles of distributed computing
Reactive, generative, and stratified models of probabilistic processes
Information and Computation
Impossibility of distributed consensus with one faulty process
Journal of the ACM (JACM)
Forward and backward simulations I.: untimed systems
Information and Computation
Formal verification of timed properties of randomized distributed algorithms
Proceedings of the fourteenth annual ACM symposium on Principles of distributed computing
Uniform Dynamic Self-Stabilizing Leader Election
IEEE Transactions on Parallel and Distributed Systems
Formal verification of parallel programs
Communications of the ACM
Communication and Concurrency
Time and Probability in Formal Design of Distributed Systems
Time and Probability in Formal Design of Distributed Systems
POPL '81 Proceedings of the 8th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Probabilistic simulations for probabilistic processes
Nordic Journal of Computing
Testing Probabilistic and Nondeterministic Processes
Proceedings of the IFIP TC6/WG6.1 Twelth International Symposium on Protocol Specification, Testing and Verification XII
Testing Preorders for Probabilistic Processes
ICALP '92 Proceedings of the 19th International Colloquium on Automata, Languages and Programming
Testing Equivalences and Fully Abstract Models for Probabilistic Processes
CONCUR '90 Proceedings of the Theories of Concurrency: Unification and Extension
A Synchronous Calculus of Relative Frequency
CONCUR '90 Proceedings of the Theories of Concurrency: Unification and Extension
Compositional Verification of Probabilistic Processes
CONCUR '92 Proceedings of the Third International Conference on Concurrency Theory
Axiomization Probabilistic Processes: ACP with Generative Probabililties (Extended Abstract)
CONCUR '92 Proceedings of the Third International Conference on Concurrency Theory
Fully Abstract Characterizations of Testing Preorders for Probabilistic Processes
CONCUR '94 Proceedings of the Concurrency Theory
A Compositional Trace-Based Semantics for Probabilistic Automata
CONCUR '95 Proceedings of the 6th International Conference on Concurrency Theory
Concurrency and Automata on Infinite Sequences
Proceedings of the 5th GI-Conference on Theoretical Computer Science
Composition and Behaviors of Probabilistic I/O Automata
CONCUR '94 Proceedings of the Concurrency Theory
On the extremely fair treatment of probabilistic algorithms
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
Time Optimal Self-Stabilizing Spanning Tree Algorithms
Time Optimal Self-Stabilizing Spanning Tree Algorithms
Modeling and Verification of Randomized Distributed Real -Time Systems
Modeling and Verification of Randomized Distributed Real -Time Systems
Verification of the Randomized Consensus Algorithm of Aspnes and Herlihy: a Case Study
Verification of the Randomized Consensus Algorithm of Aspnes and Herlihy: a Case Study
Automatic verification of probabilistic concurrent finite state programs
SFCS '85 Proceedings of the 26th Annual Symposium on Foundations of Computer Science
| Hi-index | 0.01 |
We study compositionality issues for the analysis of randomized distributed algorithms. We identify three forms of compositionality that we call process compositionality, property compositionality, and feature compositionality. Process and property compositionality are widely known in the literature, while feature compositionality, although used extensively, does not appear to be emphasized as much. We show how feature compositionality is important for the analysis of randomized systems.