On the public citation graph
Reducing the Lengths of Checking Sequences by Overlapping
0 signed · 35 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/11430230_11openalex-snapshot
Eliminating Redundant Tests in a Checking Sequence
inferredcites →https://doi.org/10.1007/978-1-349-03521-2openalex-snapshot
Graph Theory with Applications
inferredcites →https://doi.org/10.1016/s0950-5849(99)00038-5openalex-snapshot
Efficient checking sequences for testing finite state machines
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/26.111442openalex-snapshot
An optimization technique for protocol conformance test generation based on UIO sequences and rural Chinese postman tours
inferredcites →https://doi.org/10.1109/5.58319openalex-snapshot
Formal methods for generating protocol conformance test sequences
inferredcites →https://doi.org/10.1109/proc.1963.2548openalex-snapshot
Introduction to the theory of finite-state machines
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.1109/tse.1978.231496openalex-snapshot
Testing Software Design Modeled by Finite-State Machines
inferredcites →https://doi.org/10.1142/9789812796936_others05openalex-snapshot
Combinatorial Optimization
inferredcites →https://doi.org/10.2307/2003459openalex-snapshot
Introduction to the Theory of Finite-State Machines
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-540-68524-1_12openalex-snapshot
Generating Checking Sequences for Partial Reduced Finite State Machines
inferred← citeshttps://doi.org/10.1007/978-3-642-41202-8_9openalex-snapshot
Generation of Checking Sequences Using Identification Sets
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/bxv122openalex-snapshot
Reducing FSM-Based Test Suites with Guaranteed Fault Coverage
inferred← citeshttps://doi.org/10.1109/icstw.2009.25openalex-snapshot
Checking Sequence Generation Using State Distinguishing Subsequences
inferred← citeshttps://doi.org/10.1109/iscis.2009.5291883openalex-snapshot
Using a SAT solver to generate checking sequences
inferred← citeshttps://doi.org/10.1155/2021/6378139openalex-snapshot
A Combining Method for Wireless Protocol Conformance Testing: A Empirical Case
inferred← citeshttps://doi.org/10.11606/d.55.2010.tde-16082010-142539openalex-snapshot
Uma estratégia para redução de conjuntos de sequências de teste para máquinas de estados finitos
inferred← citeshttps://doi.org/10.11606/d.55.2010.tde-19012011-144153openalex-snapshot
Um estratégia para geração de seqüências de verificação para máquinas de estados finitos
inferred← citeshttps://doi.org/10.11606/t.55.2011.tde-17082011-153853openalex-snapshot
Contribuições para o Teste de Software
inferred← citeshttps://doi.org/10.11606/t.55.2016.tde-11072016-172020openalex-snapshot
Aplicação de modelos de defeitos na geração de conjuntos de teste completos a partir de Sistemas de Transição com Entrada/Saída
inferred← citeshttps://doi.org/10.5753/wtf.2010.23099openalex-snapshot
Redução do Número de Seqüências no Teste de Conformidade de Protocolos
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.