Pages that link to "Item:Q3646255"

The following pages link to A Reduction Theorem for the Verification of Round-Based Distributed Algorithms (Q3646255):

Displayed 13 items.

• Structural transformations for data-enriched real-time systems (Q493518) ‎ (← links)
• Verification of consensus algorithms using satisfiability solving (Q658669) ‎ (← links)
• An automata-theoretic approach to the verification of distributed algorithms (Q1706162) ‎ (← links)
• Guessing the buffer bound for k-synchronizability (Q2117668) ‎ (← links)
• On the \(k\)-synchronizability of systems (Q2200819) ‎ (← links)
• Eliminating message counters in synchronous threshold automata (Q2234072) ‎ (← links)
• A reduction theorem for randomized distributed algorithms under weak adversaries (Q2234073) ‎ (← links)
• The Heard-Of model: computing in distributed systems with benign faults (Q2377130) ‎ (← links)
• Characterizing Consensus in the Heard-Of Model (Q5089273) ‎ (← links)
• (Q5111454) ‎ (← links)
• (Q5875395) ‎ (← links)
• Survey on Parameterized Verification with Threshold Automata and the Byzantine Model Checker (Q5883751) ‎ (← links)
• Guessing the Buffer Bound for k-Synchronizability (Q6070755) ‎ (← links)