Telecommunication Systems Analysis Using The Convolution Of Moore And Mealy Automata
At present imitation models, describing various telecommunication systems and realized by computers, are particularly topical. Problems how to describe the telecommunication systems using such mathematical – informational concepts that would enable to create corresponding simulation models which are used for calculating the various telecommunication systems characteristics. The experience showed that the convolutions of Moore and Mealy automata are suited for the description of such systems. Classical Moore and Mealy automata have only the finite number of states and signals, but when they are used for the description of the telecommunication systems, it is expedient to augment the number of their states and signals until the infinite number. The time is included into automata, too. Moreover, the convolution of the automata means that the output signals of one automaton coincide with the input signals of another automaton. Then it is sufficient to create corresponding surjections, according to which the simulation model can be created. A description of queuing telecommunication system using the convolution of Moore and Mealy automata is presented. Ill. 6, bibl. 7 (in English; summaries in Lithuanian, English and Russian).
Authors retain copyright and grant the journal the right of the first publication with the paper simultaneously licensed under the Creative Commons Attribution 4.0 (CC BY 4.0) licence.
Authors are allowed to enter into separate, additional contractual arrangements for the non-exclusive distribution of the paper published in the journal with an acknowledgement of the initial publication in the journal.
Copyright terms are indicated in the Republic of Lithuania Law on Copyright and Related Rights, Articles 4-37.