Accession Number : AD0708329
Title : THE LANGUAGE OF LOGIC NETWORKS,
Corporate Author : FOREIGN TECHNOLOGY DIV WRIGHT-PATTERSON AFB OHIO
Personal Author(s) : Krinitskii,N. A.
Report Date : 05 JUN 1970
Pagination or Media Count : 32
Abstract : Classical algorithmic languages cannot describe conversion processes transpiring in a series-parallel manner. The article proposes a generalized logic-network language and a generalized algorithm which can describe series-parallel conversion processes. The generalized algorithm can describe actions of one or several executives (e.g., a group of program-controlled computers). The ordinary algorithm contains two instructions: (a) to perform an operation and (b) to transfer to a certain point. The generalized algorithm may contain an instruction of transfer to several points simultaneously. Concepts of sequence, sequence ratio, compatibility, segment (generalized logic circuit), mark (combination of conjunctions and alternatives), term, reference, and pronetwork are defined. The synthesis of a network is considered as a result of execution of segment algorithms and mark algorithms. A network comprising n terms can be represented graphically as a configuration constructed with n nodes; it is equivalent to a given formula.
Descriptors : (*PROGRAMMING LANGUAGES, ALGORITHMS), LOGIC CIRCUITS, COMPUTATIONAL LINGUISTICS, CONTROL SEQUENCES, COMPUTER LOGIC, FLOW CHARTING, USSR
Subject Categories : Computer Programming and Software
Distribution Statement : APPROVED FOR PUBLIC RELEASE