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

MaRDI QIDQ1882018zbMATH OpenFDO

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

Publication date 18 October 2004

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

zbMATH Keywords

finite \(B\)-memorysynchronous automata

Mathematics Subject Classification ID

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

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

Cited in

(4)

• Generation of an exhaustive test for finite-memory automata. II
• Binary counter-based test generator in systems of compact testing
• Generation of an exhaustive test for finite-memory automata. I
• scientific article; zbMATH DE number 1263638 (Why is no real title available?)

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)