On the public citation graph
BDDs vs. Zero-Suppressed BDDs: for CTL symbolic model checking of Petri nets
0 signed · 41 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-60029-9_50openalex-snapshot
Verification of asynchronous circuits by BDD-based model checking of Petri nets
inferredcites →https://doi.org/10.1007/3-540-60045-0_50openalex-snapshot
Trace theoretic verification of asynchronous circuits using unfoldings
inferredcites →https://doi.org/10.1016/0890-5401(92)90017-aopenalex-snapshot
Symbolic model checking: 1020 States and beyond
inferredcites →https://doi.org/10.1109/aspdac.1995.486371openalex-snapshot
Combining partial orders and symbolic traversal for efficient verification of asynchronous circuits
inferredcites →https://doi.org/10.1109/async.1996.494447openalex-snapshot
Using partial orders for trace theoretic verification of asynchronous circuits
inferredcites →https://doi.org/10.1145/157485.164890openalex-snapshot
Zero-suppressed BDDs for set manipulation in combinatorial problems
inferredcites →https://doi.org/10.7551/mitpress/6874.001.0001openalex-snapshot
Trace Theory for Automatic Hierarchical Verification of Speed-Independent Circuits
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/1520-684x(200102)32:2<43::aid-scj5>3.0.co;2-popenalex-snapshot
Verification of asynchronous circuits based on zero-suppressed BDDs
inferred← citeshttps://doi.org/10.1002/spe.895openalex-snapshot
Using XBDDs and ZBDDs in points‐to analysis
inferred← citeshttps://doi.org/10.1007/3-540-48745-x_3openalex-snapshot
Structural Methods to Improve the Symbolic Analysis of Petri Nets
inferred← citeshttps://doi.org/10.1007/978-3-030-21571-2_17openalex-snapshot
Improving Saturation Efficiency with Implicit Relations
inferred← citeshttps://doi.org/10.1007/978-3-031-79870-2_1openalex-snapshot
Introduction to Zero-Suppressed Decision Diagrams
inferred← citeshttps://doi.org/10.1007/978-3-319-10885-8_17openalex-snapshot
Explicit State Space and Markov Chain Generation Using Decision Diagrams
inferred← citeshttps://doi.org/10.1007/978-3-319-89960-2_5openalex-snapshot
Chain Reduction for Binary and Zero-Suppressed Decision Diagrams
inferred← citeshttps://doi.org/10.1007/978-3-540-85261-2_23openalex-snapshot
Using ZBDDs in Points-to Analysis
inferred← citeshttps://doi.org/10.1007/978-3-540-89740-8_4openalex-snapshot
Efficient Set Sharing Using ZBDDs
inferred← citeshttps://doi.org/10.1007/978-3-642-29072-5_3openalex-snapshot
Ten Years of Saturation: A Petri Net Perspective
inferred← citeshttps://doi.org/10.1007/s100090100038openalex-snapshot
Zero-suppressed BDDs and their applications
inferred← citeshttps://doi.org/10.1007/s10703-006-0033-yopenalex-snapshot
Exploiting interleaving semantics in symbolic state-space generation
inferred← citeshttps://doi.org/10.1007/s10817-020-09569-6openalex-snapshot
Chain Reduction for Binary and Zero-Suppressed Decision Diagrams
inferred← citeshttps://doi.org/10.1016/j.ins.2016.01.036openalex-snapshot
Model checking Petri nets with MSVL
inferred← citeshttps://doi.org/10.1016/j.tcs.2010.06.030openalex-snapshot
IDD-based model validation of biochemical networks
inferred← citeshttps://doi.org/10.1016/s0167-9260(97)00023-0openalex-snapshot
RTL verification of timed asynchronous and heterogeneous systems using symbolic model checking
inferred← citeshttps://doi.org/10.1109/12.926158openalex-snapshot
Symbolic analysis of bounded Petri nets
inferred← citeshttps://doi.org/10.1109/43.856979openalex-snapshot
Interval diagrams for efficient symbolic verification of process networks
inferred← citeshttps://doi.org/10.1109/date.1998.655948openalex-snapshot
Efficient encoding schemes for symbolic analysis of Petri nets
inferred← citeshttps://doi.org/10.1109/ibcast.2014.6778136openalex-snapshot
Reliable system design using decision diagrams in presence of hard and soft errors
inferred← citeshttps://doi.org/10.1109/jva60410.2023.00018openalex-snapshot
Research Directions in Decision Diagram Technology
inferred← citeshttps://doi.org/10.1109/prdc.2001.992695openalex-snapshot
Partial order reduction in verification of wheel structured parameterized circuits
inferred← citeshttps://doi.org/10.1109/tsmc.2021.3056693openalex-snapshot
Critical Observability of Discrete-Event Systems in a Petri Net Framework
inferred← citeshttps://doi.org/10.1145/1134285.1134308openalex-snapshot
Managing space for finite-state verification
inferred← citeshttps://doi.org/10.1145/317825.317964openalex-snapshot
Symbolic manipulation of Boolean functions using a graphical representation
inferred← citeshttps://doi.org/10.1145/3441655openalex-snapshot
Reasoning about Petri Nets: A Calculus Based on Resolution and Dynamic Logic
inferred← citeshttps://doi.org/10.1587/essfr.13.1_20openalex-snapshot
Reachability Analysis of Petri Nets
inferred← citeshttps://doi.org/10.21236/ada346061openalex-snapshot
Verification of Floating-Point Adders
inferred← citeshttps://doi.org/10.21236/ada382689openalex-snapshot
Boolean Satisfiability with Transitivity Constraints
inferred← citeshttps://doi.org/10.2200/s00612ed1v01y201411dcs045openalex-snapshot
Applications of Zero-Suppressed Decision Diagrams
inferred← citeshttps://doi.org/10.23919/fmcad.2017.8102248openalex-snapshot
Tagged BDDs: Combining reduction rules from different decision diagram types
inferred← citeshttps://doi.org/10.5555/368058.368416openalex-snapshot
Efficient encoding schemes for symbolic analysis of petri nets
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.