Please use this identifier to cite or link to this item:
|Title:||Solving Parallel Multi Component Automata Equations|
|Keywords:||discrete event systems|
|Citation:||Shabaldina, N. Solving Parallel Multi Component Automata Equations / N. Shabaldina, N. Yevtushenko // Радиоэлектроника и информатика : науч.-техн. журн. – Х. : Изд-во ХНУРЭ, 2008. – Вып. 1. – С. 55-57.|
|Abstract:||The problem of designing the unknown component of a system of interacting automata that combined with the known part of the system meets the specification, is well known. However, most publications are devoted to solving the problem for the proper composition of two automata. In this paper, we consider a parallel multi component automata equation and propose two methods for deriving a largest solution to this equation (if the equation is solvable). In particular, we show that the union of alphabets over all known components and of that of the specification is the largest alphabet of actions over which a solution for a solvable equation should exist, and show how a solution over an appropriate alphabet can be derived from such a largest solution.|
|Appears in Collections:||Радиоэлектроника и информатика|
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.