Proceedings of the Institute for System Programming of the RAS
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Proceedings of ISP RAS:
Year:
Volume:
Issue:
Page:
Find






Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register


Proceedings of the Institute for System Programming of the RAS, 2016, Volume 28, Issue 1, Pages 131–150
DOI: https://doi.org/10.15514/ISPRAS-2016-28(1)-8
(Mi tisp8)
 

This article is cited in 1 scientific paper (total in 1 paper)

Automata system: composition according to graph of links

I. B. Burdonov, A. S. Kossatchev

Institute for System Programming of the Russian Academy of Sciences, 25, Alexander Solzhenitsyn st., Moscow, 109004, Russia
Full-text PDF (288 kB) Citations (1)
References:
Abstract: The problem of modeling and composing of aggregate systems is considered. The system components are described with finite automata with multiple entries and exits. The communication between automata is described with message passing over simplex communication channels. The system is described with a directed graph of links. Each node of the graph corresponds to automaton of a component and an arc corresponds to a communication channel connecting exit of one automaton with entry of another automaton. Automaton of the graph node in each state can accept multiple messages from its entries (at most one message from each entry) and send multiple messages to its exits (at most one message to each exit). Entries (exits) of the automata not connected to exits (entries) of automata are considered to be external and used for communication between the system and its environment. The automata of the system operate synchronously: on each cycle each automaton performs one transition. A transition of an automaton imposes requirements on states of all its entries and exits (messages in them are specified) and explicitly specifies subset of entries and exits through which the messages are received or sent, respectively. Synchronous communication between automata means that for each link the requirements of the automata connected with this link must conform to each other. It makes possible to describe a wider spectrum of automata behavior. For example, a priority of message receiving: if there are multiple message in the automata entries, it can receive messages with the highest priority and discard the rest of the messages. It also makes possible for the automaton to receive messages regardless of ability to simultaneously send some message to some exit. A composition of the automata of the system according to the graph of links is defined and its associativity is proved. In conclusion, the directions of future research are described.
Keywords: directed graphs, communicating automata, automata composition, distributed systems, networks.
Bibliographic databases:
Document Type: Article
Language: Russian
Citation: I. B. Burdonov, A. S. Kossatchev, “Automata system: composition according to graph of links”, Proceedings of ISP RAS, 28:1 (2016), 131–150
Citation in format AMSBIB
\Bibitem{BurKos16}
\by I.~B.~Burdonov, A.~S.~Kossatchev
\paper Automata system: composition according to graph of links
\jour Proceedings of ISP RAS
\yr 2016
\vol 28
\issue 1
\pages 131--150
\mathnet{http://mi.mathnet.ru/tisp8}
\crossref{https://doi.org/10.15514/ISPRAS-2016-28(1)-8}
\elib{https://elibrary.ru/item.asp?id=26166319}
Linking options:
  • https://www.mathnet.ru/eng/tisp8
  • https://www.mathnet.ru/eng/tisp/v28/i1/p131
  • This publication is cited in the following 1 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    Proceedings of the Institute for System Programming of the RAS
     
      Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024