Scientific Journal

Applied Aspects of Information Technology


The aim of the work is to improve the quality of the computational process that solves the problem, due to its modeling and debugging based on the Petri net. The quality of the computational process is understood as the absence of errors (looping, paralysis, unreliability of some fragment, etc.) and its optimization according to the criterion of minimum complexity.The new approach to the analysis of the computational process, based on preliminary modeling by Petri nets of both fragments of computational processes and complete computational processes, is proposed. This will reveal many errors at the stage of modeling the computational process. The computational process is considered as a set of macrooperations, which are functionally, completed operations of various hierarchical levels. To locate macrooperations in a computational process, it is decomposed into elementary (basic) computational constructions. A statement that any computing process can be constructed on the basis of a relatively small number of macrooperations is formulated. To implement the new approach, the task of developing a method for constructing a Petri net according to a given computational process is formulated and solved. The essence of the proposed method consists in dividing the computational process into macrooperations, building a Petri net fragment for each macrooperation, modeling all fragments, assembling a complete Petri net from network fragments and modeling it. To implement the method, a procedure for constructing a computational process model is being developed. The stages of this procedure are described: decomposition of the computational process into macrooperations according to the proposed rules, translation of macrooperations into fragments of the Petri net and their modeling, collection of the complete Petri net by the proposed rules, and modeling the resulting Petri net. The results of the implementation of all stages of the procedure are recorded in the library, the aim of which is the accumulation of knowledge about the computational processes corresponding to them Petri nets and modeling results. This allows us to simplify the process of modeling a new computing process through the use of already debugged fragments. If the computational process contains errors or is not optimal, it is corrected, which allows to improve its quality according to the above criteria. By the example of sorting by inserts, the correctness of the operation of the constructed Petri net using the declared method is experimentally confirmed.

  1. Shulga, T. E., Ivanov, E. A., Slastihina, M. D. & Vagarina,N. S. (2016). “Developing a software system for automata-based code generation” [Text] Programming and Computer Software, Vol. 42, Issue 3, pp. 167-173,
  2. Lyubchenko, V. (2006) “K probleme sozdaniya modeli parallel'nyh vychislenij” [To the Problem of Creating a Parallel Computing Model] [Text] Proceedings of the Third International Conference “Parallel Computing and Control Problems, PACO'2006” (in Russian).
  3. Truhin, M. P. (2018). “Modelirovanie signalov i system” [Modeling Signals and Systems] [Text] Setevye modeli: Uch. Posobie, Publ. Izd-vo Ural. Un-ta, Yekaterinburg: Russian Federation, 204 p. (in Russian).
  4. Latsou, C., Dunnett, S. J. & Jackson, L. M. (2019). A new Methodology for Automated PetriNet Generation: Method Application [Text] Reliability Engineering and System Safety, Vol. 185, pp. 113-123,
  5. Badouel, E., Bernardinello, L., & Darondeau, P. (2015). “Petri Net Synthesis”. Springer Publ., Heidelberg: 339 p.
  6. Reisig, W. (2013). “Understanding Petri Nets”, “Modeling Techniques, Analysis Methods, Case Studies”, 211 p. Springer Publ., Hiedelberg:
  7. (2016). Kleijn, J. (eds) “Transactions on Petri Nets and Other Models of Concurrency XI”. “Lecture Notes in Computer Science”, Vol. 9930, Springer Publ., Berlin, Heidelberg: DOI
  8. (2015). Knight, S., Lanese, I., Lluch Lafuente A., Vieira, H. T. (Eds.). 8th Interaction and Concurrency Experience, (ICE 2015) EPTCS 189, pp. 53-67, doi:10.4204/EPTCS.189.6.
  9. Schlachter, U. (2016). “Petri Net Synthesis for Restricted Classes of Nets”. “Application and Theory of Petri Nets and Concurrency”. PETRI NETS 2016. “Lecture Notes in Computer Science”, Vol. 9698, Springer Publ., Cham. DOI
  10. Amparore, E. G., Donatelli, S., Beccuti, M., Garbi, G., & Miner, A. (2018) “Decision Diagrams for Petri Nets: A Comparison of Variable Ordering Algorithms”. “Transactions on Petri Nets and Other Models of Concurrency XIII”, “Lecture Notes in Computer Science”, Vol 11090. Springer Publ., Berlin, Heidelberg: DOI
  11. Shershakov, S. A., Kalenkova, A. A., & Lomazova, I. A. (2017) “Transition Systems Reduction: Balancing Between Precision and Simplicity”. “Transactions on Petri Nets and Other Models of Concurrency XII”. “Lecture Notes in Computer Science”, Vol 10470. Springer Publ., Berlin, Heidelberg: DOI
  12. Ribeiro, Joel & Carmona, Josep. (2016). “A Method for Assessing Parameter Impact on Control-Flow Discovery Algorithms”. “Transactions on Petri Nets and Other Models of Concurrency XI”. “Lecture Notes in Computer Science”, Vol. 9930. Springer Publ., Berlin, Heidelberg. DOI
  13. Verlan, A. F., Polozhaenko, S. A., Prokofieva, L. L., & Shylov, V. P. (2019). Algorithmization of the Failed Subschemes Localization Process,Herald of Advanced Information Technology,Odessa, Ukraine, Publ. Science & Technology, Vol. 2No.1, pp. 37-46, doi: 10.15276/hait.02.2019.4.
  14. Kalnauz, D. V., & Speranskiy,V. A. (2019). Productivity Estimation of Serverless Computing,Applied Aspects of Information Techology,Odessa, Ukraine, Publ. Science & Technology, Vol.2No.1, pp. 20-28, doi:10.15276/aait.02.2019.2.
  15. Paulin, O. “O funkcional'noj polnote elementov upravleniya vychislitel'nymi processam”. (2016). [On the Functional Completeness of Control Elements of Computing Processes], Scientific looking to the future. Odessa, Ukraine, Publ. Institute of Maritime and Enterprise, Release 4, Vol. 4, pp. 4-8 (in Russian). DOI: 10.21893/2415-7538-2016-04-4-018.
  16. Goodman, S. E. & Hedetniemi, S. T. (2002). “Introduction to the Design and Analysis of Algorithms”, Publ. Tata Mcgraw-Hill, New Delhi.
  17. Paulin, О., Komlevaya, N., & Marulin, S. (2016). “Ob upravleniya vyichislitelnyimi protsessami” [About a Management by the Calculable Processes].Trudy XVII International Research and Practice Conference “Modern Information and Electronic Technologies”, Odesa: Ukraine, Vol. 1, pp. 20-21 (in Russian).
  18. Paulin, O., Komlevaya, N., & Marulin, S. “O vydelenii makrooperacij iz vychislitel'nyh processov sortirovki massivov dannyh”. (2016). [Macro-operations Extraction out of Computation Process array Sorting Data]. CEUR Workshop Proceedings (in Russian) 84983598214&origin=inward&txGid=ccde5cf7d4ee8f843deb8079c5883e22.
  19. Paulin, O. “Vychislitel'nye modeli algoritmov pokrytiya” (2016). [Computational Models of Coverage Algorithms]. Computer science and Mathematical Methods in Modeling, Vol. No. 4, pp. 385-396. (in Russian)
  20. Paulin, О. “Vychislitel'nye modeli processa predvaritel'nogo sokrashcheniya tablicy pokrytiya”. (2017). [Computational Models of the Process of Preliminary Reduction of the Coverage Table], Computer science and mathematical methods in modeling, Vol. No. 4, pp. 333-338 (in Russian).
  21. Cabac, L., Haustermann, M. & Mosteller, D. (2018). “Software Development with Petri nets and agents: Approach, Frameworks and tool set” [Text] Science of Computer Programming, Vol. 157, pp.56-70.
  22. Dingle, N. J., Knottenbelt, W. J. & Suto, T. (2009). “PIPE2: a Tool for the Performance Evaluation of Generalized Stochastic Petri Nets”. [Text] Newsletter ACM SIGMETRICS Performance Evaluation, Vol. 36, Issue 4, pp. 34-39, NY, USA.
  23. “PIPE2: Platform-Independent Petri net Editor” [Electronic resource] Access mode: URL:, Title from the screen (Active link – 28.10.2019).
Last download:
17 Oct 2021


[ © KarelWintersky ] [ All articles ] [ All authors ]
[ © Odessa National Polytechnic University, 2018.]