On the public citation graph

Generalizing Redundancy Elimination in Checking Sequences

0 signed · 28 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/11430230_11openalex-snapshot
Eliminating Redundant Tests in a Checking Sequence
inferredcites →https://doi.org/10.1007/978-0-387-35567-2openalex-snapshot
Testing of Communicating Systems
inferredcites →https://doi.org/10.1016/0020-0190(96)00094-4openalex-snapshot
A note on approximation of the vertex cover and feedback vertex set problems — Unified approach
inferredcites →https://doi.org/10.1016/0169-7552(88)90064-5openalex-snapshot
A protocol test generation procedure
inferredcites →https://doi.org/10.1017/cbo9780511816239openalex-snapshot
Switching and Finite Automata Theory
inferredcites →https://doi.org/10.1109/12.272431openalex-snapshot
Testing finite-state machines: state identification and verification
inferredcites →https://doi.org/10.1109/12.559807openalex-snapshot
On minimizing the lengths of checking sequences
inferredcites →https://doi.org/10.1109/5.533956openalex-snapshot
Principles and methods of testing finite state machines-a survey
inferredcites →https://doi.org/10.1109/90.222912openalex-snapshot
On the generation of minimal-length conformance tests for communication protocols
inferredcites →https://doi.org/10.1109/swct.1964.8openalex-snapshot
Fault detecting experiments for sequential circuits
inferredcites →https://doi.org/10.1109/t-c.1970.222975openalex-snapshot
A Method for the Design of Fault Detection Experiments
inferredcites →https://doi.org/10.1109/tc.2002.1032630openalex-snapshot
Reduced length checking sequences
inferredcites →https://doi.org/10.1109/tc.2006.80openalex-snapshot
Optimizing the length of checking sequences
inferredcites →https://doi.org/10.2307/2003459openalex-snapshot
Introduction to the Theory of Finite-State Machines
inferredcites →https://doi.org/10.5555/314464.314514openalex-snapshot
Approximation algorithms for the vertex feedback set problem with applications to constraint satisfaction and Bayesian inference

What points at this work

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

inferred← citeshttps://doi.org/10.1007/11754008_17openalex-snapshot
Using Distinguishing and UIO Sequences Together in a Checking Sequence
inferred← citeshttps://doi.org/10.1007/11888116_32openalex-snapshot
Minimizing Coordination Channels in Distributed Testing
inferred← citeshttps://doi.org/10.1007/978-3-540-76650-6_11openalex-snapshot
Reducing Test Sequence Length Using Invertible Sequences
inferred← citeshttps://doi.org/10.1007/s00165-009-0135-6openalex-snapshot
Lower bounds on lengths of checking sequences
inferred← citeshttps://doi.org/10.1016/j.csi.2012.01.001openalex-snapshot
New state-recognition patterns for conformance testing of finite state machine implementations
inferred← citeshttps://doi.org/10.1016/j.infsof.2016.02.001openalex-snapshot
Effective algorithms for constructing minimum cost adaptive distinguishing sequences
inferred← citeshttps://doi.org/10.1016/j.jss.2009.05.019openalex-snapshot
Exploring alternatives for transition verification
inferred← citeshttps://doi.org/10.1016/j.jss.2012.03.034openalex-snapshot
On “Exploring alternatives for transition verification”
inferred← citeshttps://doi.org/10.1016/j.micpro.2014.01.007openalex-snapshot
On the global optimization of checking sequences for finite state machine implementations
inferred← citeshttps://doi.org/10.1093/comjnl/bxl070openalex-snapshot
Testing as Collecting of Evidence: An Integrated Approach to Test Generation for Finite State Machines
inferred← citeshttps://doi.org/10.1109/qsic.2007.4385488openalex-snapshot
Alternative B-Sequences
inferred← citeshttps://doi.org/10.1109/sefm.2009.12openalex-snapshot
Checking Sequence Construction Using Adaptive and Preset Distinguishing Sequences
inferred← citeshttps://doi.org/10.1145/1363686.1363850openalex-snapshot
Using adaptive distinguishing sequences in checking sequence constructions
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.