Serhii L. Kryvyi
Serhii L. Kryvyi
Professor

Information

Position: Professor
Degree: Doctor of Physical and Mathematical Science
Title: Professor
Room: 605 б
Phone: 259-05-11
E-mail:
Research interests: automata theory, theory of Petri nets, software verification, discrete mathematics, computational complexity theory, recursion theory, technology of software creation, applied mathematical logic, graph theory, cryptography

Courses:

Mathematical Foundations of Information Security
Constraint Programming
Theoretical Foundations and Methods of Information Systems Development
Algebraic and Automata-Based Methods of Software Design

Publications:

  1. S. Kryvyy, L. Matvyeyeva, M. Lopatina Automatic Modeling and Analysis of MSC-specified Systems // Fundamenta Informaticae, 2005, Volume 67, Number 1-3, pp. 107-120.
  2. S. Krivoi, L. Matvyeyeva, W. Grzywacz Automata-based method for solving systems of linear constraints in {0, 1} // International Journal "Information Theories & Applications", 2005, Volume 12, Number 4, pp. 362-368.
  3. S. L. Kryvyi, A. N. Chebotarev Checking the satisfiability of formulas represented in disjunctive normal form in the language L. II // Cybernetics and Systems Analysis, 2005, Volume 41, Issue 6, pp. 800-807.
  4. S. Krivoi, M. Hajder, P. Dymora, M. Mazurek The matrix method of determining the fault tolerance degree of computer network topology // International Journal "Information Theories & Applications", 2006, Volume 13, Number 3, pp. 221-227.
  5. S. L. Kryvyi Algorithms for solving systems of linear diophantine equations in integer domains // Cybernetics and Systems Analysis, 2006, Volume 42, Issue 2, pp. 163-175.
  6. S. L. Kryvyi Algorithms for solution of systems of linear diophantine equations in residue fields // Cybernetics and Systems Analysis, 2007, Volume 43, Issue 2, pp. 171-178.
  7. A. Chebotarev, S. Krivoi Improved Resolution-Based Method for Satisfiability Checking Formulas of the Language L // Perspectives of Systems Informatics, 2007, Volume 4378 of the series Lecture Notes in Computer Science pp. 438-442.
  8. S. L. Kryvyi Algorithms for solving systems of linear diophantine equations in residue rings // Cybernetics and Systems Analysis, 2007, Volume 43, Issue 6, pp. 787-798.
  9. S. Kryvyi, L. Matvyeyeva Algorithm of translation of MSC-specified System into Petri Net // Fundamenta Informaticae, 2007, Volume 79, Number 3-4, pp. 431-445, 2007 pp. 68-79.
  10. S. Krivoi, L. Matveyeva, Y. Lukianova, О. Sedleckaya Ontology View on Automata Theory // International Journal "Information Theories & Applications", 2008, Volume 15, Number 4, pp. 337-344.
  11. S. Kryvyi, O. Chugayenko Extended Algorithm for Translation of MSC-Diagram into Petri Nets // International Book Series Information Science & Computing, Book 1: Algorithmic and Mathematical Foundations of the Artificial Intelligence, ITHEA, 2008, pp. 68-74.
  12. S. Kryvyi, O. Khodzinskyi Presentation of ontologies and operations on ontologies in finite-state machines theory // International Journal "Information Theories & Applications", 2009, Volume 16, Issue 4, pp. 349-355.
  13. S. L. Kryvyi, A. V. Chugayenko Formal methods for analysis of discrete systems using a specification language // Cybernetics and Systems Analysis, 2009, Volume 45, Issue 4, pp. 528-543.
  14. S. L. Kryvyi An algorithm for constructing the basis of the solution set for systems of linear Diophantine equations over the ring of integers // Cybernetics and Systems Analysis, 2009, Volume 45, Issue 6, pp. 875-880.
  15. S. L. Kryvyi, O. V. Chugayenko, L. E. Matveeva Exploring the properties of MSC documents by translating them into Petri nets // Cybernetics and Systems Analysis, 2009, Volume 45, Issue 6, pp. 997-1003.
  16. S. L. Kryvyi Finite-state automata in information technologies // Cybernetics and Systems Analysis, 2011, Volume 47, Issue 5, pp. 669-683.
  17. V. N. Opanasenko, S. L. Kryvyi Partitioning the full range of boolean functions based on the threshold and threshold relation // Cybernetics and Systems Analysis, 2012, Volume 48, Issue 3, pp. 459-468.
  18. S. L. Kryvyi, P. Dymora, M. Mazurek The computational algorithm for supported solutions set of linear Diophantine equations systems in a ring of integer numbers // International Journal of Modern Engineering Research, 2012, Volume 2, Issue 6, pp. 4133-4137.
  19. S. L. Kryvyi, O. M. Maksymets Program Verification: State of the Art, Problems, and Results. I // Cybernetics and Systems Analysis, 2013, Volume 49, Issue 6, pp. 805-814.
  20. A. Palagin, V. Opanasenko, S. Krivoi The structure of FPGA-based cyclic-code converters // Optical Memory and Neural Networks, 2013, Volume 22, Issue 4, pp. 207-216.
  21. S. Kryvyi, O. Maksymets Program Invariants Generation over Polynomial Ring using Iterative Methods // International Journal "Information Theories & Applications", 2013, Volume 20, Number 2, pp. 113-121.
  22. S. Kryvyi, D. Bibikov Analysis and processing of the text information aimed at extracting basis knowledge // International Journal "Information Content and Processing", 2014, Volume 1, Number 1, pp. 28-36.
  23. S. L. Kryvyi, O. M. Maksymets Program Verification: State of the Art, Problems, and Results. II // Cybernetics and Systems Analysis, 2014, Volume 50, Issue 1, pp. 8-16.
  24. S. L. Kryvyi Combinatorial Method for Solving Systems of Linear Constraints // Cybernetics and Systems Analysis, 2014, Volume 50, Issue 4, pp. 495-50.
  25. V. N. Opanasenko, S. L. Kryvyi Synthesis of Adaptive Logical Networks on the Basis of Zhegalkin Polynomials // Cybernetics and Systems Analysis, 2015, Volume 51, Issue 6, pp. 969-977.
  26. S. L. Kryvyi Solution Algorithms for Systems of Linear Equations Over Residue Rings // Cybernetics and Systems Analysis, 2016, Volume 52, Issue 5, pp. 791-801.