On the public citation graph
Effective grey‐box testing with partial FSM models
0 signed · 49 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.1002/stvr.452openalex-snapshot
On reducing test length for FSMs with extra states
inferredcites →https://doi.org/10.1006/jcss.1995.1019openalex-snapshot
Testing Finite State Machines: Fault Detection
inferredcites →https://doi.org/10.1007/11562436_16openalex-snapshot
An Improved Conformance Testing Method
inferredcites →https://doi.org/10.1007/11759744_9openalex-snapshot
Conformance Tests as Checking Experiments for Partial Nondeterministic FSM
inferredcites →https://doi.org/10.1007/11809678_34openalex-snapshot
Improved On-Line Broadcast Scheduling with Deadlines
inferredcites →https://doi.org/10.1007/978-0-387-35062-2_10openalex-snapshot
Testing deterministic implementations from nondeterministic FSM specifications
inferredcites →https://doi.org/10.1007/978-0-387-35079-0_10openalex-snapshot
Fault models for testing in context
inferredcites →https://doi.org/10.1007/978-3-031-04673-5_4openalex-snapshot
Testing Against Non-deterministic FSMs: A Probabilistic Approach for Test Suite Minimization
inferredcites →https://doi.org/10.1007/978-3-319-33951-1_3openalex-snapshot
A Novel Approach to HW/SW Integration Testing of Route-Based Interlocking System Controllers
inferredcites →https://doi.org/10.1007/978-3-319-67549-7_2openalex-snapshot
Fault-Based Testing for Refinement in CSP
inferredcites →https://doi.org/10.1007/978-3-540-78917-8_1openalex-snapshot
Model Based Testing with Labelled Transition Systems
inferredcites →https://doi.org/10.1007/978-3-642-24580-0_12openalex-snapshot
Adaptive Testing of Deterministic Implementations Specified by Nondeterministic FSMs
inferredcites →https://doi.org/10.1007/s00165-016-0402-2openalex-snapshot
Complete model-based equivalence class testing for nondeterministic systems
inferredcites →https://doi.org/10.1007/s10009-014-0356-8openalex-snapshot
Complete model-based equivalence class testing
inferredcites →https://doi.org/10.1007/s10270-017-0595-8openalex-snapshot
Experimental evaluation of a novel equivalence class partition testing strategy
inferredcites →https://doi.org/10.1016/0304-3975(79)90041-0openalex-snapshot
On the reachability problem for 5-dimensional vector addition systems
inferredcites →https://doi.org/10.1016/0378-4754(81)90068-9openalex-snapshot
Introduction to automata theory, languages and computation
inferredcites →https://doi.org/10.1016/b978-1-78548-171-0.50001-3openalex-snapshot
SysML: Object Management Group (OMG) Systems Modeling Language
inferredcites →https://doi.org/10.1016/j.scico.2019.03.004openalex-snapshot
FSM quasi-equivalence testing via reduction and observing absences
inferredcites →https://doi.org/10.1016/j.scico.2019.04.004openalex-snapshot
Finite complete suites for CSP refinement testing
inferredcites →https://doi.org/10.1016/j.tcs.2006.06.015openalex-snapshot
The worst-case time complexity for generating all maximal cliques and computational experiments
inferredcites →https://doi.org/10.1093/comjnl/bxy086openalex-snapshot
Incremental and Heuristic Approaches for Deriving Adaptive Distinguishing Test Cases for Non-deterministic Finite-State Machines
inferredcites →https://doi.org/10.1109/32.16602openalex-snapshot
Formal methods for protocol testing: a detailed study
inferredcites →https://doi.org/10.1109/32.265636openalex-snapshot
Test selection based on communicating nondeterministic finite-state machines using a generalized Wp-method
inferredcites →https://doi.org/10.1109/hase.2014.39openalex-snapshot
Adaptive Testing of Nondeterministic Systems with FSM
inferredcites →https://doi.org/10.1109/icstw.2018.00050openalex-snapshot
SPYH-Method: An Improvement in Testing of Finite-State Machines
inferredcites →https://doi.org/10.1109/tc.2004.85openalex-snapshot
Testing from a nondeterministic finite state machine using adaptive state counting
inferredcites →https://doi.org/10.1109/tc.2005.152openalex-snapshot
Testing from Partial Deterministic FSM Specifications
inferredcites →https://doi.org/10.1109/tse.1978.231496openalex-snapshot
Testing Software Design Modeled by Finite-State Machines
inferredcites →https://doi.org/10.1109/tse.2017.2652457openalex-snapshot
Testing from Partial Finite State Machines without Harmonised Traces
inferredcites →https://doi.org/10.1134/s0361768812040019openalex-snapshot
FSM-based testing from user defined faults adapted to incremental and mutation testing
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-031-40132-9_3openalex-snapshot
Implementation Relations for Distributed Testing
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-42441-0_5openalex-snapshot
An Optimised Complete Strategy for Testing Symbolic Finite State Machines
inferred← citeshttps://doi.org/10.1007/978-3-031-67114-2_7openalex-snapshot
On the Unification of Conformance Notions
inferred← citeshttps://doi.org/10.1007/978-3-032-05188-2_4openalex-snapshot
On Using Homing Sequences Instead of Distinguishing in FSM-Based Testing
inferred← citeshttps://doi.org/10.1007/s11219-026-09783-2openalex-snapshot
Optimizing model-based generated tests for safety-critical embedded software
inferred← citeshttps://doi.org/10.1016/j.scico.2024.103135openalex-snapshot
Unifying frameworks for complete test strategies
inferred← citeshttps://doi.org/10.1109/access.2025.3563337openalex-snapshot
Action-State Testing—A Model for Test Design Automation
inferred← citeshttps://doi.org/10.1109/icstw60967.2024.00020openalex-snapshot
Optimizing Model-based Generated Tests: Leveraging Machine Learning for Test Reduction
inferred← citeshttps://doi.org/10.1109/icstw64639.2025.10962489openalex-snapshot
Automata Learning for React Web Applications
inferred← citeshttps://doi.org/10.1145/3801960openalex-snapshot
Reactive Model-Based Testing of Cyclic Systems
inferred← citeshttps://doi.org/10.3390/app122211435openalex-snapshot
Self-Organized Fuzzy Neural Network Nonlinear System Modeling Method Based on Clustering Algorithm
inferred← citeshttps://doi.org/10.37899/journallamultiapp.v3i3.648openalex-snapshot
Review of Software Testing Methods
inferred← citeshttps://doi.org/10.56134/jst.v1i2.19openalex-snapshot
Development of Client Server-Based Queuing Applications at The Samsat Gowa Office
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.