A binary-counter exhaustive test generator for a class of finite-memory synchronous automata

zbMATH Open1058.68538MaRDI QIDQ1882018FDOQ1882018

Authors: G. P. Aksenova, V. F. Khalchev 

Publication date: 18 October 2004

Published in: Automation and Remote Control (Search for Journal in Brave)

Recommendations

• Generation of an exhaustive test for finite-memory automata. I
• Generation of an exhaustive test for finite-memory automata. II
• scientific article; zbMATH DE number 3924680
• Binary counter-based test generator in systems of compact testing
• On the use of counters for reproducing deterministic test sets

zbMATH Keywords

synchronous automatafinite \(B\)-memory

Mathematics Subject Classification ID

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

This page was built for publication: A binary-counter exhaustive test generator for a class of finite-memory synchronous automata

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