On the public citation graph

On reducing test length for FSMs with extra states

0 signed · 57 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/11562436_16openalex-snapshot
An Improved Conformance Testing Method
inferredcites →https://doi.org/10.1007/978-0-387-34988-6_19openalex-snapshot
Handling redundant and additional states in protocol testing
inferredcites →https://doi.org/10.1007/978-0-387-35567-2_14openalex-snapshot
Test Generation Driven by User-Defined Fault Models
inferredcites →https://doi.org/10.1007/978-3-540-68524-1_12openalex-snapshot
Generating Checking Sequences for Partial Reduced Finite State Machines
inferredcites →https://doi.org/10.1007/978-3-642-05031-2_9openalex-snapshot
Generating Reduced Tests for FSMs with Extra States
inferredcites →https://doi.org/10.1007/bf01068590openalex-snapshot
Failure diagnosis of automata
inferredcites →https://doi.org/10.1109/32.87284openalex-snapshot
Test selection based on finite state models
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/icstw.2009.25openalex-snapshot
Checking Sequence Generation Using State Distinguishing Subsequences
inferredcites →https://doi.org/10.1109/swct.1964.7openalex-snapshot
Derivation of optimum test sequencies for sequential 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.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.1145/116873.116878openalex-snapshot
Data structures and algorithms for disjoint set union problems
inferredcites →https://doi.org/10.1145/186258.187153openalex-snapshot
Protocol testing
inferredcites →https://doi.org/10.1145/505863.505884openalex-snapshot
Testing object-oriented systems
inferredcites →https://doi.org/10.1515/9781400882618-006openalex-snapshot
Gedanken-Experiments on Sequential 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/stvr.1626openalex-snapshot
Test suite completeness and black box testing
inferred← citeshttps://doi.org/10.1002/stvr.1806openalex-snapshot
Effective grey‐box testing with partial FSM models
inferred← citeshttps://doi.org/10.1007/978-3-030-40914-2_4openalex-snapshot
Minimizing Characterizing Sets
inferred← citeshttps://doi.org/10.1007/978-3-030-61467-6_28openalex-snapshot
New Distribution Paradigms for Railway Interlocking
inferred← citeshttps://doi.org/10.1007/978-3-031-40132-9_4openalex-snapshot
Conformance Relations Between Input/Output Languages
inferred← citeshttps://doi.org/10.1007/978-3-031-61716-4_15openalex-snapshot
A New Perspective on Conformance Testing Based on Apartness
inferred← citeshttps://doi.org/10.1007/978-3-319-06200-6_5openalex-snapshot
Distinguishing Sequences for Partially Specified FSMs
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-47443-4_7openalex-snapshot
Parallelizing Heuristics for Generating Synchronizing 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.1007/s11219-018-9421-yopenalex-snapshot
Safety-complete test suites
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.infsof.2020.106297openalex-snapshot
State identification sequences from the splitting tree
inferred← citeshttps://doi.org/10.1016/j.infsof.2020.106498openalex-snapshot
Using mutual information to test from Finite State Machines: Test suite selection
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.2022.111391openalex-snapshot
Using mutual information to test from Finite State Machines: Test suite generation
inferred← citeshttps://doi.org/10.1016/j.jss.2026.113077openalex-snapshot
Deriving exhaustive test suites for Timed Finite State Machines with output delays
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.2019.04.004openalex-snapshot
Finite complete suites for CSP refinement testing
inferred← citeshttps://doi.org/10.1016/j.scico.2021.102645openalex-snapshot
Minimizing Characterizing sets
inferred← citeshttps://doi.org/10.1016/j.scico.2023.103053openalex-snapshot
Testing and incremental conformance testing of timed state machines
inferred← citeshttps://doi.org/10.1016/j.scico.2024.103135openalex-snapshot
Unifying frameworks for complete test strategies
inferred← citeshttps://doi.org/10.1093/comjnl/bxv041openalex-snapshot
Incomplete Distinguishing Sequences for Finite State Machines
inferred← citeshttps://doi.org/10.1093/comjnl/bxz056openalex-snapshot
Observation Tree Approach: Active Learning Relying on Testing
inferred← citeshttps://doi.org/10.1109/hase.2014.39openalex-snapshot
Adaptive Testing of Nondeterministic Systems with FSM
inferred← citeshttps://doi.org/10.1109/icstw.2018.00050openalex-snapshot
SPYH-Method: An Improvement in Testing of Finite-State Machines
inferred← citeshttps://doi.org/10.1109/models58315.2023.00012openalex-snapshot
An Experimental Evaluation of Conformance Testing Techniques in Active Automata Learning
inferred← citeshttps://doi.org/10.1109/tc.2016.2532869openalex-snapshot
Parallel Algorithms for Generating Harmonised State Identifiers and Characterising Sets
inferred← citeshttps://doi.org/10.1109/tse.2023.3291137openalex-snapshot
Incomplete Adaptive Distinguishing Sequences for Non-Deterministic FSMs
inferred← citeshttps://doi.org/10.1109/tse.2024.3358416openalex-snapshot
Accelerating Finite State Machine-Based Testing Using Reinforcement Learning
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/s0218194016500091openalex-snapshot
Input Contract Testing of Graphical User Interfaces
inferred← citeshttps://doi.org/10.1145/2554850.2554968openalex-snapshot
On the completeness of test suites
inferred← citeshttps://doi.org/10.11648/j.ajesa.20130101.11openalex-snapshot
Examination of the Possibilities for Integrated Testing of Embedded Systems
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.48550/arxiv.1508.02767openalex-snapshot
Intrinsic Properties of Complete Test Suites
inferred← citeshttps://doi.org/10.48550/arxiv.2105.11786openalex-snapshot
Complete Requirements-based Testing with Finite State Machines
inferred← citeshttps://doi.org/10.70675/4798deadzb5fcz4c8cz8355z2bca7671686dopenalex-snapshot
Modèle de calcul massivement parallèle en MapReduce pour quelques problèmes en théorie des automates
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.