On the public citation graph

Local encoding transformations for optimizing OBDD-representations of finite state machines

https://doi.org/10.1007/bfb0031824
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.
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.1002/j.1538-7305.1949.tb03624.xopenalex-snapshot
The Synthesis of Two-Terminal Switching Circuits
inferredcites →https://doi.org/10.1007/978-1-4615-3646-8openalex-snapshot
Sequential Logic Testing and Verification
inferredcites →https://doi.org/10.1007/bfb0031824openalex-snapshot
Local encoding transformations for optimizing OBDD-representations of finite state machines
inferredcites →https://doi.org/10.1109/12.144618openalex-snapshot
On the OBDD-representation of general Boolean functions
inferredcites →https://doi.org/10.1109/dac.1995.249982openalex-snapshot
Efficient OBDD-Based Boolean Manipulation in CAD Beyond Current Limits
inferredcites →https://doi.org/10.1109/edac.1992.205890openalex-snapshot
Multilevel logic synthesis based on functional decision diagrams
inferredcites →https://doi.org/10.1109/iccad.1988.122451openalex-snapshot
Logic verification using binary decision diagrams in a logic synthesis environment
inferredcites →https://doi.org/10.1109/iccad.1993.580029openalex-snapshot
Dynamic variable ordering for ordered binary decision diagrams
inferredcites →https://doi.org/10.1109/iccad.1995.480006openalex-snapshot
High-density reachability analysis
inferredcites →https://doi.org/10.1109/iscas.1996.542094openalex-snapshot
BDD minimization by truth table permutations
inferredcites →https://doi.org/10.1109/tc.1986.1676819openalex-snapshot
Graph-Based Algorithms for Boolean Function Manipulation
inferredcites →https://doi.org/10.1142/s0129626493000022openalex-snapshot
NC-ALGORITHMS FOR OPERATIONS ON BINARY DECISION DIAGRAMS
inferredcites →https://doi.org/10.1145/196244.196379openalex-snapshot
BDD variable ordering for interacting finite state machines
inferredcites →https://doi.org/10.5555/224841.224862openalex-snapshot
Who are the variables in your neighbourhood
inferredcites →https://doi.org/10.5555/224841.224874openalex-snapshot
High-density reachability analysis
inferredcites →https://doi.org/10.5555/259794.259802openalex-snapshot
Dynamic variable ordering for 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/3-540-45506-x_6openalex-snapshot
Data Structures for Boolean Functions BDDs — Foundations and Applications
inferred← citeshttps://doi.org/10.1007/978-1-4615-0817-5_11openalex-snapshot
Ordered Binary Decision Diagrams
inferred← citeshttps://doi.org/10.1007/978-3-642-60831-5_39openalex-snapshot
Geordnete binäre Entscheidungsgraphen und ihre Bedeutung im rechnergestutzten Entwurf hochintegrierter Schaltkreise
inferred← citeshttps://doi.org/10.1007/bfb0029984openalex-snapshot
On the influence of the state encoding on OBDD-representations of finite state machines
inferred← citeshttps://doi.org/10.1007/bfb0031795openalex-snapshot
Formal Methods in Computer-Aided Design
inferred← citeshttps://doi.org/10.1016/s0020-0190(00)00083-1openalex-snapshot
On the computational power of linearly transformed BDDs
inferred← citeshttps://doi.org/10.1023/a:1011273220017openalex-snapshot
Local Encoding Transformations for Optimizing OBDD-Representations of Finite State Machines
inferred← citeshttps://doi.org/10.1051/ita:1999103openalex-snapshot
On the Influence of the State Encoding on OBDD-Representations of Finite State Machines
inferred← citeshttps://doi.org/10.1109/43.845077openalex-snapshot
Linear sifting of decision diagrams and its application in synthesis
inferred← citeshttps://doi.org/10.1109/aspdac.2001.913286openalex-snapshot
Application of linearly transformed BDDs in sequential verification
inferred← citeshttps://doi.org/10.1109/dac.1997.597144openalex-snapshot
Linear Sifting Of Decision Diagrams
inferred← citeshttps://doi.org/10.1109/date.1998.655950openalex-snapshot
Combinational verification based on high-level functional specifications
inferred← citeshttps://doi.org/10.1109/dsd.2001.952121openalex-snapshot
An approach to minimization of decision diagrams
inferred← citeshttps://doi.org/10.1109/glsv.1998.665275openalex-snapshot
An exact input encoding algorithm for BDDs representing FSMs
inferred← citeshttps://doi.org/10.1109/glsv.1998.665287openalex-snapshot
Linear transformations and exact minimization of BDDs
inferred← citeshttps://doi.org/10.1109/iccad.1999.810620openalex-snapshot
Efficient manipulation algorithms for linearly transformed BDDs
inferred← citeshttps://doi.org/10.1109/iscas.1999.777884openalex-snapshot
Minimization of BDDs using linear transformations based on evolutionary techniques
inferred← citeshttps://doi.org/10.1109/tc.2003.1228514openalex-snapshot
Efficient minimization and manipulation of linearly transformed binary decision diagrams
inferred← citeshttps://doi.org/10.1145/266021.266066openalex-snapshot
Linear sifting of decision diagrams
inferred← citeshttps://doi.org/10.1145/288548.288631openalex-snapshot
Reencoding for cycle-time minimization under fixed encoding length
inferred← citeshttps://doi.org/10.1145/368434.368519openalex-snapshot
An efficient heuristic for state encoding minimizing the BDD representations of the transistion relations of finite state machines
inferred← citeshttps://doi.org/10.1145/370155.370286openalex-snapshot
Application of linearly transformed BDDs in sequential verification
inferred← citeshttps://doi.org/10.1145/370155.370319openalex-snapshot
A 3-step approach for performance-driven whole-chip routing
inferred← citeshttps://doi.org/10.2478/v10006-007-0011-6openalex-snapshot
FSM Encoding for BDD Representations
showing the first 24 of 25 · page through all 25
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.