On the public citation graph
Irredundant sequential machines via optimal logic synthesis
0 signed · 92 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/978-1-4613-2821-6openalex-snapshot
Logic Minimization Algorithms for VLSI Synthesis
inferredcites →https://doi.org/10.1007/978-3-642-95424-5openalex-snapshot
Diagnosis & Reliable Design of Digital Systems
inferredcites →https://doi.org/10.1016/s0019-9958(62)90588-0openalex-snapshot
Some dangers in state reduction of sequential machines
inferredcites →https://doi.org/10.1049/ip-e.1981.0052openalex-snapshot
Introduction to Switching Theory and Logical Design
inferredcites →https://doi.org/10.1049/sqj.1969.0082openalex-snapshot
Introduction to Switching Theory and Logical Design
inferredcites →https://doi.org/10.1109/43.16807openalex-snapshot
MUSTANG: state assignment of finite state machines targeting multilevel logic implementations
inferredcites →https://doi.org/10.1109/43.3210openalex-snapshot
On the verification of sequential machines at differing levels of abstraction
inferredcites →https://doi.org/10.1109/43.3211openalex-snapshot
Multi-level logic minimization using implicit don't cares
inferredcites →https://doi.org/10.1109/43.7807openalex-snapshot
Test generation for sequential circuits
inferredcites →https://doi.org/10.1109/tcad.1985.1270123openalex-snapshot
Optimal State Assignment for Finite State Machines
inferredcites →https://doi.org/10.1109/tec.1959.5222697openalex-snapshot
Minimizing the Number of States in Incompletely Specified Sequential Switching Functions
inferredcites →https://doi.org/10.1109/test.1988.207845openalex-snapshot
Synthesis and optimization procedures for fully and easily testable sequential machines
inferredcites →https://doi.org/10.5555/800262.809170openalex-snapshot
A logic design structure for LSI testability
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-030-92604-5_17openalex-snapshot
Combined State Merging and Splitting Procedure for Low Power Implementations of Finite State Machines
inferred← citeshttps://doi.org/10.1007/978-3-642-76930-6_12openalex-snapshot
Emulation of Scan Paths in Sequential Circuit Synthesis
inferred← citeshttps://doi.org/10.1007/bf00134012openalex-snapshot
Redundancies and don't cares in sequential logic synthesis
inferred← citeshttps://doi.org/10.1007/bf00137253openalex-snapshot
An implicitly testable boundary scan TAP controller
inferred← citeshttps://doi.org/10.1007/bf00971960openalex-snapshot
Self-checking combinational circuit design for single and unidirectional multibit error
inferred← citeshttps://doi.org/10.1007/bf00993136openalex-snapshot
Constrained state assignment of easily testable FSMs
inferred← citeshttps://doi.org/10.1016/0167-9260(92)90029-xopenalex-snapshot
Synthesis and self-test of random logic control units
inferred← citeshttps://doi.org/10.1049/ip-cdt:19941228openalex-snapshot
State merging and state splitting via state assignment: a new FSM synthesis algorithm
inferred← citeshttps://doi.org/10.1049/ip-cdt:19982343openalex-snapshot
Implicit manipulation of equivalence classes for large finite state machines
inferred← citeshttps://doi.org/10.1049/ip-cdt:20045027openalex-snapshot
Testable synthesis of synchronous sequential circuits considering strong-connectivity using undefined states
inferred← citeshttps://doi.org/10.1109/12.817386openalex-snapshot
Synthesis for testability of highly complex controllers by functional redundancy removal
inferred← citeshttps://doi.org/10.1109/12.844343openalex-snapshot
A hierarchical test generation approach for large controllers
inferred← citeshttps://doi.org/10.1109/12.869333openalex-snapshot
Isomorph-redundancy in sequential circuits
inferred← citeshttps://doi.org/10.1109/43.124417openalex-snapshot
Optimized synthesis techniques for testable sequential circuits
inferred← citeshttps://doi.org/10.1109/43.160003openalex-snapshot
Heuristic minimization of Boolean relations using testing techniques
inferred← citeshttps://doi.org/10.1109/43.229748openalex-snapshot
An efficient algorithm to search for minimal closed covers in sequential machines
inferred← citeshttps://doi.org/10.1109/43.277606openalex-snapshot
Sequential test generation and synthesis for testability at the register-transfer and logic levels
inferred← citeshttps://doi.org/10.1109/43.543773openalex-snapshot
A complexity analysis of sequential ATPG
inferred← citeshttps://doi.org/10.1109/43.55190openalex-snapshot
Easily testable PLA-based finite state machines
inferred← citeshttps://doi.org/10.1109/43.631217openalex-snapshot
Behavior and testability preservation under the retiming transformation
inferred← citeshttps://doi.org/10.1109/43.658570openalex-snapshot
Identifying invalid states for sequential circuit test generation
inferred← citeshttps://doi.org/10.1109/43.67785openalex-snapshot
Irredundant interacting sequential machines via optimal logic synthesis
inferred← citeshttps://doi.org/10.1109/43.766721openalex-snapshot
Combining multiple DFT schemes with test generation
inferred← citeshttps://doi.org/10.1109/43.851991openalex-snapshot
Symbolic optimization of interacting controllers based on redundancy identification and removal
inferred← citeshttps://doi.org/10.1109/54.386003openalex-snapshot
Testability implications of performance driven logic synthesis
inferred← citeshttps://doi.org/10.1109/54.632883openalex-snapshot
Testing core-based systems: a symbolic methodology
inferred← citeshttps://doi.org/10.1109/acssc.1992.269089openalex-snapshot
A technique for designing bidirectional error-free combinational logic circuits
inferred← citeshttps://doi.org/10.1109/ats.1995.485334openalex-snapshot
Testable design of non-scan sequential circuits using extra logic
inferred← citeshttps://doi.org/10.1109/ats.1996.555128openalex-snapshot
Invalid state identification for sequential circuit test generation
inferred← citeshttps://doi.org/10.1109/cicc.1992.591295openalex-snapshot
Improving The Testability Of Finite State Machines Implemented By EPLD's
inferred← citeshttps://doi.org/10.1109/cicc.1994.379751openalex-snapshot
Automatic synthesis and the cost of testing
inferred← citeshttps://doi.org/10.1109/cicc.1994.379752openalex-snapshot
Improving cell libraries for synthesis
inferred← citeshttps://doi.org/10.1109/cmpeur.1991.257510openalex-snapshot
Towards automatic synthesis and verification of complex electronic systems
inferred← citeshttps://doi.org/10.1109/cmpeur.1992.218499openalex-snapshot
Test generation for gate level sequential machines: algorithms and implementation issues
inferred← citeshttps://doi.org/10.1109/dftvs.1996.572034openalex-snapshot
Redundant faults in TSC networks: definition and removal
inferred← citeshttps://doi.org/10.1109/edac.1991.206409openalex-snapshot
Synthesis of fully testable sequential machines
inferred← citeshttps://doi.org/10.1109/edtc.1994.326860openalex-snapshot
Synthesis of sequential machines with reduced testing cost
inferred← citeshttps://doi.org/10.1109/edtc.1995.470387openalex-snapshot
Complexity of sequential ATPG
inferred← citeshttps://doi.org/10.1109/edtc.1995.470391openalex-snapshot
Sequential logic minimization based on functional testability
inferred← citeshttps://doi.org/10.1109/eurdac.1992.246317openalex-snapshot
Experiments on the synthesis and testability of non-scan finite state machines
inferred← citeshttps://doi.org/10.1109/ftcs.1989.105551openalex-snapshot
Easily testable PLA-based finite state machines
inferred← citeshttps://doi.org/10.1109/ftcs.1990.89393openalex-snapshot
Optimized synthesis of self-testable finite state machines
inferred← citeshttps://doi.org/10.1109/iccad.1989.76937openalex-snapshot
Boolean minimization and algebraic factorization procedures for fully testable sequential machines
inferred← citeshttps://doi.org/10.1109/iccad.1990.129847openalex-snapshot
Implicit state transition graphs: applications to sequential logic synthesis and test
inferred← citeshttps://doi.org/10.1109/iccad.1990.129940openalex-snapshot
Don't care minimization of multi-level sequential logic networks
inferred← citeshttps://doi.org/10.1109/iccd.1990.130225openalex-snapshot
Testability driven synthesis of interacting finite state machines
inferred← citeshttps://doi.org/10.1109/iccd.1990.130226openalex-snapshot
Heuristic minimization of Boolean relations using testing techniques
inferred← citeshttps://doi.org/10.1109/iccd.1992.276291openalex-snapshot
Multiple input bridging fault detection in CMOS sequential circuits
inferred← citeshttps://doi.org/10.1109/iccd.1995.528808openalex-snapshot
Synthesis for testability of large complexity controllers
inferred← citeshttps://doi.org/10.1109/iccd.1996.563583openalex-snapshot
Implicit test sequences compaction for decreasing test application cost
inferred← citeshttps://doi.org/10.1109/icvd.1993.669706openalex-snapshot
A Novel Scheme for Synthesis of Easily Testable Finite State Machines Using Cellular Automata
inferred← citeshttps://doi.org/10.1109/iscas.1990.112533openalex-snapshot
Synchronous logic synthesis: circuit specifications and optimization algorithms
inferred← citeshttps://doi.org/10.1109/iscas.1990.112667openalex-snapshot
Synthesis for testability: a brief survey
inferred← citeshttps://doi.org/10.1109/iscas.1990.112672openalex-snapshot
Multiple fault testable sequential circuits
inferred← citeshttps://doi.org/10.1109/iscas.1991.176749openalex-snapshot
SMAS: a program for the concurrent state reduction and state assignment of finite state machines
inferred← citeshttps://doi.org/10.1109/iscas.1995.523818openalex-snapshot
A BDD based algorithm for detecting difficult faults
inferred← citeshttps://doi.org/10.1109/ssst.1993.522815openalex-snapshot
On interacting finite state machine design with self-checking capability
inferred← citeshttps://doi.org/10.1109/tai.1991.167123openalex-snapshot
Searching for a minimal finite state automaton (FSA)
inferred← citeshttps://doi.org/10.1109/tcad.2002.1013894openalex-snapshot
A comprehensive approach to the partial scan problem using implicit state enumeration
inferred← citeshttps://doi.org/10.1109/test.1989.82332openalex-snapshot
Redundancies and don't cares in sequential logic synthesis
inferred← citeshttps://doi.org/10.1109/test.1990.114033openalex-snapshot
Sequential logic synthesis for testability using register-transfer level descriptions
inferred← citeshttps://doi.org/10.1109/test.1991.519494openalex-snapshot
A COMMON APPROACH TO TEST GENERATION AND HARDWARE VERIFICATION BASED ON TEMPORAL LOGIC
inferred← citeshttps://doi.org/10.1109/test.1991.519710openalex-snapshot
CAN REDUNDANCY ENHANCE TESTABILITY?
inferred← citeshttps://doi.org/10.1109/test.1998.743209openalex-snapshot
A comprehensive approach to the partial scan problem using implicit state enumeration
inferred← citeshttps://doi.org/10.1109/vtest.1991.208127openalex-snapshot
Recent progress in synthesis for testability
inferred← citeshttps://doi.org/10.1109/vtest.1993.313309openalex-snapshot
Input and output encoding techniques for on-line error detection in combinational logic circuits
inferred← citeshttps://doi.org/10.1109/vtest.1995.512651openalex-snapshot
On the design of at-speed testable VLSI circuits
inferred← citeshttps://doi.org/10.1134/s1064230715030090openalex-snapshot
Minimization of power consumption of finite state machines by splitting their internal states
inferred← citeshttps://doi.org/10.1145/127601.127697openalex-snapshot
A unified approach for the synthesis of self-testable finite state machines
inferred← citeshttps://doi.org/10.1145/162124.162132openalex-snapshot
State assignment for hardwired VLSI control units
inferred← citeshttps://doi.org/10.1145/253052.253064openalex-snapshot
Functional design for testability of control-dominated architectures
inferred← citeshttps://doi.org/10.1155/1994/29238openalex-snapshot
Techniques for Self‐Checking Combinational LogicSynthesis
inferred← citeshttps://doi.org/10.1155/1994/31646openalex-snapshot
Partial Reset: An Alternative DFT Approach
inferred← citeshttps://doi.org/10.3390/app14072693openalex-snapshot
Basic Approaches for Reducing Power Consumption in Finite State Machine Circuits—A Review
inferred← citeshttps://doi.org/10.5555/159754.161805openalex-snapshot
Experiments on the synthesis and testability of non-scan finite state machines
inferred← citeshttps://doi.org/10.5555/259794.259796openalex-snapshot
Fault behavior dictionary for simulation of device-level transients
inferred← citeshttps://doi.org/10.5555/951513.951575openalex-snapshot
Synthesis of fully testable sequential machines
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.