Solving Parallel Multi Component Automata Equations

Shabaldina, N.; Yevtushenko, N.

Публікація:
Solving Parallel Multi Component Automata Equations

dc.contributor.author	Shabaldina, N.
dc.contributor.author	Yevtushenko, N.
dc.date.accessioned	2016-08-25T06:43:22Z
dc.date.available	2016-08-25T06:43:22Z
dc.date.issued	2008
dc.description.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.	uk_UA
dc.identifier.citation	Shabaldina, N. Solving Parallel Multi Component Automata Equations / N. Shabaldina, N. Yevtushenko // Радиоэлектроника и информатика : науч.-техн. журн. – Х. : Изд-во ХНУРЭ, 2008. – Вып. 1. – С. 55-57.	uk_UA
dc.identifier.uri	http://openarchive.nure.ua/handle/document/1853
dc.language.iso	en	uk_UA
dc.publisher	ХНУРЭ	uk_UA
dc.subject	discrete event systems	uk_UA
dc.subject	equations	uk_UA
dc.subject	automata	uk_UA
dc.title	Solving Parallel Multi Component Automata Equations	uk_UA
dc.type	Article	uk_UA
dspace.entity.type	Publication