On the public citation graph
On minimizing the lengths of checking sequences
0 signed · 121 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.1006/jcss.1995.1019openalex-snapshot
Testing Finite State Machines: Fault Detection
inferredcites →https://doi.org/10.1007/978-1-349-03521-2openalex-snapshot
Graph Theory with Applications
inferredcites →https://doi.org/10.1007/bf01580113openalex-snapshot
Matching, Euler tours and the Chinese postman
inferredcites →https://doi.org/10.1109/12.272431openalex-snapshot
Testing finite-state machines: state identification and verification
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/26.156631openalex-snapshot
Protocol conformance testing using multiple UIO sequences
inferredcites →https://doi.org/10.1109/32.16602openalex-snapshot
Formal methods for protocol testing: a detailed study
inferredcites →https://doi.org/10.1109/32.92918openalex-snapshot
On the complexity of generating optimal test sequences
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.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.1002/(sici)1099-1689(199909)9:3<143::aid-stvr187>3.0.co;2-iopenalex-snapshot
Editorial
inferred← citeshttps://doi.org/10.1002/stvr.1626openalex-snapshot
Test suite completeness and black box testing
inferred← citeshttps://doi.org/10.1002/stvr.1796openalex-snapshot
GPU acceleration of finite state machine input execution: Improving scale and performance
inferred← citeshttps://doi.org/10.1007/11430230_11openalex-snapshot
Eliminating Redundant Tests in a Checking Sequence
inferred← citeshttps://doi.org/10.1007/11569596_93openalex-snapshot
Generalizing Redundancy Elimination in Checking Sequences
inferred← citeshttps://doi.org/10.1007/11754008_14openalex-snapshot
Detecting Observability Problems in Distributed Testing
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/11754008_18openalex-snapshot
Reducing the Lengths of Checking Sequences by Overlapping
inferred← citeshttps://doi.org/10.1007/11888116_32openalex-snapshot
Minimizing Coordination Channels in Distributed Testing
inferred← citeshttps://doi.org/10.1007/11901433_25openalex-snapshot
Conditions for Avoiding Controllability Problems in Distributed Testing
inferred← citeshttps://doi.org/10.1007/3-540-44830-6_12openalex-snapshot
Generating Checking Sequences for a Distributed Test Architecture
inferred← citeshttps://doi.org/10.1007/3-540-45745-3_15openalex-snapshot
Towards Specification-Based Web Testing
inferred← citeshttps://doi.org/10.1007/3-540-45785-2_27openalex-snapshot
Expressing Graphical User’s Input for Test Specifications
inferred← citeshttps://doi.org/10.1007/978-3-319-10431-7_8openalex-snapshot
Test Suite Completeness and Partial Models
inferred← citeshttps://doi.org/10.1007/978-3-319-10882-7_6openalex-snapshot
Partial Models and Weak Equivalence
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-319-47443-4_7openalex-snapshot
Parallelizing Heuristics for Generating Synchronizing Sequences
inferred← citeshttps://doi.org/10.1007/978-3-319-51963-0_12openalex-snapshot
Hardness of Deriving Invertible Sequences from Finite State Machines
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-78917-8_5openalex-snapshot
Testing in the Distributed Test Architecture
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/978-3-662-44857-1_3openalex-snapshot
Lookahead-Based Approaches for Minimizing Adaptive Distinguishing Sequences
inferred← citeshttps://doi.org/10.1007/s00165-005-0083-8openalex-snapshot
Constructing checking sequences for distributed testing
inferred← citeshttps://doi.org/10.1007/s00165-009-0135-6openalex-snapshot
Lower bounds on lengths of checking sequences
inferred← citeshttps://doi.org/10.1007/s001650070003openalex-snapshot
Testing Conformance to a Quasi-Non-Deterministic Stream X-Machine
inferred← citeshttps://doi.org/10.1007/s00446-008-0062-4openalex-snapshot
Checking sequences for distributed test architectures
inferred← citeshttps://doi.org/10.1007/s10009-015-0404-zopenalex-snapshot
Advances in test generation for testing software and systems
inferred← citeshttps://doi.org/10.1007/s10515-006-7739-3openalex-snapshot
Separating sequence overlap for automated test sequence generation
inferred← citeshttps://doi.org/10.1007/s10515-009-0061-0openalex-snapshot
Generating a checking sequence with a minimum number of reset transitions
inferred← citeshttps://doi.org/10.1007/s10703-014-0205-0openalex-snapshot
Hardness and inapproximability of minimizing adaptive distinguishing sequences
inferred← citeshttps://doi.org/10.1007/s11741-008-0512-3openalex-snapshot
Multiple UIO-based test sequence generation for distributed systems
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.ic.2023.105009openalex-snapshot
Removing redundant refusals: Minimal complete test suites for failure trace semantics
inferred← citeshttps://doi.org/10.1016/j.infsof.2005.08.001openalex-snapshot
Improving test quality using robust unique input/output circuit sequences (UIOCs)
inferred← citeshttps://doi.org/10.1016/j.infsof.2010.07.001openalex-snapshot
FSM-based conformance testing methods: A survey annotated with experimental evaluation
inferred← citeshttps://doi.org/10.1016/j.infsof.2013.01.001openalex-snapshot
Evaluating test suite characteristics, cost, and effectiveness of FSM-based testing methods
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.infsof.2017.07.012openalex-snapshot
Experimental comparison of approaches for checking completeness of test suites from finite state machines
inferred← citeshttps://doi.org/10.1016/j.ins.2021.05.072openalex-snapshot
Synchronizing billion-scale automata
inferred← citeshttps://doi.org/10.1016/j.jpdc.2020.02.009openalex-snapshot
Multicore and manycore parallelization of cheap synchronizing sequence heuristics
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.1016/j.scico.2019.03.004openalex-snapshot
FSM quasi-equivalence testing via reduction and observing absences
inferred← citeshttps://doi.org/10.1016/j.scico.2024.103135openalex-snapshot
Unifying frameworks for complete test strategies
inferred← citeshttps://doi.org/10.1016/j.scico.2024.103173openalex-snapshot
Model independent refusal trace testing
inferred← citeshttps://doi.org/10.1016/j.tcs.2004.04.002openalex-snapshot
Testing conformance of a deterministic implementation against a non-deterministic stream X-machine
inferred← citeshttps://doi.org/10.1016/j.tcs.2010.05.014openalex-snapshot
Checking experiments for stream X-machines
inferred← citeshttps://doi.org/10.1016/s0950-5849(00)00145-2openalex-snapshot
Testing a system specified using Statecharts and Z
inferred← citeshttps://doi.org/10.1016/s0950-5849(01)00169-0openalex-snapshot
Testing a distributed system: generating minimal synchronised test sequences that detect output-shifting faults
inferred← citeshttps://doi.org/10.1016/s0950-5849(99)00038-5openalex-snapshot
Efficient checking sequences for testing finite state machines
inferred← citeshttps://doi.org/10.1023/a:1021634422504openalex-snapshot
Specification-based Testing for Gui-based Applications
inferred← citeshttps://doi.org/10.1093/comjnl/40.4.220openalex-snapshot
Testing from a Finite-State Machine: Extending Invertibility to Sequences
inferred← citeshttps://doi.org/10.1093/comjnl/41.5.349openalex-snapshot
Adaptive Testing of a Deterministic Implementation Against a Nondeterministic Finite State Machine
inferred← citeshttps://doi.org/10.1093/comjnl/bxl003openalex-snapshot
Automated Unique Input Output Sequence Generation for Conformance Testing of FSMs
inferred← citeshttps://doi.org/10.1093/comjnl/bxv122openalex-snapshot
Reducing FSM-Based Test Suites with Guaranteed Fault Coverage
inferred← citeshttps://doi.org/10.1093/comjnl/bxw069openalex-snapshot
Distinguishing Sequences for Distributed Testing: Preset Distinguishing Sequences
inferred← citeshttps://doi.org/10.1109/apsec.2018.00025openalex-snapshot
Accelerated Finite State Machine Test Execution Using GPUs
inferred← citeshttps://doi.org/10.1109/hase.2007.35openalex-snapshot
Design of a Fairness Guarantee Mechanism Based on Network Measurement
inferred← citeshttps://doi.org/10.1109/hicss.2001.927256openalex-snapshot
A GUI environment to manipulate FSMs tor testing GUI-based applications in Java
inferred← citeshttps://doi.org/10.1109/icnisc.2015.64openalex-snapshot
Improved Web Page Traverse Using Genetic Algorithm
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.1109/ismvl51352.2021.00028openalex-snapshot
On Distinguishing Sequences of Several Classes of Reversible Finite State Machines
inferred← citeshttps://doi.org/10.1109/lics52264.2021.9470737openalex-snapshot
Removing Redundant Refusals: Minimal Complete Test Suites for Failure Trace Semantics
inferred← citeshttps://doi.org/10.1109/qsic.2006.46openalex-snapshot
Optimal Synchronizable Test Sequence from Test Segments
inferred← citeshttps://doi.org/10.1109/qsic.2009.21openalex-snapshot
Web Traversal with a History Stack
inferred← citeshttps://doi.org/10.1109/sefm.2008.17openalex-snapshot
A Generalized Model-Based Test Generation 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/tase.2010.14openalex-snapshot
An Improved Algorithm for Building the Characterizing Set
inferred← citeshttps://doi.org/10.1109/tc.2002.1032630openalex-snapshot
Reduced length checking sequences
inferred← citeshttps://doi.org/10.1109/tc.2002.1032631openalex-snapshot
Computing the shortest network under a fixed topology
inferred← citeshttps://doi.org/10.1109/tc.2002.1032632openalex-snapshot
Computing the shortest network under a fixed topology
inferred← citeshttps://doi.org/10.1109/tc.2006.80openalex-snapshot
Optimizing the length of checking sequences
inferred← citeshttps://doi.org/10.1109/tc.2008.173openalex-snapshot
Correction to "Reduced Length Checking Sequences" [Sep 02 93-99]
inferred← citeshttps://doi.org/10.1109/tc.2010.17openalex-snapshot
Checking Completeness of Tests for Finite State Machines
inferred← citeshttps://doi.org/10.1109/tc.2012.252openalex-snapshot
Verifying and Comparing Finite State Machines for Systems that Have Distributed Interfaces
inferred← citeshttps://doi.org/10.1109/test.1999.805762openalex-snapshot
Checking sequence generation for asynchronous sequential elements
inferred← citeshttps://doi.org/10.1109/tse.2004.31openalex-snapshot
FSM-based incremental conformance testing methods
inferred← citeshttps://doi.org/10.1109/tse.2016.2539964openalex-snapshot
Parallel Algorithms for Testing Finite State Machines:Generating UIO 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.1142/s0129054112500013openalex-snapshot
MODEL PARTITIONS AND COMPACT TEST CASE SUITES
inferred← citeshttps://doi.org/10.1142/s0129054115500057openalex-snapshot
Complexities of Some Problems Related to Synchronizing, Non-Synchronizing and Monotonic Automata
inferred← citeshttps://doi.org/10.1145/1363686.1363850openalex-snapshot
Using adaptive distinguishing sequences in checking sequence constructions
inferred← citeshttps://doi.org/10.1145/1459352.1459354openalex-snapshot
Using formal specifications to support testing
inferred← citeshttps://doi.org/10.1145/1538942.1538944openalex-snapshot
Verdict functions in testing with a fault domain or test hypotheses
inferred← citeshttps://doi.org/10.1145/2554850.2554968openalex-snapshot
On the completeness of test suites
inferred← citeshttps://doi.org/10.1145/3051121openalex-snapshot
Parallel Algorithms for Generating Distinguishing Sequences for Observable Non-deterministic FSMs
inferred← citeshttps://doi.org/10.1145/606612.606615openalex-snapshot
Comparing test sets and criteria in the presence of test hypotheses and fault domains
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.2009.tde-30032010-161638openalex-snapshot
Avaliação de custo e eficácia de métodos e critérios de teste baseado em 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.2012.tde-10092012-100529openalex-snapshot
Subsídios para a aplicação de métodos de geração de casos de testes baseados em máquinas de estados
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.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.1186/s40537-021-00535-6openalex-snapshot
Efficient parallel derivation of short distinguishing sequences for nondeterministic finite state machines using MapReduce
inferred← citeshttps://doi.org/10.14279/tuj.eceasst.70.981openalex-snapshot
A Constraint-Solving Approach for Achieving Minimal-Reset Transition Coverage of Smartcard Behaviour
inferred← citeshttps://doi.org/10.3906/elk-1809-1openalex-snapshot
Parallel brute-force algorithm for deriving reset sequences from deterministic incomplete finite automata
inferred← citeshttps://doi.org/10.48550/arxiv.1108.5295openalex-snapshot
Checking Finite State Machine Conformance when there are Distributed Observations
inferred← citeshttps://doi.org/10.48550/arxiv.1508.02767openalex-snapshot
Intrinsic Properties of Complete Test Suites
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.