The complexity of checking the existence and derivation of adaptive synchronizing experiments for deterministic FSMs

DOI10.1016/J.IPL.2017.07.001zbMATH Open1409.68163OpenAlexW2729254191MaRDI QIDQ2398505FDOQ2398505

Authors: Hüsnü Yenigün, Nina Yevtushenko, Natalia Kushik 

Publication date: 16 August 2017

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2017.07.001

Recommendations

• The synchronization problem in protocol testing and its complexity
• On the complexity of existence of homing sequences for nondeterministic finite state machines
• Adaptive Testing of a Deterministic Implementation Against a Nondeterministic Finite State Machine
• Describing homing and distinguishing sequences for nondeterministic finite state machines via synchronizing automata
• The relation between preset distinguishing sequences and synchronizing sequences

zbMATH Keywords

formal methodsdeterministic finite state machinesadaptive sequencessynchronizing experiments

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Analysis of algorithms and problem complexity (68Q25)

Cites Work

• Title not available (Why is that?)
• Conformance Tests as Checking Experiments for Partial Nondeterministic FSM
• Testing finite-state machines: state identification and verification
• Least Upper Bounds on Minimal Terminal State Experiments for Two Classes of Sequential Machines

Cited In (3)

• Adaptive experiments for state identification in finite state machines with timeouts
• Introducing complexity to formal testing
• Deriving Homing Sequences for Finite State Machines with Timed Guards

This page was built for publication: The complexity of checking the existence and derivation of adaptive synchronizing experiments for deterministic FSMs

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