Checking Completeness of Tests for Finite State Machines

DOI10.1109/TC.2010.17zbMath1368.68240MaRDI QIDQ5280717

Alexandre Petrenko, Adenilso Simao

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)

Related Items (3)

Generation of complete test suites from Mealy input/output transition systems ⋮ 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