Research of a multithreaded non-deterministic system model

Mikhail M Butaev,Dmitry V Pashchenko ,Dmitry A Trokoz,Tatyana Yu Pashchenko,A.i Martyshkin ,Mikhail Yu Babich

doi:10.5377/nexo.v34i01.11297

Mikhail M Butaev, Dmitry V Pashchenko + Show 4 more

Open Access

https://doi.org/10.5377/nexo.v34i01.11297

Copy DOI

Abstract

Managing the systems which behaviour is non-deterministic is one of the most important problems in modern management theory. Today, systems with structural and behavioural complexity are prevalent in all areas of human activity, and therefore, their research is of the utmost importance. Such systems, as opposed to deterministic systems, are called non-deterministic. They are characterised by difficult predictable behaviour determined both by external random influences, and within the systems themselves. A clear example of a non-deterministic system is crowds of people, factories, and computer networks and systems. The problem of non-deterministic behaviour directly within the context of professional activities can be seen using an example of building syntactic analysers. The aim of the paper is to design a class of systems oriented towards supporting elements of a discrete event model. The target of research is to simulate discrete event models. The subject of research is a creation of a discrete event model based on the behaviour of an undetermined finite state automaton. During the preparation of the paper, there was developed and practically implemented an algorithm for the application, which materializes the principle of working with threads. The results obtained in the paper are aimed at solving the problem of parallel data processing based on the parallelism of NFA's (non-deterministic finite automaton) behaviour when reading the input string characters. As a result, this should have a positive impact on the regulation of the simulation processes of a non-deterministic system, increasing its efficiency and stability. In conclusion, the algorithm of the application work is disclosed and conclusions about the effectiveness and efficiency of its development are drawn.

Highlights

The problem of non-determinism directly within the professional activity framework can be seen using an example of building syntactic analysers
A distinctive feature of a Nondeterministic Finite Automaton (NFA) is that the transition from one state to another is not clearly defined
This means that if there is a situation of alternative transitions, the automaton will make a simultaneous transition to several states under given conditions

Summary

Introduction

The problem of non-determinism directly within the professional activity framework can be seen using an example of building syntactic analysers. The first LR analysers could only perform one operation at a time. This algorithm took a lot of time to execute the program, and this time rises exponentially depending on the quantity of parameters. In 1984, a GLR-analyser was developed to be able to process several processes in parallel. The author of this development was Masaru Tomita, a Japanese scientist. He proposed a generalised algorithm for the LR parser, which allows us, unlike its predecessor, to work with vague grammars. At the heart of his idea, there is the parallelization of stacks

Objectives

Methods

Results

Conclusion