On the public citation graph
Verification of the randomized consensus algorithm of Aspnes and Herlihy: a case study
0 signed · 89 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1006/inco.1995.1134openalex-snapshot
Forward and Backward Simulations
inferredcites →https://doi.org/10.1006/inco.1997.2671openalex-snapshot
Liveness in Timed and Untimed Systems
inferredcites →https://doi.org/10.1006/jagm.1993.1022openalex-snapshot
Time- and Space-Efficient Randomized Consensus
inferredcites →https://doi.org/10.1007/3-540-57529-4_72openalex-snapshot
Time optimal self-stabilizing spanning tree algorithms
inferredcites →https://doi.org/10.1007/3-540-58201-0_66openalex-snapshot
Liveness in timed and untimed systems
inferredcites →https://doi.org/10.1007/3-540-61440-0_164openalex-snapshot
Efficient asynchronous consensus with the value-oblivious adversary scheduler
inferredcites →https://doi.org/10.1007/bf01843570openalex-snapshot
Verification of multiprocess probabilistic protocols
inferredcites →https://doi.org/10.1007/bfb0022443openalex-snapshot
Randomized consensus in expected O(n2log n) operations
inferredcites →https://doi.org/10.1016/0196-6774(90)90021-6openalex-snapshot
Fast randomized consensus using shared memory
inferredcites →https://doi.org/10.1109/32.387472openalex-snapshot
Analyzing expected time by scheduler-luck games
inferredcites →https://doi.org/10.1109/sfcs.1985.12openalex-snapshot
Automatic verification of probabilistic concurrent finite state programs
inferredcites →https://doi.org/10.1137/s0097539792240881openalex-snapshot
Randomized Consensus in Expected $O(N\log ^2 N)$ Operations Per Processor
inferredcites →https://doi.org/10.1145/197917.198117openalex-snapshot
Proving time bounds for randomized distributed algorithms
inferredcites →https://doi.org/10.1145/2166.357214openalex-snapshot
Termination of Probabilistic Concurrent Program
inferredcites →https://doi.org/10.1145/224964.224984openalex-snapshot
Formal verification of timed properties of randomized distributed algorithms
inferredcites →https://doi.org/10.1145/229542.229547openalex-snapshot
Probabilistic predicate transformers
inferredcites →https://doi.org/10.1145/248052.248083openalex-snapshot
Polylog randomized wait-free consensus
inferredcites →https://doi.org/10.1145/259380.259441openalex-snapshot
Efficient asynchronous consensus with the weak adversary scheduler
inferredcites →https://doi.org/10.1145/3149.214121openalex-snapshot
Impossibility of distributed consensus with one faulty process
inferredcites →https://doi.org/10.1145/41840.41852openalex-snapshot
Hierarchical correctness proofs for distributed algorithms
inferredcites →https://doi.org/10.1145/567532.567547openalex-snapshot
On the andvantages of free choice
inferredcites →https://doi.org/10.1145/62546.62594openalex-snapshot
On achieving consensus using a shared memory
inferredcites →https://doi.org/10.1145/72981.73001openalex-snapshot
Bounded polynomial randomized consensus
inferredcites →https://doi.org/10.21236/ada461346openalex-snapshot
Model Checking of Probabilistic and Nondeterministic Systems
inferredcites →https://doi.org/10.2307/2980979openalex-snapshot
An Introduction to Probability Theory and its Applications.
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/cpe.4973openalex-snapshot
Performance analysis of Israeli‐Jalfon's algorithm using probabilistic model checking
inferred← citeshttps://doi.org/10.1006/jcss.1999.1683openalex-snapshot
Deciding Bisimilarity and Similarity for Probabilistic Processes
inferred← citeshttps://doi.org/10.1007/11601548_17openalex-snapshot
Compositional Reasoning for Probabilistic Finite-State Behaviors
inferred← citeshttps://doi.org/10.1007/11817949_5openalex-snapshot
Probability and Nondeterminism in Operational Models of Concurrency
inferred← citeshttps://doi.org/10.1007/3-540-36135-9_13openalex-snapshot
Verifying Randomized Byzantine Agreement_
inferred← citeshttps://doi.org/10.1007/3-540-40026-5_9openalex-snapshot
On the Importance of Having an Identity or, is Consensus really Universal?
inferred← citeshttps://doi.org/10.1007/3-540-44585-4_17openalex-snapshot
Automated Verification of a Randomized Distributed Consensus Protocol Using Cadence SMV and PRISM?
inferred← citeshttps://doi.org/10.1007/3-540-44667-2_6openalex-snapshot
Verification of Randomized Distributed Algorithms
inferred← citeshttps://doi.org/10.1007/3-540-44681-8_67openalex-snapshot
Self-stabilizing Neighborhood Unique Naming under Unfair Scheduler
inferred← citeshttps://doi.org/10.1007/3-540-44804-7_5openalex-snapshot
Coin Lemmas with Random Variables
inferred← citeshttps://doi.org/10.1007/978-3-030-71995-1_22openalex-snapshot
Simple Stochastic Games with Almost-Sure Energy-Parity Objectives are in NP and coNP
inferred← citeshttps://doi.org/10.1007/978-3-319-08867-9_31openalex-snapshot
CEGAR for Qualitative Analysis of Probabilistic Systems
inferred← citeshttps://doi.org/10.1007/978-3-540-24611-4_11openalex-snapshot
Analysing Randomized Distributed Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-540-31862-0_35openalex-snapshot
Switched Probabilistic I/O Automata
inferred← citeshttps://doi.org/10.1007/978-3-540-45187-7_14openalex-snapshot
Compositionality for Probabilistic Automata
inferred← citeshttps://doi.org/10.1007/978-3-540-45187-7_26openalex-snapshot
Modeling Consensus in a Process Calculus
inferred← citeshttps://doi.org/10.1007/978-3-540-49823-0_6openalex-snapshot
All k-Bounded Policies Are Equivalent for Self-stabilization
inferred← citeshttps://doi.org/10.1007/978-3-642-12002-2_3openalex-snapshot
Assume-Guarantee Verification for Probabilistic Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-22110-1_21openalex-snapshot
Symbolic Algorithms for Qualitative Analysis of Markov Decision Processes with Büchi Objectives
inferred← citeshttps://doi.org/10.1007/978-3-642-39799-8_36openalex-snapshot
Faster Algorithms for Markov Decision Processes with Low Treewidth
inferred← citeshttps://doi.org/10.1007/s00165-012-0231-xopenalex-snapshot
Layered reasoning for randomized distributed algorithms
inferred← citeshttps://doi.org/10.1007/s00236-007-0052-1openalex-snapshot
Distributed Consensus, revisited
inferred← citeshttps://doi.org/10.1007/s00446-005-0121-zopenalex-snapshot
On the importance of having an identity or, is consensus really universal?
inferred← citeshttps://doi.org/10.1007/s10626-007-0032-1openalex-snapshot
Analyzing Security Protocols Using Time-Bounded Task-PIOAs
inferred← citeshttps://doi.org/10.1007/s10703-012-0180-2openalex-snapshot
Symbolic algorithms for qualitative analysis of Markov decision processes with Büchi objectives
inferred← citeshttps://doi.org/10.1007/s10703-015-0235-2openalex-snapshot
CEGAR for compositional analysis of qualitative properties in Markov decision processes
inferred← citeshttps://doi.org/10.1016/j.artint.2014.12.009openalex-snapshot
POMDPs under probabilistic semantics
inferred← citeshttps://doi.org/10.1016/j.ic.2013.10.001openalex-snapshot
Compositional probabilistic verification through multi-objective model checking
inferred← citeshttps://doi.org/10.1016/j.ic.2015.03.009openalex-snapshot
Qualitative analysis of concurrent mean-payoff games
inferred← citeshttps://doi.org/10.1016/j.jcss.2016.02.009openalex-snapshot
What is decidable about partially observable Markov decision processes with ω-regular objectives
inferred← citeshttps://doi.org/10.1016/j.jcss.2017.09.007openalex-snapshot
Task-structured probabilistic I/O automata
inferred← citeshttps://doi.org/10.1016/j.jcss.2018.09.004openalex-snapshot
The complexity of synchronizing Markov decision processes
inferred← citeshttps://doi.org/10.1016/j.tcs.2006.07.033openalex-snapshot
Switched PIOA: Parallel composition via distributed scheduling
inferred← citeshttps://doi.org/10.1016/j.tcs.2015.01.050openalex-snapshot
Average case analysis of the classical algorithm for Markov decision processes with Büchi objectives
inferred← citeshttps://doi.org/10.1093/comjnl/47.3.289openalex-snapshot
Self-Stabilizing Mutual Exclusion Under Arbitrary Scheduler
inferred← citeshttps://doi.org/10.1109/dese.2010.29openalex-snapshot
Key Issues Concerning the Simultaneous Development of Technical and Linguistic Competences in a Single E-module
inferred← citeshttps://doi.org/10.1109/dsn.2007.22openalex-snapshot
Automatic Verification and Discovery of Byzantine Consensus Protocols
inferred← citeshttps://doi.org/10.1109/dsn.2007.96openalex-snapshot
Uniformity by Construction in the Analysis of Nondeterministic Stochastic Systems
inferred← citeshttps://doi.org/10.1109/icdcs.2007.95openalex-snapshot
Conflict Managers for Self-stabilization without Fairness Assumption
inferred← citeshttps://doi.org/10.1109/icdsc.2001.918936openalex-snapshot
Tight space self-stabilizing uniform l-mutual exclusion
inferred← citeshttps://doi.org/10.1109/icsp58490.2023.10248467openalex-snapshot
Research on High throughput Consensus Algorithm of Energy Blockchain based on Recurrent Neural Network Node Integrity Prediction
inferred← citeshttps://doi.org/10.1109/qest.2007.15openalex-snapshot
Qualitative Logics and Equivalences for Probabilistic Systems
inferred← citeshttps://doi.org/10.1109/qest.2010.24openalex-snapshot
Compositional Verification of Probabilistic Systems Using Learning
inferred← citeshttps://doi.org/10.1109/srds.2007.20openalex-snapshot
Model Checking of Consensus Algorit
inferred← citeshttps://doi.org/10.1109/wodes.2006.1678432openalex-snapshot
Task-Structured Probabilistic I/O Automata
inferred← citeshttps://doi.org/10.1137/1.9781611973082.101openalex-snapshot
Faster and Dynamic Algorithms For Maximal End-Component Decomposition And Related Graph Problems In Probabilistic Verification
inferred← citeshttps://doi.org/10.1137/s0097539704446487openalex-snapshot
Observing Branching Structure through Probabilistic Contexts
inferred← citeshttps://doi.org/10.1145/1314690.1314693openalex-snapshot
A testing scenario for probabilistic processes
inferred← citeshttps://doi.org/10.1145/2597631openalex-snapshot
Efficient and Dynamic Algorithms for Alternating Büchi Games and Maximal End-Component Decomposition
inferred← citeshttps://doi.org/10.1145/3776691openalex-snapshot
Verifying Almost-Sure Termination for Randomized Distributed Algorithms
inferred← citeshttps://doi.org/10.1145/3808293openalex-snapshot
SureDistrib: Verifying Almost-Sure Termination of Composite Asynchronous Byzantine Protocols
inferred← citeshttps://doi.org/10.1609/aaai.v30i1.10422openalex-snapshot
A Symbolic SAT-Based Algorithm for Almost-Sure Reachability with Small Strategies in POMDPs
inferred← citeshttps://doi.org/10.2168/lmcs-5(2:7)2009openalex-snapshot
Qualitative Logics and Equivalences for Probabilistic Systems
inferred← citeshttps://doi.org/10.26226/morressier.604907f41a80aac83ca25cc1openalex-snapshot
Simple Stochastic Games with Almost-Sure Energy-Parity Objectives are in NP and coNP
inferred← citeshttps://doi.org/10.3390/en14217216openalex-snapshot
Real-Time Bidding Model of Cryptocurrency Energy Trading Platform
inferred← citeshttps://doi.org/10.4230/lipics.fsttcs.2012.460openalex-snapshot
Average Case Analysis of the Classical Algorithm for Markov Decision Processes with Büchi Objectives
inferred← citeshttps://doi.org/10.5075/epfl-thesis-3980openalex-snapshot
A formal approach to fault tolerant distributed consensus
inferred← citeshttps://doi.org/10.70675/7c2565b1z1cb0z4a01za239z032e5c0d8182openalex-snapshot
Parameterized verification of distributed shared-memory systems
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.