
Tatiana R. ShmelevaMax Planck Institute for Software Systems
Tatiana R. Shmeleva
Dr.Sci.
About
42
Publications
4,851
Reads
How we measure 'reads'
A 'read' is counted each time someone views a publication summary (such as the title, abstract, and list of authors), clicks on a figure, or views or downloads the full-text. Learn more
269
Citations
Introduction
Skills and Expertise
Publications
Publications (42)
Proof-of-work agreement protocol, offered by Keller and Böhme, is analysed by coloured Petri nets and refined. Blockchain technology, based on proof-of-work procedure and Nakomoto consensus negotiations, represents fundamentals of many kinds of cryptocurrency widespread recently. The protocol, called Ak, works in continuous time which is simulated...
Correctness of networking protocols represents the principal requirement of cybersecurity. Correctness of protocols is established via the procedures of their verification. A classical communication system includes a pair of interacting systems. Recent developments of computing and communication grids for radio broadcasting, cellular networks, comm...
The paper further refines the clan composition technique that is considered a way of matrix partitioning into a union of block-diagonal and block-column matrices. This enables solving the individual systems for each horizontal block on a separate computing node, followed by solving the composition system. The size of minimal clans, obtained as a re...
Multidimensional torus interconnect finds wide application in modern exascale computing. For models design in high-performance computing, grid and cloud computing, and also systems biology, two basic ways of specifying spatial structures with Petri nets are considered – an infinite Petri net specified by a parametric expression (PE) and a reenterab...
Sleptsov nets are applied as a uniform language to specify models of unconventional computations and artificial intelligence systems. A technique for specification of neural networks, including multidimensional and multilayer networks of deep learning approach, using Sleptsov nets, is shown; the ways of specifying basic activation functions by Slep...
A detailed model of a realistic up-to-date switching (routing) device has been built that combines cut-through and store-and-forward switching techniques. The model is based on a non-deterministic unconditional forwarding decision made with regard to the input packet. After the forwarding decision, two alternative procedures are launched: either cu...
Aviation and aerospace systems are complex and concurrent and require special tools for their specification, verification, and performance evaluation. The tool in demand should be easily integrated into the standard loop of model-driven development. Colored Petri nets represent a combination of a Petri net graph and a functional programming languag...
A model of a hypertorus communication grid has been constructed in the form of an infinite Petri net. A grid cell represents either a packet switching device or a bioplast cell. A parametric expression is obtained to allow a finite specification of an infinite Petri net. To prove properties of an ideal communication protocol, we derive an infinite...
Aviation and aerospace systems are complex and concurrent and require special tools for their specification, verification, and performance evaluation. The tool in demand should be easily integrated into the standard loop of model-driven development. Colored Petri nets represent a combination of a Petri net graph and a functional programming languag...
Актуальность. Вычислительные и коммуникационные решетки являются мощным средством повышения производительности и качества обслуживания современных сетей. В двумерных решетках основными формами ячейки являются треугольник, четырехугольник и шестиугольник. Треугольные решетки применяются при решении краевых задач с треугольными конечными элементами в...
A formal direct parametric description of the hexagonal grid model with side k is constructed according to the specified grid composition rules. A system of linear equations is constructed for finding invariants of positions on the basis of a direct description of the model. A method for calculating linear invariants of infinite Petri nets with a r...
In this paper, we consider the classification and applications of switching methods, their advantages and disadvantages. A model of a computing grid was constructed in the form of a colored Petri net with a node which implements cut-through packet switching. The model consists of packet switching nodes, traffic generators and guns that form malicio...
A composition and analysis technique was developed for investigation of infinite Petri nets with regular structure introduced for modeling networks, clusters and computing grids that also concerns cellular automata and biological systems. A case study of a hypercube structure composition and analysis is presented; particularities of modeling other...
A composition and analysis technique was developed for investigation of infinite Petri nets with regular structure, introduced for modeling networks, clusters and computing grids, that also concerns cellular automata and biological systems. A case study of a square grid structure composition and analysis is presented. Parametric description of Petr...
The automation task of evaluating the functional characteristics of IP-networks with dynamic routing based on RIP protocol is solved for the
designing networks process. A method of reenterable model construction is proposed, this method provides reuse of models, which are technologyoriented and invariant to the network structure. Measuring fragment...
Models of rectangular grid structures were constructed in the form of a colored Petri net. The basic model consists of a matrix of switching nodes that deliver packets to computing nodes which are attached to the matrix borders and produce and consume packets. Since grid structures are often employed to solve boundary value problems, square and tor...
An overview of works, early published by the authors, has been done that explains peculiarities of composition and analysis technique developed for investigation of infinite Petri nets with regular structure which were introduced for modeling networks, clusters, and computing grids. Parametric description of Petri nets, parametric representation of...
A rectangular communication grid model was constructed in the form of a colored Petri net as a composition of submodes of terminal devices producing and consuming packets and communication devices switching packets for their delivery among terminal devices. The model was supplied with traffic guns simulating ill-intentioned traffic. Via simulation...
A parametric Colored Petri net model of the switched Ethernet network with the tree-like topology is developed. The model’s structure is the same for any given network and contains fixed number of nodes. The tree-like topology of a definite network is given as the marking of dedicated places. The model represents a network containing workstations,...
Basic components of Provider Backbone Bridge (PBB) network models were constructed: PBB interior switch, PBB edge switch—with the dynamic filling up of address tables. The modeling of PBB networks was implemented. The results of simulation reveal definite imperfections of PBB technology caused by the broadcasting and sensitivity to the ageing time...
A model of a hypercube communication structure of arbitrary size with an arbitrary number of dimensions is constructed in
the form of a parametric Petri net. A technique for calculating linear invariants of parametric Petri nets is developed that
allows one to analyze information transmission processes in such a hypercube. The structure of complica...
A technique of the linear invariants calculation for infinite Petri nets with the regular structure is presented and studied on the example of square communication grids of an arbitrary size. It is proven that the compulsory buffering of the packets inevitably leads to possible blockings of communicating devices. The structure of complex deadlocks...
A technique of the linear invariants calculation for infinite Petri nets with the regular structure was presented and studied on the example of square communication grids of an arbitrary size. It was grounded that the compulsory buffering of the packets inevitably leads to possible blockings of communicating devices. The structure of complex deadlo...