On the public citation graph

Studying the separability relation between finite state machines

0 signed · 47 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/11430230_10openalex-snapshot
Coping with Nondeterminism in Network Protocol Testing
inferredcites →https://doi.org/10.1007/11759744_9openalex-snapshot
Conformance Tests as Checking Experiments for Partial Nondeterministic FSM
inferredcites →https://doi.org/10.1007/3-540-10235-3openalex-snapshot
A Calculus of Communicating Systems
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-3-540-39979-7_19openalex-snapshot
Concerning the Ordering of Adaptive Test Sequences
inferredcites →https://doi.org/10.1016/0169-7552(93)90045-6openalex-snapshot
On tools supporting the use of formal description techniques in protocol development
inferredcites →https://doi.org/10.1016/s0140-3664(00)00327-3openalex-snapshot
Test selection for a nondeterministic FSM
inferredcites →https://doi.org/10.1016/s0164-1212(01)00132-7openalex-snapshot
A survey of communication protocol testing
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/5.533956openalex-snapshot
Principles and methods of testing finite state machines-a survey
inferredcites →https://doi.org/10.1109/sefm.2005.17openalex-snapshot
Experimental evaluation of FSM-based testing methods
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/186258.187153openalex-snapshot
Protocol testing
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.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-031-04673-5_4openalex-snapshot
Testing Against Non-deterministic FSMs: A Probabilistic Approach for Test Suite Minimization
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/978-3-319-22360-5_16openalex-snapshot
Describing Homing and Distinguishing Sequences for Nondeterministic Finite State Machines via Synchronizing Automata
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-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-22256-6_20openalex-snapshot
Preset and Adaptive Homing Experiments for Nondeterministic Finite State Machines
inferred← citeshttps://doi.org/10.1007/978-3-642-39274-0_20openalex-snapshot
On the Length of Homing Sequences for Nondeterministic Finite State Machines
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/s10009-014-0357-7openalex-snapshot
On adaptive experiments for nondeterministic finite state machines
inferred← citeshttps://doi.org/10.1016/j.asoc.2016.07.019openalex-snapshot
Heuristics for deriving distinguishing experiments of nondeterministic finite state machines
inferred← citeshttps://doi.org/10.1016/j.ipl.2011.12.012openalex-snapshot
Tight bound on the length of distinguishing sequences for non-observable nondeterministic Finite-State Machines with a polynomial number of inputs and outputs
inferred← citeshttps://doi.org/10.1093/comjnl/bxy086openalex-snapshot
Incremental and Heuristic Approaches for Deriving Adaptive Distinguishing Test Cases for Non-deterministic Finite-State Machines
inferred← citeshttps://doi.org/10.1109/icmsao.2017.7934857openalex-snapshot
Parallel implementation for deriving preset distinguishing experiments of 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/tse.2019.2911076openalex-snapshot
$\mathcal k$-branching uio sequences for partially specified observable non-deterministic fsms
inferred← citeshttps://doi.org/10.1134/s036176881203005xopenalex-snapshot
On deriving test suites for nondeterministic finite state machines with time-outs
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.1186/s40411-016-0027-4openalex-snapshot
Distinguishing extended finite state machine configurations using predicate abstraction
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.14232/actacyb.21.2.2013.1openalex-snapshot
Distinguishing Experiments for Timed Nondeterministic Finite State Machines
inferred← citeshttps://doi.org/10.15514/ispras-2015-27(6)-28openalex-snapshot
Checking experiments with non-observable tree FSMs
inferred← citeshttps://doi.org/10.15514/syrcose-2014-8-15openalex-snapshot
Extended Finite State Machine based Test Derivation Strategies for Telecommunication Protocols
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.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.