On the public citation graph
The instability of self-stabilization
0 signed · 57 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.1007/3-540-10843-2_22openalex-snapshot
Impartiality, justice and fairness: The ethics of concurrent termination
inferredcites →https://doi.org/10.1007/978-1-4612-5695-3openalex-snapshot
Selected Writings on Computing: A personal Perspective
inferredcites →https://doi.org/10.1007/bf00265555openalex-snapshot
Fairness and related properties in transition systems ? a temporal logic to deal with fairness
inferredcites →https://doi.org/10.1007/bfb0039622openalex-snapshot
Decidability questions for fairness in Petri nets
inferredcites →https://doi.org/10.1016/0020-0190(84)90114-5openalex-snapshot
Fairness and conspiracies
inferredcites →https://doi.org/10.1016/0167-6423(87)90036-0openalex-snapshot
Modalities for model checking: branching time logic strikes back
inferredcites →https://doi.org/10.1016/0304-3975(79)90041-0openalex-snapshot
On the reachability problem for 5-dimensional vector addition systems
inferredcites →https://doi.org/10.1016/0304-3975(91)90228-topenalex-snapshot
A taxonomy of fairness and temporal logic problems for Petri nets
inferredcites →https://doi.org/10.1016/0378-4754(81)90068-9openalex-snapshot
Introduction to automata theory, languages and computation
inferredcites →https://doi.org/10.1016/0378-4754(82)90066-0openalex-snapshot
Petri Net theory and the modeling of systems
inferredcites →https://doi.org/10.1016/s0019-9958(71)90501-8openalex-snapshot
Cellular automata complexity trade-offs
inferredcites →https://doi.org/10.1016/s0022-0000(69)80011-5openalex-snapshot
Parallel program schemata
inferredcites →https://doi.org/10.1109/32.6188openalex-snapshot
A class of inherently fault tolerant distributed programs
inferredcites →https://doi.org/10.1109/t-c.1974.223995openalex-snapshot
On Some Open Problems in the Theory of Cellular Automata
inferredcites →https://doi.org/10.1137/0214033openalex-snapshot
Sequential Machine Characterizations of Trellis and Cellular Automata and Applications
inferredcites →https://doi.org/10.1145/116825.116855openalex-snapshot
Stability and stabilizability of discrete event dynamic systems
inferredcites →https://doi.org/10.1145/322374.322380openalex-snapshot
On Communicating Finite-State Machines
inferredcites →https://doi.org/10.1145/357172.357178openalex-snapshot
Proving Liveness Properties of Concurrent Programs
inferredcites →https://doi.org/10.1145/357980.358021openalex-snapshot
Communicating sequential processes
inferredcites →https://doi.org/10.1145/360933.360975openalex-snapshot
Guarded commands, nondeterminacy and formal derivation of programs
inferredcites →https://doi.org/10.1145/361179.361202openalex-snapshot
Self-stabilizing systems in spite of distributed control
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
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1006/inco.1998.2707openalex-snapshot
Self-Stabilizing Ring Orientation Using Constant Space
inferred← citeshttps://doi.org/10.1006/jpdc.2001.1825openalex-snapshot
Finite-State Self-Stabilizing Protocols in Message-Passing Systems
inferred← citeshttps://doi.org/10.1007/3-540-45438-1_5openalex-snapshot
Dijkstra’s Self-Stabilizing Algorithm in Unsupportive Environments
inferred← citeshttps://doi.org/10.1007/3-540-51486-4_72openalex-snapshot
System simulation and the sensitivity of self-stabilization
inferred← citeshttps://doi.org/10.1007/3-540-56689-9_38openalex-snapshot
Bounded self-stabilizing Petri nets
inferred← citeshttps://doi.org/10.1007/978-1-4615-2271-3_2openalex-snapshot
Self-Stabilizing Real-Time Decision Systems
inferred← citeshttps://doi.org/10.1007/978-94-015-9586-5_4openalex-snapshot
Temporal Logic for Stabilizing Systems
inferred← citeshttps://doi.org/10.1007/bf01178259openalex-snapshot
Bounded self-stabilizing Petri nets
inferred← citeshttps://doi.org/10.1007/bf02278854openalex-snapshot
Stabilization and pseudo-stabilization
inferred← citeshttps://doi.org/10.1007/bfb0020439openalex-snapshot
Uniform deterministic self-stabilizing ring-orientation on odd-length rings
inferred← citeshttps://doi.org/10.1007/bfb0022135openalex-snapshot
The triumph and tribulation of system stabilization
inferred← citeshttps://doi.org/10.1007/s002360050012openalex-snapshot
Bounded self-stabilizing Petri nets
inferred← citeshttps://doi.org/10.1007/s002360050180openalex-snapshot
Memory requirements for silent stabilization
inferred← citeshttps://doi.org/10.1016/s0304-3975(96)00150-8openalex-snapshot
On the computational power of self-stabilizing systems
inferred← citeshttps://doi.org/10.1016/s0304-3975(96)00286-1openalex-snapshot
The local detection paradigm and its applications to self-stabilization
inferred← citeshttps://doi.org/10.1016/s0736-5853(05)80019-xopenalex-snapshot
Bounded-time fault-tolerant rule-based systems
inferred← citeshttps://doi.org/10.1109/icdcs.1994.302448openalex-snapshot
Distributed execution model for self-stabilizing systems
inferred← citeshttps://doi.org/10.1109/iceccs.2001.930183openalex-snapshot
Analysis of self-stabilization for infinite-state systems
inferred← citeshttps://doi.org/10.1109/icnp.1993.340921openalex-snapshot
On Petri nets and self-stabilization of communication protocols
inferred← citeshttps://doi.org/10.1109/isads.1995.398986openalex-snapshot
On efficiently tolerating general failures in autonomous decentralized multiserver systems
inferred← citeshttps://doi.org/10.1109/rtas48715.2020.00-13openalex-snapshot
Bounded-time recovery for distributed real-time systems
inferred← citeshttps://doi.org/10.1109/slfstb.1999.777488openalex-snapshot
Finite-state self-stabilizing protocols in message-passing systems
inferred← citeshttps://doi.org/10.1145/1552309.1552312openalex-snapshot
Self-stabilization preserving compiler
inferred← citeshttps://doi.org/10.1145/248052.248055openalex-snapshot
Memory requirements for silent stabilization
inferred← citeshttps://doi.org/10.3233/fun-2006-70406openalex-snapshot
Decidability Analysis of Self-Stabilization for Infinite-State Systems
inferred← citeshttps://doi.org/10.5860/choice.33-0987openalex-snapshot
Introduction to distributed algorithms
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.