Formal verification of timed properties of randomized distributed algorithms
From MaRDI portal
Cited in
(24)- A framework to measure the robustness of programs in the unpredictable environment
- Computing probabilistic bisimilarity distances for probabilistic automata
- Probabilistic divide \& congruence: branching bisimilarity
- Efficient and modular coalgebraic partition refinement
- Quantitative Kleene coalgebras
- Testing probabilistic automata
- Verification of the randomized consensus algorithm of Aspnes and Herlihy: a case study
- A coalgebraic take on regular and \(\omega\)-regular behaviour for systems with internal moves
- Termination in convex sets of distributions
- SOS specifications for uniformly continuous operators
- scientific article; zbMATH DE number 7204940 (Why is no real title available?)
- Compositional verification of randomized distributed algorithms
- Probabilistic -calculus and event structures
- scientific article; zbMATH DE number 7649917 (Why is no real title available?)
- Using probabilistic Kleene algebra pKA for protocol verification
- Randomized self-stabilizing and space optimal leader election under arbitrary scheduler on rings
- Randomized dining philosophers without fairness assumption
- Causal Unfoldings
- Deciding probabilistic bisimilarity distance one for probabilistic automata
- scientific article; zbMATH DE number 7447772 (Why is no real title available?)
- Compositional weak metrics for group key update
- Efficient Coalgebraic Partition Refinement
- Distribution bisimilarity via the power of convex algebras
- Certified impossibility results and analyses in Coq of some randomised distributed algorithms
This page was built for publication: Formal verification of timed properties of randomized distributed algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5361452)
