Checking Completeness of Tests for Finite State Machines

DOI10.1109/TC.2010.17zbMATH Open1368.68240MaRDI QIDQ5280717FDOQ5280717

Authors: Adenilso Simao, Alexandre Petrenko 

Publication date: 27 July 2017

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

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Fault detection; testing in circuits and networks (94C12)

Cited In (4)

• Generation of complete test suites from Mealy input/output transition systems
• Bounded sequence testing from deterministic finite state machines
• Hardness and inapproximability of minimizing adaptive distinguishing sequences
• Introducing complexity to formal testing

This page was built for publication: Checking Completeness of Tests for Finite State Machines

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