On the public citation graph

Testing from a nondeterministic finite state machine using adaptive state counting

0 signed · 96 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/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-3-540-39979-7_19openalex-snapshot
Concerning the Ordering of Adaptive Test Sequences
inferredcites →https://doi.org/10.1007/bf01068590openalex-snapshot
Failure diagnosis of automata
inferredcites →https://doi.org/10.1016/s0169-7552(96)00017-7openalex-snapshot
Conformance testing with labelled transition systems: Implementation relations and test generation
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.1109/32.265636openalex-snapshot
Test selection based on communicating nondeterministic finite-state machines using a generalized Wp-method
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/icst.2012.111openalex-snapshot
Generating Checking Sequences for Nondeterministic Finite State Machines
inferredcites →https://doi.org/10.1109/jproc.1996.533955openalex-snapshot
Prolog to: Principles and Methods of Testing Finite State Machines - A Survey
inferredcites →https://doi.org/10.1109/tse.1978.231496openalex-snapshot
Testing Software Design Modeled by Finite-State Machines
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.1593openalex-snapshot
Behaviour abstraction adequacy criteria for API call protocol testing
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/11754008_4openalex-snapshot
Bounded Sequence Testing from Non-deterministic Finite State Machines
inferred← citeshttps://doi.org/10.1007/11759744_9openalex-snapshot
Conformance Tests as Checking Experiments for Partial Nondeterministic FSM
inferred← citeshttps://doi.org/10.1007/978-3-030-31280-0_11openalex-snapshot
A Mechanised Proof of an Adaptive State Counting Algorithm
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-030-61467-6_28openalex-snapshot
New Distribution Paradigms for Railway Interlocking
inferred← citeshttps://doi.org/10.1007/978-3-030-64881-7_15openalex-snapshot
An Executable Mechanised Formalisation of an Adaptive State Counting Algorithm
inferred← citeshttps://doi.org/10.1007/978-3-030-92124-8_5openalex-snapshot
Exhaustive Property Oriented Model-Based Testing with Symbolic Finite State Machines
inferred← citeshttps://doi.org/10.1007/978-3-031-04673-5_1openalex-snapshot
libfsmtest An Open Source Library for FSM-Based Testing
inferred← citeshttps://doi.org/10.1007/978-3-031-04673-5_2openalex-snapshot
Mining Precise Test Oracle Modelled by FSM
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-319-45943-1_1openalex-snapshot
Model-Based Testing Strategies and Their (In)dependence on Syntactic Model Representations
inferred← citeshttps://doi.org/10.1007/978-3-319-48989-6_1openalex-snapshot
Industrial-Strength Model-Based Testing of Safety-Critical Systems
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-540-73770-4_6openalex-snapshot
Automatic Testing from Formal Specifications
inferred← citeshttps://doi.org/10.1007/978-3-540-76650-6_10openalex-snapshot
Testing for Refinement in CSP
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_6openalex-snapshot
Testing from X-Machine Specifications
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-10373-5_10openalex-snapshot
A Statistical Approach to Test Stochastic and Probabilistic Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-21498-1_51openalex-snapshot
Experimental Comparison of Different Techniques to Generate Adaptive Sequences
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-981-99-9021-4_19openalex-snapshot
The Data Flow Method Based on Extended Finite State Machine
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/s00165-011-0206-3openalex-snapshot
Testing restorable systems: formal definition and heuristic solution based on river formation dynamics
inferred← citeshttps://doi.org/10.1007/s00165-016-0402-2openalex-snapshot
Complete model-based equivalence class testing for nondeterministic systems
inferred← citeshttps://doi.org/10.1007/s00446-008-0062-4openalex-snapshot
Checking sequences for distributed test architectures
inferred← citeshttps://doi.org/10.1007/s00446-011-0153-5openalex-snapshot
Overcoming controllability problems in distributed testing from an input output transition system
inferred← citeshttps://doi.org/10.1007/s10009-017-0479-9openalex-snapshot
Model-based testing strategies and their (in)dependence on syntactic model representations
inferred← citeshttps://doi.org/10.1007/s11219-014-9242-6openalex-snapshot
Fault domain-based testing in imperfect situations: a heuristic approach and case studies
inferred← citeshttps://doi.org/10.1007/s11219-018-9422-xopenalex-snapshot
n-Complete test suites for IOCO
inferred← citeshttps://doi.org/10.1016/b978-012372501-1/50017-xopenalex-snapshot
Bibliography
inferred← citeshttps://doi.org/10.1016/j.comnet.2006.03.009openalex-snapshot
Reducing the cost of applying adaptive test cases
inferred← citeshttps://doi.org/10.1016/j.comnet.2009.10.014openalex-snapshot
Testing a probabilistic FSM using interval estimation
inferred← citeshttps://doi.org/10.1016/j.ipl.2005.12.001openalex-snapshot
Applying adaptive test cases to nondeterministic implementations
inferred← citeshttps://doi.org/10.1016/j.jlap.2008.06.001openalex-snapshot
Testing from a stochastic timed system with a fault model
inferred← citeshttps://doi.org/10.1016/j.jss.2009.06.030openalex-snapshot
Mutation testing from probabilistic and stochastic finite state machines
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.102678openalex-snapshot
State identification for labeled transition systems with inputs and outputs
inferred← citeshttps://doi.org/10.1016/j.scico.2023.103005openalex-snapshot
Exhaustive property oriented model-based testing with symbolic finite state machines
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.1016/j.tcs.2010.01.030openalex-snapshot
Bounded sequence testing from deterministic finite state machines
inferred← citeshttps://doi.org/10.1016/j.tcs.2010.05.014openalex-snapshot
Checking experiments for stream X-machines
inferred← citeshttps://doi.org/10.1016/j.tcs.2012.05.038openalex-snapshot
The complexity of asynchronous model based testing
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/bxn048openalex-snapshot
Three Generalizations to a Generic Integrated Test Generation Method for Finite State Machines
inferred← citeshttps://doi.org/10.1093/comjnl/bxv041openalex-snapshot
Incomplete Distinguishing Sequences for Finite State Machines
inferred← citeshttps://doi.org/10.1109/alife.2011.5954657openalex-snapshot
Creating adaptive sequences with genetic algorithms to reach a certain state in a non-deterministic FSM
inferred← citeshttps://doi.org/10.1109/hase.2014.39openalex-snapshot
Adaptive Testing of Nondeterministic Systems with FSM
inferred← citeshttps://doi.org/10.1109/icoei53556.2022.9776684openalex-snapshot
Autonomous Car Controller using Behaviour Planning based on Finite State Machine
inferred← citeshttps://doi.org/10.1109/icspcc.2013.6663880openalex-snapshot
An overview of testing generation methods for protocol conformance testing
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.2013.29openalex-snapshot
Combining Model-Based Testing and Runtime Monitoring for Program Testing in the Presence of Nondeterminism
inferred← citeshttps://doi.org/10.1109/icstw.2019.00029openalex-snapshot
Using Imprecise Test Oracles Modelled by FSM
inferred← citeshttps://doi.org/10.1109/qrs.2019.00053openalex-snapshot
Learning and Adaptive Testing of Nondeterministic State Machines
inferred← citeshttps://doi.org/10.1109/quatic.2014.38openalex-snapshot
On Testing against Partial Non-observable Specifications
inferred← citeshttps://doi.org/10.1109/taic.part.2007.20openalex-snapshot
Mutation Testing from Probabilistic Finite State Machines
inferred← citeshttps://doi.org/10.1109/tc.2006.80openalex-snapshot
Optimizing the length of checking sequences
inferred← citeshttps://doi.org/10.1109/tc.2015.2455981openalex-snapshot
Randomized Quasi-Random Testing
inferred← citeshttps://doi.org/10.1109/tc.2017.2774209openalex-snapshot
2017 Index IEEE Transactions on Computers Vol. 66
inferred← citeshttps://doi.org/10.1109/tse.2014.2364035openalex-snapshot
Generating Complete Controllable Test Suites for Distributed Testing
inferred← citeshttps://doi.org/10.1109/tse.2017.2652457openalex-snapshot
Testing from Partial Finite State Machines without Harmonised Traces
inferred← citeshttps://doi.org/10.1109/tse.2023.3291137openalex-snapshot
Incomplete Adaptive Distinguishing Sequences for Non-Deterministic FSMs
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.1137/090771296openalex-snapshot
Reaching and Distinguishing States of Distributed Systems
inferred← citeshttps://doi.org/10.1145/1295074.1295084openalex-snapshot
Testing randomized software by means of statistical hypothesis tests
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/3801960openalex-snapshot
Reactive Model-Based Testing of Cyclic Systems
inferred← citeshttps://doi.org/10.1155/2013/373265openalex-snapshot
Active Learning of Nondeterministic Finite State Machines
inferred← citeshttps://doi.org/10.1155/2014/869474openalex-snapshot
A Formal Specification Framework for Designing and Verifying Reliable and Dependable Software for CNC Systems
inferred← citeshttps://doi.org/10.11606/d.55.2023.tde-10012024-173035openalex-snapshot
Improving model learning by inferring separating sequences from traces
inferred← citeshttps://doi.org/10.1201/b11321-15openalex-snapshot
How to Design Extended Finite State Machine Test Models in Java
inferred← citeshttps://doi.org/10.1201/b11321-7openalex-snapshot
How to Design Extended Finite State Machine Test Models in Java
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/syrcose-2010-4-21openalex-snapshot
Observable Form of a Timed Finite State Machine
inferred← citeshttps://doi.org/10.48550/arxiv.2105.11786openalex-snapshot
Complete Requirements-based Testing with 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.