On the public citation graph

On bisimulation, fault-monotonicity and provable fault-tolerance

https://doi.org/10.1007/bfb0000478
0 signed · 28 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/3-540-61648-9_46openalex-snapshot
Dynamic scheduling in the presence of faults: Specification and verification
inferredcites →https://doi.org/10.1007/978-0-387-34878-0_42openalex-snapshot
Stepwise Transformations for Fault-Tolerant Design of CCS Processes
inferredcites →https://doi.org/10.1007/978-1-4613-9668-0_6openalex-snapshot
Parallel Program Design
inferredcites →https://doi.org/10.1007/bf01211393openalex-snapshot
Transformation of programs for fault-tolerance
inferredcites →https://doi.org/10.1007/bf01384499openalex-snapshot
Generality in design and compositional verification usingTav
inferredcites →https://doi.org/10.1007/bf01786251openalex-snapshot
Algebraic specification and proof of a distributed recovery algorithm
inferredcites →https://doi.org/10.1007/bf02259750openalex-snapshot
An incremental specification of the sliding-window protocol
inferredcites →https://doi.org/10.1007/bf02259751openalex-snapshot
Design and verification of fault tolerant systems with CSP
inferredcites →https://doi.org/10.1007/bfb0017309openalex-snapshot
Concurrency and automata on infinite sequences
inferredcites →https://doi.org/10.1007/bfb0035748openalex-snapshot
Realizable and unrealizable specifications of reactive systems
inferredcites →https://doi.org/10.1016/0890-5401(92)90025-bopenalex-snapshot
A compositional protocol verification using relativized bisimulation
inferredcites →https://doi.org/10.1109/tse.1985.231534openalex-snapshot
A Rigorous Approach to Fault-Tolerant Programming
inferredcites →https://doi.org/10.1145/2455.2460openalex-snapshot
Algebraic laws for nondeterminism and concurrency

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/stvr.258openalex-snapshot
Model checking fault tolerant systems
inferred← citeshttps://doi.org/10.1007/3-540-45352-0_7openalex-snapshot
Modeling Faults of Distributed, Reactive Systems
inferred← citeshttps://doi.org/10.1007/3-540-49366-2_6openalex-snapshot
Semantics and Logic for Provable Fault-Tolerance, A Tutorial
inferred← citeshttps://doi.org/10.1007/978-0-387-35520-7_18openalex-snapshot
Fail-Stop Components by Pattern Matching
inferred← citeshttps://doi.org/10.1007/978-3-030-30985-5_31openalex-snapshot
Application of Model Checking to Fault Tolerance Analysis
inferred← citeshttps://doi.org/10.1007/978-3-642-24690-6_9openalex-snapshot
dCTL: A Branching Time Temporal Logic for Fault-Tolerant System Verification
inferred← citeshttps://doi.org/10.1007/978-3-642-33296-8_3openalex-snapshot
Model Checking Propositional Deontic Temporal Logic via a μ-Calculus Characterization
inferred← citeshttps://doi.org/10.1007/978-3-642-38613-8_29openalex-snapshot
Characterizing Fault-Tolerant Systems by Means of Simulation Relations
inferred← citeshttps://doi.org/10.1007/s00165-017-0426-2openalex-snapshot
Simulation relations for fault-tolerance
inferred← citeshttps://doi.org/10.1007/s00165-018-0475-1openalex-snapshot
Formal reliability analysis of redundancy architectures
inferred← citeshttps://doi.org/10.1023/a:1026537232278openalex-snapshot
Dynamic Scheduling and Fault-Tolerance: Specification and Verification
inferred← citeshttps://doi.org/10.1093/comjnl/43.3.191openalex-snapshot
Formally Verifying Fault Tolerant System Designs
inferred← citeshttps://doi.org/10.1109/ase.2013.6693149openalex-snapshot
Synthesizing fault-tolerant programs from deontic logic specifications
inferred← citeshttps://doi.org/10.1109/iceccs.2000.873944openalex-snapshot
Automated result verification with AWK
inferred← citeshttps://doi.org/10.4204/eptcs.222.3openalex-snapshot
Self-Similarity Breeds Resilience
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.