Adaptive distinguishing test cases of nondeterministic finite state machines: test case derivation and length estimation

DOI10.1007/S00165-017-0450-2zbMath1382.68134OpenAlexW2789083248WikidataQ130955158 ScholiaQ130955158MaRDI QIDQ1707350

Khaled El-Fakih, Natalia Kushik, Nina Yevtushenko

Publication date: 29 March 2018

Published in: Formal Aspects of Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00165-017-0450-2

zbMATH Keywords

finite state machine based testingadaptive distinguishing experimentsnondeterministic finite state machines

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• Unnamed Item
• Unnamed Item
• Hardness and inapproximability of minimizing adaptive distinguishing sequences
• The relation between preset distinguishing sequences and synchronizing sequences
• Preset and Adaptive Homing Experiments for Nondeterministic Finite State Machines
• State-identification experiments in finite automata
• Testing finite-state machines: state identification and verification

This page was built for publication: Adaptive distinguishing test cases of nondeterministic finite state machines: test case derivation and length estimation