On the public citation graph
Testing Finite State Machines: Fault Detection
0 signed · 84 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 points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/stvr.1806openalex-snapshot
Effective grey‐box testing with partial FSM models
inferred← citeshttps://doi.org/10.1007/11430230_10openalex-snapshot
Coping with Nondeterminism in Network Protocol Testing
inferred← citeshttps://doi.org/10.1007/11562436_16openalex-snapshot
An Improved Conformance Testing Method
inferred← citeshttps://doi.org/10.1007/3-540-45510-8_10openalex-snapshot
Fault Model-Driven Test Derivation from Finite State Models: Annotated Bibliography
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-0-387-34988-6_7openalex-snapshot
An adaptive test sequences generation method for the users needs
inferred← citeshttps://doi.org/10.1007/978-0-387-35062-2_10openalex-snapshot
Testing deterministic implementations from nondeterministic FSM specifications
inferred← citeshttps://doi.org/10.1007/978-0-387-35079-0_26openalex-snapshot
Validation-Based Test Sequence Generation for Networks of Extended Finite State Machines
inferred← citeshttps://doi.org/10.1007/978-0-387-35198-8_10openalex-snapshot
Developments in testing transition systems
inferred← citeshttps://doi.org/10.1007/978-0-387-35198-8_17openalex-snapshot
Fault detection in embedded components
inferred← citeshttps://doi.org/10.1007/978-0-387-35198-8_23openalex-snapshot
Modeling and Testing of Protocol Systems
inferred← citeshttps://doi.org/10.1007/978-0-387-35381-4_1openalex-snapshot
Testing of automata: from experiments to representations by means of fragments
inferred← citeshttps://doi.org/10.1007/978-0-387-35381-4_9openalex-snapshot
Test suite minimization for testing in context
inferred← citeshttps://doi.org/10.1007/978-0-387-35497-2_26openalex-snapshot
FSM Based Re-Testing Methods
inferred← citeshttps://doi.org/10.1007/978-0-387-35516-0_3openalex-snapshot
Fault Detection Power of a Widely Used Test Suite for a System of Communicating FSMs
inferred← citeshttps://doi.org/10.1007/978-0-387-35533-7_12openalex-snapshot
Systematic Performance Evaluation of Multipoint Protocols
inferred← citeshttps://doi.org/10.1007/978-0-387-35533-7_6openalex-snapshot
On Test Derivation from Partial Specifications
inferred← citeshttps://doi.org/10.1007/978-0-387-35567-2_14openalex-snapshot
Test Generation Driven by User-Defined Fault Models
inferred← citeshttps://doi.org/10.1007/978-0-387-35567-2_15openalex-snapshot
Test Suite Minimization for Embedded Nondeterministic Finite State Machines
inferred← citeshttps://doi.org/10.1007/978-3-030-02508-3_19openalex-snapshot
Checking Sequence Generation for Symbolic Input/Output FSMs by Constraint Solving
inferred← citeshttps://doi.org/10.1007/978-3-030-40914-2_10openalex-snapshot
State Identification for Labeled Transition Systems with Inputs and Outputs
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-22635-4_15openalex-snapshot
Generating Minimum Height ADSs for Partially Specified Finite State Machines
inferred← citeshttps://doi.org/10.1007/978-3-319-25945-1_1openalex-snapshot
Checking Experiments for Finite State Machines with Symbolic Inputs
inferred← citeshttps://doi.org/10.1007/978-3-319-67549-7_8openalex-snapshot
From Passive to Active FSM Inference via Checking Sequence Construction
inferred← citeshttps://doi.org/10.1007/978-3-540-27836-8_6openalex-snapshot
Testing, Optimizaton, and Games
inferred← citeshttps://doi.org/10.1007/978-3-540-73066-8_17openalex-snapshot
A Bounded Incremental Test Generation Algorithm for Finite State Machines
inferred← citeshttps://doi.org/10.1007/978-3-540-73770-4_6openalex-snapshot
Automatic Testing from Formal Specifications
inferred← citeshttps://doi.org/10.1007/978-3-642-05031-2_5openalex-snapshot
Testing Timed Finite State Machines with Guaranteed Fault Coverage
inferred← citeshttps://doi.org/10.1007/978-981-16-6940-8_12openalex-snapshot
Transfer Fault Detection in Finite State Machines Using Deep Neural Networks
inferred← citeshttps://doi.org/10.1007/s10270-017-0613-xopenalex-snapshot
Toward testing from finite state machines with symbolic inputs and outputs
inferred← citeshttps://doi.org/10.1007/s11219-018-9429-3openalex-snapshot
FSM inference and checking sequence construction are two sides of the same coin
inferred← citeshttps://doi.org/10.1016/0140-3664(96)81589-1openalex-snapshot
Construction of checking sequences based on characterization sets
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.ipl.2015.01.002openalex-snapshot
Reduced checking sequences using unreliable reset
inferred← citeshttps://doi.org/10.1016/j.scico.2013.09.008openalex-snapshot
A practical approach for testing timed deterministic finite state machines with single clock
inferred← citeshttps://doi.org/10.1016/j.scico.2021.102678openalex-snapshot
State identification for labeled transition systems with inputs and outputs
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.1109/12.272431openalex-snapshot
Testing finite-state machines: state identification and verification
inferred← citeshttps://doi.org/10.1109/12.559807openalex-snapshot
On minimizing the lengths of checking sequences
inferred← citeshttps://doi.org/10.1109/5.533956openalex-snapshot
Principles and methods of testing finite state machines-a survey
inferred← citeshttps://doi.org/10.1109/ase.1999.802094openalex-snapshot
An automatic and optimized test generation technique applying to TCP/IP protocol
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/icnp.1993.340890openalex-snapshot
Probabilistic conformance testing of protocols with unobservable transitions
inferred← citeshttps://doi.org/10.1109/icnp.1993.340917openalex-snapshot
Reverse-engineering of communication protocols
inferred← citeshttps://doi.org/10.1109/icnp.1996.564905openalex-snapshot
Optimization problems from feature testing of communication protocols
inferred← citeshttps://doi.org/10.1109/icnp.1997.643699openalex-snapshot
Passive testing and applications to network management
inferred← citeshttps://doi.org/10.1109/icpp.1996.537385openalex-snapshot
Randomized parallel algorithms for the homing sequence problem
inferred← citeshttps://doi.org/10.1109/icstw.2016.9openalex-snapshot
Checking Experiments for Symbolic Input/Output Finite State Machines
inferred← citeshttps://doi.org/10.1109/isdcs52006.2021.9397900openalex-snapshot
A Deep Neural Network Guided Testing Approach for Finite State Machines
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/lics.2004.1319602openalex-snapshot
Testing, optimization, and games
inferred← citeshttps://doi.org/10.1109/sefm.2005.17openalex-snapshot
Experimental evaluation of FSM-based testing methods
inferred← citeshttps://doi.org/10.1109/sibcon.2015.7147095openalex-snapshot
Verification of timed Finite State Machines
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.2005.152openalex-snapshot
Testing from Partial Deterministic FSM Specifications
inferred← citeshttps://doi.org/10.1109/tnet.2003.822643openalex-snapshot
The STRESS Method for Boundary-Point Performance Analysis of End-to-End Multicast Timer-Suppression Mechanisms
inferred← citeshttps://doi.org/10.1109/tse.2003.1245304openalex-snapshot
Automatic detection and diagnosis of faults in generated code for procedure calls
inferred← citeshttps://doi.org/10.1109/tse.2004.31openalex-snapshot
FSM-based incremental conformance testing methods
inferred← citeshttps://doi.org/10.1109/tse.2025.3604472openalex-snapshot
Efficient State Identification for Finite State Machine-Based Testing
inferred← citeshttps://doi.org/10.1134/s0361768812040019openalex-snapshot
FSM-based testing from user defined faults adapted to incremental and mutation testing
inferred← citeshttps://doi.org/10.1142/s0218126622501560openalex-snapshot
Conformance Testing for Finite State Machines Guided by Deep Neural Network
inferred← citeshttps://doi.org/10.1145/225058.225161openalex-snapshot
Distinguishing tests for nondeterministic and probabilistic machines
inferred← citeshttps://doi.org/10.1145/231379.231431openalex-snapshot
Target-sensitive construction of diagnostic programs for procedure calling sequence generators
inferred← citeshttps://doi.org/10.1145/249069.231431openalex-snapshot
Target-sensitive construction of diagnostic programs for procedure calling sequence generators
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/t.55.2011.tde-17082011-153853openalex-snapshot
Contribuições para o Teste de Software
inferred← citeshttps://doi.org/10.1287/opre.45.6.842openalex-snapshot
A New and Fast Approach to Very Large Scale Integrated Sequential Circuit Test Generation
inferred← citeshttps://doi.org/10.18130/v3c272openalex-snapshot
CSDL: Reusable Computing System Descriptions for Retargetable Systems Software
inferred← citeshttps://doi.org/10.3115/1118053.1118058openalex-snapshot
Verification and validation of language processing systems
inferred← citeshttps://doi.org/10.3233/fi-2014-972openalex-snapshot
The Incremental Maintenance of Transition Tour
inferred← citeshttps://doi.org/10.36244/icj.2021.3.6openalex-snapshot
Test generation algorithm for the All-Transition-State criteria of Finite State Machines
inferred← citeshttps://doi.org/10.47749/t/unicamp.2010.777420openalex-snapshot
Geração automática de casos de testes para máquinas de estados finitos
inferred← citeshttps://doi.org/10.48550/arxiv.1811.11119openalex-snapshot
Fault Detection for Timed FSM with Timeouts by Constraint Solving
inferred← citeshttps://doi.org/10.5555/1070432.1070594openalex-snapshot
Conformance testing in the presence of multiple faults
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.