Automaton synthesis from a nonformal specification
A fundamental feature of the proposed approach is that, already in the initial specification of internal automaton states, the transition conditions to each state are determined completely and simultaneously for all states. This immediately enables us to allow for the synchronous or asynchronous property of the table, and also makes further construction of the table quite routine. The necessary preconditions are thus created for the development of universal interactive subsystems for abstract synthesis. Moreover, for some types of specifications, the compact labeling procedure can be completely algorithmized. Labyrinth specifications are an example of this. In general, the sizes of synchronous and asynchronous tables may be quite different, but this is not necessarily reflected in implementation complexity if the reliability requirements are sufficiently high. Moreover, as we have established, the asynchronous variant does not necessarily lead to poorer minimization.
KeywordsOperating System Transition Condition Artificial Intelligence System Theory Fundamental Feature
Unable to display preview. Download preview PDF.
- 1.M. A. Aizerman, L. A. Gusev, et al., Logic, Automata, Algorithms [in Russian], Fizmatgiz, Moscow (1963).Google Scholar
- 2.V. M. Glushkov, Synthesis of Digital Automata [in Russian], Fizmatgiz, Moscow (1962).Google Scholar
- 3.O. P. Kuznetsov, “Relay devices and finite automata,” in: Structural Theory of Relay Devices [in Russian], Izd. AN SSSR, Moscow (1963), pp. 74–99.Google Scholar
- 4.A. N. Melekhov, Directed Graphs and Finite Automata [in Russian], Nauka, Moscow (1971).Google Scholar
- 6.S. Caldwell, Logic Synthesis of Relay Circuits [Russian translation], IL, Moscow (1962).Google Scholar
- 7.S. Unger, Asynchronous Sequential Circuits [Russian translation], Nauka, Moscow (1977).Google Scholar
- 8.V. A. Raikhlin, “Pseudoasynchronous sequential circuits,” USiM, No. 5, 33–41 (1993).Google Scholar