Checking of automata faults specified by an evaluating function

MaRDI QIDQ2740490zbMATH OpenFDO

Authors I. S. Grunskij

Publication date 2 November 2001

Published in Trudy Instituta Prikladnoĭ Matematiki i Mekhaniki (Search for Journal in Brave)

zbMATH Keywords

automata checkingfault function

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Discrete mathematics in relation to computer science (68R99) Fault detection; testing in circuits and networks (94C12)

Review text

An algorithm of checking experiments on automata is proposed when automata faults are evaluated by a discrete function. A structure of the evaluating functions is investigated. Advantages of the algorithm are shown.

Recommendations

• Simple-fault checking for automata generated by a fault function
• Fault-detection experiment with deterministic realizations and a nondeterministic model
• scientific article; zbMATH DE number 2101008
• The design of checkable automata. I
• Testing finite state machines: Fault detection

Cited in

(7)

• Transformation of automata for simplified checking
• Simple-fault checking for automata generated by a fault function
• scientific article; zbMATH DE number 3885805 (Why is no real title available?)
• scientific article; zbMATH DE number 3846885 (Why is no real title available?)
• scientific article; zbMATH DE number 4047135 (Why is no real title available?)
• The fault diagnosis of a complex technical object with the use of a cross-out method
• scientific article; zbMATH DE number 949036 (Why is no real title available?)

This page was built for publication: Checking of automata faults specified by an evaluating function

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