On the public citation graph
Eliminating Redundant Tests in a Checking Sequence
0 signed · 48 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-0-387-34892-6_9openalex-snapshot
Modeling Basic LOTOS by FSMs for Conformance Testing
inferredcites →https://doi.org/10.1007/s001650070003openalex-snapshot
Testing Conformance to a Quasi-Non-Deterministic Stream X-Machine
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/b978-044482816-3/50018-6openalex-snapshot
Automating the process of test derivation from SDL specifications
inferredcites →https://doi.org/10.1016/s0140-3664(99)00227-3openalex-snapshot
Test generation based on control and data dependencies within system specifications in SDL
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/12.599899openalex-snapshot
Test generation for multiple state-table faults in finite-state machines
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/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.1968.229125openalex-snapshot
Variable-Length Distinguishing Sequences and Their Application to 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/2964500openalex-snapshot
Edward F. Moore. Gedanken-experiments on sequential machines. Automata studies, edited by C. E. Shannon and J. McCarthy, Annals of Mathematics studies no. 34, litho-printed, Princeton University Press, Princeton1956, pp. 129–153.
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/11569596_93openalex-snapshot
Generalizing Redundancy Elimination in Checking Sequences
inferred← citeshttps://doi.org/10.1007/11754008_18openalex-snapshot
Reducing the Lengths of Checking Sequences by Overlapping
inferred← citeshttps://doi.org/10.1007/978-3-319-25945-1_2openalex-snapshot
Using Multiple Adaptive Distinguishing Sequences for Checking Sequence Generation
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-540-76650-6_11openalex-snapshot
Reducing Test Sequence Length Using Invertible Sequences
inferred← citeshttps://doi.org/10.1007/978-3-540-88194-0_7openalex-snapshot
An Approach to Testing with Embedded Context Using Model Checker
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.1007/s10703-014-0205-0openalex-snapshot
Hardness and inapproximability of minimizing adaptive distinguishing 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.1093/comjnl/bxv122openalex-snapshot
Reducing FSM-Based Test Suites with Guaranteed Fault Coverage
inferred← citeshttps://doi.org/10.1109/apsec.2005.5openalex-snapshot
A bipartite graph approach to generate optimal test sequences for protocol conformance testing using the Wp-method
inferred← citeshttps://doi.org/10.1109/icstw.2009.25openalex-snapshot
Checking Sequence Generation Using State Distinguishing Subsequences
inferred← citeshttps://doi.org/10.1109/ifcsta.2009.101openalex-snapshot
A Match-Based Approach to Optimize Conformance Test Sequence Generation Using Mp-Method
inferred← citeshttps://doi.org/10.1109/sefm.2009.12openalex-snapshot
Checking Sequence Construction Using Adaptive and Preset Distinguishing Sequences
inferred← citeshttps://doi.org/10.1109/tse.2025.3604472openalex-snapshot
Efficient State Identification for Finite State Machine-Based Testing
inferred← citeshttps://doi.org/10.1145/1143997.1144318openalex-snapshot
Reformulation of the generation of conformance testing sequences to the asymmetric travelling salesman problem
inferred← citeshttps://doi.org/10.1145/1363686.1363850openalex-snapshot
Using adaptive distinguishing sequences in checking sequence constructions
inferred← citeshttps://doi.org/10.11606/d.55.2008.tde-18062008-135859openalex-snapshot
Minimização de conjuntos de casos de teste para máquinas de estados finitos
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/d.55.2013.tde-10072013-164922openalex-snapshot
Estratégia para geração de sequencias 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.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.