Abstract:
Automata with memory are described which are described by a logical network with feedbacks consisting of logical elements performing an extended range of Boolean operations and flip-flops with separated inputs. To obtain an automaton with memory suitable for supervision, all converging branchings of the automaton network are detected and the possibility of rupture is ensured at the stage of supervision. An algorithm for finding the minimal number of necessary ruptures is given. Diagnosis of the transformed unit with various ways of ensuring the rupture is described.
Fulltext:
PDF file (1848 kB)