A parallel model of the language of graph-schemes of algorithms and its interpretation by abstract automata.

  • Е. Л. Полин
  • К. В. Защелкин

Abstract

The analysis of existing means of describing the management of discrete computing systems, in particular, the well-known language of graph-scheme algorithms (GSA), has been carried out. The development of the GSA in the form of the GSA parallel model (ASG) is proposed, as well as the method of its hardware implementation.

Published
2019-03-16
Issue
No. 65(65) (2005): Electrical engineering and electrical equipment
Section
Automated Electromechanical Systems