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

dc.contributor.authorShabaldina, N.
dc.contributor.authorYevtushenko, N.
dc.date.accessioned2016-08-25T06:43:22Z
dc.date.available2016-08-25T06:43:22Z
dc.date.issued2008
dc.description.abstractThe 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.citationShabaldina, N. Solving Parallel Multi Component Automata Equations / N. Shabaldina, N. Yevtushenko // Радиоэлектроника и информатика : науч.-техн. журн. – Х. : Изд-во ХНУРЭ, 2008. – Вып. 1. – С. 55-57.uk_UA
dc.identifier.urihttp://openarchive.nure.ua/handle/document/1853
dc.language.isoenuk_UA
dc.publisherХНУРЭuk_UA
dc.subjectdiscrete event systemsuk_UA
dc.subjectequationsuk_UA
dc.subjectautomatauk_UA
dc.titleSolving Parallel Multi Component Automata Equationsuk_UA
dc.typeArticleuk_UA
dspace.entity.typePublication

Файли

Оригінальний пакет
Зараз показано 1 - 1 з 1
Завантаження...
Зображення мініатюри
Назва:
RI_2008_1-055-057.pdf
Розмір:
450.64 KB
Формат:
Adobe Portable Document Format
Ліцензійний пакет
Зараз показано 1 - 1 з 1
Немає доступних мініатюр
Назва:
license.txt
Розмір:
9.42 KB
Формат:
Item-specific license agreed upon to submission
Опис: