On the public citation graph

Finite state machine synthesis with fault tolerant test function

0 signed · 30 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/bf00153859openalex-snapshot
Finite state machine synthesis with embedded test function
inferredcites →https://doi.org/10.1109/2.25381openalex-snapshot
Gentest: an automatic test-generation system for sequential circuits
inferredcites →https://doi.org/10.1109/43.55190openalex-snapshot
Easily testable PLA-based finite state machines
inferredcites →https://doi.org/10.1109/43.62790openalex-snapshot
A unified approach to the synthesis of fully testable sequential machines
inferredcites →https://doi.org/10.1109/icvd.1992.658015openalex-snapshot
Functional Test Generation for Sequential Circuits
inferredcites →https://doi.org/10.1109/mdt.1987.295115openalex-snapshot
Scan Design Using Standard Flip-Flops
inferredcites →https://doi.org/10.1109/swct.1964.8openalex-snapshot
Fault detecting experiments for sequential circuits
inferredcites →https://doi.org/10.1109/test.1990.114032openalex-snapshot
Testability preserving transformations in multi-level logic synthesis
inferredcites →https://doi.org/10.1145/74382.74437openalex-snapshot
NOVA: state assignment of finite state machines for optimal two-level logic implementations

What points at this work

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

inferred← citeshttps://doi.org/10.1007/s10836-005-5289-4openalex-snapshot
A Degree-of-Freedom Based Synthesis Scheme for Sequential Machines with Enhanced BIST Quality and Reduced Area
inferred← citeshttps://doi.org/10.1016/0165-6074(93)90096-4openalex-snapshot
Concurrently self-checking structures for Fsms
inferred← citeshttps://doi.org/10.1023/a:1008204118797openalex-snapshot
Design for Testability Using State Distances
inferred← citeshttps://doi.org/10.1023/a:1008333102734openalex-snapshot
A Non-Scan Approach to DFT for Controllers Achieving 100% Fault Efficiency
inferred← citeshttps://doi.org/10.1109/43.406713openalex-snapshot
Test function embedding algorithms with application to interconnected finite state machines
inferred← citeshttps://doi.org/10.1109/43.466342openalex-snapshot
A partition and resynthesis approach to testable design of large circuits
inferred← citeshttps://doi.org/10.1109/43.503941openalex-snapshot
EARTH: combined state assignment of PLA-based FSM's targeting area and testability
inferred← citeshttps://doi.org/10.1109/43.720319openalex-snapshot
Test-point insertion: scan paths through functional logic
inferred← citeshttps://doi.org/10.1109/43.720320openalex-snapshot
Cost-free scan: a low-overhead scan path design
inferred← citeshttps://doi.org/10.1109/aspdac.2000.835171openalex-snapshot
A non-scan DFT method at register-transfer level to achieve complete fault efficiency
inferred← citeshttps://doi.org/10.1109/ats.1995.485330openalex-snapshot
Theory and applications of cellular automata for synthesis of easily testable combinational logic
inferred← citeshttps://doi.org/10.1109/ats.1999.810761openalex-snapshot
New DFT techniques of non-scan sequential circuits with complete fault efficiency
inferred← citeshttps://doi.org/10.1109/eurdac.1995.527396openalex-snapshot
Testable synthesis of high complex control devices
inferred← citeshttps://doi.org/10.1109/glsv.1996.497635openalex-snapshot
Improving circuit testability by clock control
inferred← citeshttps://doi.org/10.1109/icvd.1994.282667openalex-snapshot
A test function architecture for interconnected finite state machines
inferred← citeshttps://doi.org/10.1109/icvd.1995.512148openalex-snapshot
Combined optimization of area and testability during state assignment of PLA-based FSM's
inferred← citeshttps://doi.org/10.1109/mdt.1995.466373openalex-snapshot
Localizing multiple faults in a protocol implementation
inferred← citeshttps://doi.org/10.1109/test.1993.470627openalex-snapshot
A synthesis approach to design for testability
inferred← citeshttps://doi.org/10.1109/vtest.1995.512631openalex-snapshot
A distance reduction approach to design for testability
inferred← citeshttps://doi.org/10.1145/253052.253064openalex-snapshot
Functional design for testability of control-dominated architectures
inferred← citeshttps://doi.org/10.1145/368434.368825openalex-snapshot
A non-scan DFT method at register-transfer level to achieve complete fault efficiency
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.