On the public citation graph
Conformance Tests as Checking Experiments for Partial Nondeterministic FSM
0 signed · 79 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/11430230_10openalex-snapshot
Coping with Nondeterminism in Network Protocol Testing
inferredcites →https://doi.org/10.1007/978-0-387-34883-4_6openalex-snapshot
Selecting Test Sequences for Partially-Specified Nondeterministic Finite State Machines
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-35381-4_7openalex-snapshot
Distinguishing tests for nondeterministic finite state machines
inferredcites →https://doi.org/10.1007/978-0-387-35533-7_6openalex-snapshot
On Test Derivation from Partial Specifications
inferredcites →https://doi.org/10.1007/978-3-540-39979-7_19openalex-snapshot
Concerning the Ordering of Adaptive Test Sequences
inferredcites →https://doi.org/10.1016/s0140-3664(00)00327-3openalex-snapshot
Test selection for a nondeterministic FSM
inferredcites →https://doi.org/10.1049/sej.1993.0024openalex-snapshot
A test generation algorithm for systems modelled as non-deterministic FSMs
inferredcites →https://doi.org/10.1093/comjnl/41.5.349openalex-snapshot
Adaptive Testing of a Deterministic Implementation Against a Nondeterministic Finite State Machine
inferredcites →https://doi.org/10.1093/comjnl/46.3.307openalex-snapshot
Generating Candidates When Testing a Deterministic Implementation against a Non-deterministic Finite-state Machine
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/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.2003.1166585openalex-snapshot
Optimal transfer trees and distinguishing trees for testing observable nondeterministic finite-state machines
inferredcites →https://doi.org/10.1145/1007512.1007520openalex-snapshot
Optimal strategies for testing nondeterministic systems
inferredcites →https://doi.org/10.1145/1013886.1007520openalex-snapshot
Optimal strategies for testing nondeterministic systems
inferredcites →https://doi.org/10.1145/225058.225161openalex-snapshot
Distinguishing tests for nondeterministic and probabilistic 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.1806openalex-snapshot
Effective grey‐box testing with partial FSM models
inferred← citeshttps://doi.org/10.1002/stvr.374openalex-snapshot
Studying the separability relation between finite state machines
inferred← citeshttps://doi.org/10.1007/978-3-030-31280-0_6openalex-snapshot
Evaluating the Complexity of Deriving Adaptive Homing, Synchronizing and Distinguishing Sequences for Nondeterministic FSMs
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-031-13502-6_12openalex-snapshot
Adaptive Experiments for State Identification in Finite State Machines with Timeouts
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-43240-8_15openalex-snapshot
Probabilistic Approach for Minimizing Checking Sequences for Non-deterministic FSMs
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-319-25945-1_1openalex-snapshot
Checking Experiments for Finite State Machines with Symbolic Inputs
inferred← citeshttps://doi.org/10.1007/978-3-319-25945-1_15openalex-snapshot
Heuristics for Deriving Adaptive Homing and Distinguishing Sequences for Nondeterministic Finite State Machines
inferred← citeshttps://doi.org/10.1007/978-3-319-47443-4_9openalex-snapshot
On-the-Fly Construction of Adaptive Checking Sequences for Testing Deterministic Implementations of Nondeterministic Specifications
inferred← citeshttps://doi.org/10.1007/978-3-319-67549-7_22openalex-snapshot
Refining the Specification FSM When Deriving Test Suites w.r.t. the Reduction Relation
inferred← citeshttps://doi.org/10.1007/978-3-319-67549-7_6openalex-snapshot
n-Complete Test Suites for IOCO
inferred← citeshttps://doi.org/10.1007/978-3-540-73066-8_21openalex-snapshot
Testing Nondeterministic Finite State Machines with Respect to the Separability Relation
inferred← citeshttps://doi.org/10.1007/978-3-642-02138-1_9openalex-snapshot
Distinguing Non-deterministic Timed Finite State Machines
inferred← citeshttps://doi.org/10.1007/978-3-642-24580-0_12openalex-snapshot
Adaptive Testing of Deterministic Implementations Specified by Nondeterministic FSMs
inferred← citeshttps://doi.org/10.1007/978-3-642-41707-8_3openalex-snapshot
Adaptive Homing and Distinguishing Experiments for Nondeterministic Finite State Machines
inferred← citeshttps://doi.org/10.1007/s00165-008-0087-2openalex-snapshot
Testing a deterministic implementation against a non-controllable non-deterministic stream X-machine
inferred← citeshttps://doi.org/10.1007/s10009-014-0357-7openalex-snapshot
On adaptive experiments for nondeterministic finite state machines
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/s10703-019-00338-9openalex-snapshot
Synthesizing adaptive test strategies from temporal logic specifications
inferred← citeshttps://doi.org/10.1007/s11219-018-9422-xopenalex-snapshot
n-Complete test suites for IOCO
inferred← citeshttps://doi.org/10.1007/s11219-021-09548-zopenalex-snapshot
Evaluating the complexity of deriving adaptive $$S'$$-homing and $$S'$$-synchronizing sequences for nondeterministic FSMs
inferred← citeshttps://doi.org/10.1016/j.infsof.2009.06.005openalex-snapshot
Validation of SDL specifications using EFSM-based test generation
inferred← citeshttps://doi.org/10.1016/j.infsof.2012.06.009openalex-snapshot
Validation of SDL-based architectural design models using communication-based coverage criteria
inferred← citeshttps://doi.org/10.1016/j.ipl.2017.07.001openalex-snapshot
The complexity of checking the existence and derivation of adaptive synchronizing experiments for deterministic FSMs
inferred← citeshttps://doi.org/10.1093/comjnl/bxw028openalex-snapshot
Test Translation for Embedded Finite State Machine Components
inferred← citeshttps://doi.org/10.1109/aqtr.2006.254597openalex-snapshot
Model based testing of real-time embedded components
inferred← citeshttps://doi.org/10.1109/codit70676.2026.11631062openalex-snapshot
Input-Complete Finite State Machines with Explicit Failure States: A Verification-Oriented Approach for ROPS Control Systems *
inferred← citeshttps://doi.org/10.1109/ewdts.2014.7027082openalex-snapshot
Deriving complete finite tests based on state machines
inferred← citeshttps://doi.org/10.1109/ewdts.2015.7493141openalex-snapshot
FSMTest-1.0: A manual for researches
inferred← citeshttps://doi.org/10.1109/ewdts50664.2020.9225001openalex-snapshot
Deriving Distinguishing Sequences for Input/Output Automata
inferred← citeshttps://doi.org/10.1109/fmcad.2016.7886656openalex-snapshot
Synthesizing adaptive test strategies from temporal logic specifications
inferred← citeshttps://doi.org/10.1109/hase.2014.39openalex-snapshot
Adaptive Testing of Nondeterministic Systems with FSM
inferred← citeshttps://doi.org/10.1109/icst.2012.111openalex-snapshot
Generating Checking Sequences for Nondeterministic Finite State Machines
inferred← citeshttps://doi.org/10.1109/icstw.2010.29openalex-snapshot
Deriving Exhaustive Test Suits for Nondeterministic FSMs w.r.t. Non-separability Relation
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/qrs.2019.00053openalex-snapshot
Learning and Adaptive Testing of Nondeterministic State Machines
inferred← citeshttps://doi.org/10.1109/rusautocon58002.2023.10272959openalex-snapshot
Test Derivation against Timed Finite State Machines with Output Timed Guards
inferred← citeshttps://doi.org/10.1109/ssiri.2011.29openalex-snapshot
Validation of SDL-Based Architectural Design Models: New Coverage Criteria
inferred← citeshttps://doi.org/10.1109/tc.2008.15openalex-snapshot
Extending EFSMs to Specify and Test Timed Systems with Action Durations and Time-Outs
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.2017.2652457openalex-snapshot
Testing from Partial Finite State Machines without Harmonised Traces
inferred← citeshttps://doi.org/10.1134/s0361768808060030openalex-snapshot
On the synthesis of adaptive tests for nondeterministic finite state machines
inferred← citeshttps://doi.org/10.1134/s0361768810040043openalex-snapshot
Synthesis of distinguishing test cases for timed finite state machines
inferred← citeshttps://doi.org/10.1145/1370042.1370049openalex-snapshot
An EFSM-based test generation for validation of SDL specifications
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/3832783.3834347openalex-snapshot
Quick Bug Detection through Black-Box Checking
inferred← citeshttps://doi.org/10.1155/2013/373265openalex-snapshot
Active Learning of Nondeterministic Finite State Machines
inferred← citeshttps://doi.org/10.14232/actacyb.21.2.2013.1openalex-snapshot
Distinguishing Experiments for Timed Nondeterministic Finite State Machines
inferred← citeshttps://doi.org/10.15514/ispras-2018-30(4)-9openalex-snapshot
Deriving adaptive distinguishing sequences for Finite State Machines
inferred← citeshttps://doi.org/10.15514/ispras-2019-31(4)-12openalex-snapshot
FSM abstraction based method for deriving test suites with guaranteed fault coverage against nondeterministic Finite State Machines with timed guards and timeouts
inferred← citeshttps://doi.org/10.15514/syrcose-2008-2-21openalex-snapshot
A Novel Method for Derivation of a Test with Guaranteed Coverage for LTS
inferred← citeshttps://doi.org/10.20948/abrau-2022-25openalex-snapshot
Deriving Tests with Guaranteed Fault Coverage for Input / Output Automata
inferred← citeshttps://doi.org/10.26907/1562-5419-2020-23-4-634-655openalex-snapshot
Separating Input/Output Automata With Nondeterministic Behavior
inferred← citeshttps://doi.org/10.3103/s0146411617070318openalex-snapshot
Testing Timed Nondeterministic Finite State Machines with the Guaranteed Fault Coverage
inferred← citeshttps://doi.org/10.48550/arxiv.1406.2808openalex-snapshot
Compositional Testing For FSM-Based Models
inferred← citeshttps://doi.org/10.5555/3077629.3077639openalex-snapshot
Synthesizing adaptive test strategies from temporal logic specifications
inferred← citeshttps://doi.org/10.70675/2a5fd2c0z8a3az4365zbd82zad0989f7ed60openalex-snapshot
Automated test generation for production systems with a model-based testing approach
inferred← citeshttps://doi.org/10.70675/f2bf0c4fz7e23z48f3za842z162ece931209openalex-snapshot
Modélisation et validation des systèmes informatiques complexes
inferred← citeshttps://doi.org/10.82366/651openalex-snapshot
Parallel Algorithms for Distinguishing Nondeterministic Finite State Machines
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.