On the public citation graph

BDD based analysis of parametric fault trees

0 signed · 18 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/978-1-4615-2367-3openalex-snapshot
Performance and Reliability Analysis of Computer Systems
inferredcites →https://doi.org/10.1016/0951-8320(93)90060-copenalex-snapshot
New algorithms for fault trees analysis
inferredcites →https://doi.org/10.1109/dac.1990.114826openalex-snapshot
Efficient implementation of a BDD package
inferredcites →https://doi.org/10.1109/rams.2004.1285449openalex-snapshot
Minimal cut set/sequence generation for dynamic fault trees
inferredcites →https://doi.org/10.1109/tr.1997.664017openalex-snapshot
Performance And Reliability Analysis Of Computer Systems (an Example-based Approach Using The Sharpe Software
inferredcites →https://doi.org/10.1109/tse.2003.1183940openalex-snapshot
Parametric fault tree for the dependability analysis of redundant systems and its high-level petri net semantics
inferredcites →https://doi.org/10.1145/123186.123222openalex-snapshot
Efficient implementation of a BDD package
inferredcites →https://doi.org/10.1145/136035.136043openalex-snapshot
Symbolic Boolean manipulation with ordered binary-decision diagrams

What points at this work

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

inferred← citeshttps://doi.org/10.1007/978-3-031-78287-9_9openalex-snapshot
Computing Minimal Cut Sets
inferred← citeshttps://doi.org/10.1007/978-3-319-89722-6openalex-snapshot
Principles of Security and Trust
inferred← citeshttps://doi.org/10.1007/978-3-319-89722-6_14openalex-snapshot
On Quantitative Analysis of Attack–Defense Trees with Repeated Labels
inferred← citeshttps://doi.org/10.1016/j.cosrev.2015.03.001openalex-snapshot
Fault tree analysis: A survey of the state-of-the-art in modeling, analysis and tools
inferred← citeshttps://doi.org/10.1016/j.ress.2010.12.027openalex-snapshot
Integrating several formalisms in order to increase Fault Trees' modeling power
inferred← citeshttps://doi.org/10.1109/issre.2017.13openalex-snapshot
WAP: SAT-Based Computation of Minimal Cut Sets
inferred← citeshttps://doi.org/10.1109/tr.2020.3014012openalex-snapshot
SATMCS: An Efficient SAT-Based Algorithm and Its Improvements for Computing Minimal Cut Sets
inferred← citeshttps://doi.org/10.1109/wcica.2008.4594267openalex-snapshot
Fault Diagnosis of Airborne Equipment Based on Grey Correlation Fault Tree Identification Method
inferred← citeshttps://doi.org/10.3990/1.9789036545228openalex-snapshot
Zen and the Art of Railway Maintenance
inferred← citeshttps://doi.org/10.70675/00bb6b0dzca4ez4626z8a69zd34d58355efbopenalex-snapshot
Formal modeling and quantitative analysis of security using attack- defense trees
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.