Computer Sciences

Representation of universal planar automata by autonomous input signals

Authors: Molchanov V. A.

Universal planar automata are universally attracted objects in the category of automata, whose sets of states and output signals are endowed with structures of planes. The main result of the paper shows that any universal planar automaton is isomorphic to a many-sorted algebraic system canonically constructed from autonomous input signals of the automaton. 

Queueing networks with batch movements of customers, blocking and clusters

Authors: Mitrophanov Y. I., Dolgov V. I., Rogachko E. S., Stankevich E. P.

 Two types queueing networks with batch movements of customers – networks with blocking and networks with clusters are investigated. Product form stationary distribution for networks with blocking of transitions in states, in which the number of customers in queueing systems exceeds given values, is derived. For queueing networks with disjoint clusters of systems the problem of analyzing is solved and the product form stationary distribution is found. Examples of analysis of the network with blocking and the network with clusters are presented. 

Identification of a state machine structure with finites fragment of behavior

Authors: Bogomolov S. A.

 Identification of a state machine structure with finite fragments of behavior is discussed. The state machine behavior is a set of various finite-sequential (f.-s.) functions realized in a state machine, and under a finite fragment of behavior we mean traces of f.-s. functions and state machines. The concept of an identifying trace for a state machine irredundant over its realization is introduced.

On stability theory of autonomous angular stabilization system for combined dynamical systems

Authors: Andreichenko D. K., Andreichenko K. P., Kononov V. V.

Studied the effect on the stability of the longitudinal acceleration discretely-continuum model of single-channel angular stabilization system with of delayed argument. Methods of construction asymptotic stability areas and analysis of impulse transition functions are developed. The critical values of the longitudinal acceleration are defined. 

Characterization of graphs with a small number of additional arcs in a minimal 1-vertex extension

Authors: Abrosimov M. B.

A graph G∗ is a k-vertex extension of a graph G if every graph obtained from G∗ by removing any k vertices contains G. k-vertex extension of a graph G with n+k vertices is called minimal if among all k-vertex extensions of G withn+k vertices it has the minimal possible number of arcs. We study directed graphs, whose minimal vertex 1-extensions have a specific number of additional arcs. A solution is given when the number of additional arcs equals one or two. 

Pages