Testing finite-state machines: state identification and verification

DOI10.1109/12.272431MaRDI QIDQ5375295zbMATH OpenOpenAlexFDO

Authors

Publication date 14 September 2018

Published in IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/7b66fa6b859eac503906e2147980d5b47ba4d814

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60)

Cited in

(28)

• Adaptive distinguishing test cases of nondeterministic finite state machines: test case derivation and length estimation
• FSM-based testing from user defined faults adapted to incremental and mutation testing
• Adaptive experiments for state identification in finite state machines with timeouts
• Equivalence checking of quantum finite-state machines
• A multi-parameter analysis of hard problems on deterministic finite automata
• Efficient active automata learning via mutation testing
• Reduced checking sequences using unreliable reset
• The complexity of checking the existence and derivation of adaptive synchronizing experiments for deterministic FSMs
• Complete open-state testing of limitedly nondeterministic systems
• Removing redundant refusals: minimal complete test suites for failure trace semantics
• Describing homing and distinguishing sequences for nondeterministic finite state machines via synchronizing automata
• Security Analysis of Cache Replacement Policies
• Testing restorable systems: formal definition and heuristic solution based on river formation dynamics
• Hardness and inapproximability of minimizing adaptive distinguishing sequences
• Verification of initial-state opacity in security applications of discrete event systems
• Deriving Homing Sequences for Finite State Machines with Timed Guards
• Expressive Power of Broadcast Consensus Protocols
• A survey on observability of Boolean control networks
• State identification and verification with satisfaction
• A new approach for active automata learning based on apartness
• The no-meet matroid
• Computing minimal distinguishing Hennessy-Milner formulas is NP-hard, but variants are tractable
• A new perspective on conformance testing based on apartness
• The complexity of asynchronous model based testing
• The relation between preset distinguishing sequences and synchronizing sequences
• Runtime analysis of the (1+1) EA on computing unique input output sequences
• Bounded sequence testing from deterministic finite state machines
• Evolutionary generation of unique input/output sequences for class behavioral testing

This page was built for publication: Testing finite-state machines: state identification and verification

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5375295)