Advertisement

Analysis and Diagnostics of Competing Transport Processes on the Basis of the Bernstein – Russell – Narinyani Theorem

  • Ivan AndronchevEmail author
  • Sergey Nikischenkov
  • Valery Khaitbaev
Conference paper
  • 31 Downloads
Part of the Advances in Intelligent Systems and Computing book series (AISC, volume 1116)

Abstract

The paper considers an approach to the description, analysis and diagnosis of defects in competing multioperational technological transport processes on the basis of the use of the fundamental theorem of Bernstein - Russell - Narinyani on static parallelization of programs. Examples of formal descriptions of processes in the form of operator schemes are given. An addition to the Bernstein – Russell – Narinyani theorem is proposed in order to determine the competition between technological operations using material resources. A diagnostic interpretation of the theorem, variants of competitive dependencies between operations, and defects arising during their implementation are presented. The relevance of the analysis of internal parallelism of transport processes is shown. The information on the organization of the diagnostic subsystems and the problems of the practical application of the developed method of analysis and diagnosis of processes is provided.

Keywords

Transport process Competition of operations Operator scheme Defects Diagnostics 

References

  1. 1.
    Efanov, D., Sapozhnikov, V., Sapozhnikov, V.: Two-modulus codes with summation of on-data bits for technical diagnostics of discrete systems. Autom. Control Comput. Sci. 52(1), 1–12 (2018)CrossRefGoogle Scholar
  2. 2.
    Narinyani, A.: Looking for an approach to a theory of models for parallel computation. In: International Symposium on Theoretical Programming, pp. 247–284. Springer, Heidelberg (1974)CrossRefGoogle Scholar
  3. 3.
    Ershov, A., Lyapunov, A.: Formalization of the concept of program. Cybern. Syst. Anal. 3(5), 35–49 (1967)CrossRefGoogle Scholar
  4. 4.
    Kotov, V.: Theory of parallel programming. Part I: Survey of practical aspects. In: Advances in Information Systems Science, pp. 1–55. Springer, Boston (1976)Google Scholar
  5. 5.
    Narin’yani, A.: Theory of parallel programming. II. Survey of formal models. In: Advances in Information Systems Science, pp. 57–113. Springer, Boston (1976)CrossRefGoogle Scholar
  6. 6.
    Chudik, J., David, G., Kotov, V., Mirenkov, N., Ondas, J., Plander, I., Valkovskii, V.: Algorithms, software and Hardware of Parallel Computers. Springer, Heidelberg (2013)Google Scholar
  7. 7.
    Andrews, G.: Concurrent Programming: Principles and Practice. Benjamin/Cummings Publishing Company, San Francisco (1991)zbMATHGoogle Scholar
  8. 8.
    Keller, R.: Parallel program schemata and maximal parallelism I. Fundamental results. J. ACM (JACM) 20(3), 514–537 (1973)MathSciNetCrossRefGoogle Scholar
  9. 9.
    Tyugashev, A., Zheleznov, D., Nikishchenkov, S.: A technology and software toolset for design and verification of real-time control algorithms. Russ. Electr. Eng. 88(3), 154–158 (2017)CrossRefGoogle Scholar
  10. 10.
    Nikishchenkov, S.: Methods for monitoring of reconfigurable transport systems based on trigger functions. In: IOP Conference Series: Earth and Environmental Science, vol. 194, no. 6, p. 062025. IOP Publishing (2018)Google Scholar
  11. 11.
    Mahmood, A., McCluskey, E.: Concurrent error detection using watchdog processors-a survey. IEEE Trans. Comput. 37(2), 160–174 (1988)CrossRefGoogle Scholar
  12. 12.
    Efimova, T., Haitbaev, V., Pogorelova, E.: Intellectual algorithms for the digital platform of “Smart” transport. In: Digital Transformation of the Economy: Challenges, Trends and New Opportunities, pp. 411–418. Springer, Cham (2020)Google Scholar
  13. 13.
    Kasyanov, V., Evstigneev, V.: Graphs in Programming: Processing, Visualization and Application. BHV-Petersburg, St. Petersburg (2003)Google Scholar

Copyright information

© Springer Nature Switzerland AG 2020

Authors and Affiliations

  1. 1.Samara State University of TransportSamaraRussia

Personalised recommendations