Abstract
For the automation of the logical monitoring of systems, it is necessary to solve three basic problems. First, it is necessary to choose a finite set of input stimuli by means of which one can detect and locate flaws in the system (the problem of constructing tests); second, it is necessary to perform an analysis of the system’s output reaction to these stimuli and, if normal operation is disrupted, to establish the locus and form of the fault (the problem of engineering diagnosis); third, it is necessary to compile an optimal sequence of input stimuli upon whose realization the search for faults in the system would be carried out during a minimal time interval (the problem of optimizing the time for performing monitoring).
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Literature Cited
V. M. Glushkov, The Synthesis of Digital Automata, Fizmatgiz (1962).
A. G. Lunts, “Method of analyzing finite automata,” Dokl. Akad. Nauk SSSR, Vol. 160, No. 4 (1965).
E. F. Moore, “Gedanken-experiments on sequential machines,” in: Automata Studies, ed. C. E. Shannon and J. McCarthy, Princeton, Princeton University Press (1956), pp. 129–153.
I. A. Chegis and S. V. Yablonskii, “Logical method of monitoring the operation of electrical schemes,” Tr. Mat. Akad. Nauk SSSR, Vol. 51 (1958).
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1969 Consultants Bureau, New York
About this chapter
Cite this chapter
Kaznacheev, V.I. (1969). Language of Regular Expressions. In: Lazarev, V.G., Zakrevskii, A.V. (eds) Synthesis of Digital Automata / Problemy Sinteza Tsifrovykh Avtomatov / Проƃлемы Синтеза Цифровых Автоматов. Springer, Boston, MA. https://doi.org/10.1007/978-1-4684-9033-6_15
Download citation
DOI: https://doi.org/10.1007/978-1-4684-9033-6_15
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4684-9035-0
Online ISBN: 978-1-4684-9033-6
eBook Packages: Springer Book Archive