Testing finite-state machines: state identification and verification

DOI10.1109/12.272431zbMath1395.68173OpenAlexW2160282650MaRDI QIDQ5375295

No author found.

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)

Related Items

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