Loading…
Formalized description of cyber-physical systems models using temporary non-deterministic automata
The principles of building finite state automata taking into account temporal logic were considered. In this case, time delays of the input symbol are added to the elements of the finite state automaton, which allow the automaton to change its state without producing an output symbol, as well as del...
Saved in:
Published in: | Journal of physics. Conference series 2021-04, Vol.1889 (2), p.22068 |
---|---|
Main Authors: | , , , , , , , |
Format: | Article |
Language: | English |
Subjects: | |
Citations: | Items that this one cites Items that cite this one |
Online Access: | Get full text |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Summary: | The principles of building finite state automata taking into account temporal logic were considered. In this case, time delays of the input symbol are added to the elements of the finite state automaton, which allow the automaton to change its state without producing an output symbol, as well as delays of the output symbol that determine the necessary time interval for the corresponding transition. The main approaches to the definition of the concept of a process, such as “process is a state” and “process is a transition”, which are characterized by the principles of signal processing, taking into account the possibility of saving the state and forming a queue for signal processing, are distinguished. The scientific novelty of this article lies in the approach to the formation of a hierarchical cyber system and the use of temporary SNDA. This method allows to synchronize processes in multithreaded data processing in complex organized, multilevel systems and excludes the possibility of unstable operation, and also improves the performance of the entire complex. As a visual representation of the model of the created principle of temporal non-deterministic automata, a system of grinding and transferring grain in a mill was used. |
---|---|
ISSN: | 1742-6588 1742-6596 |
DOI: | 10.1088/1742-6596/1889/2/022068 |