Abstract
The authors substantiate the proof of the theorem about design workflows graph schemes correctness presented in visual languages form. In this work typical incorrect structures and techniques for constructing correct design workflows graph diagrams are described. Also, the meaning of design workflows graph scheme correctness is given. Definition of correctness is given and theorem on the design workflows diagram into algorithm diagrammatic form transformation and vice versa is formulated and proved. The results obtained provide, in scientific terms, the acquisition of new knowledge in the study of the complex technical systems behavior. In practical issue, the work will allow designers to avoid costly design errors in the complex products computer-aided design in the large industrial enterprise context at the mockup layout stage.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Voit, N., Kirillov, S., Bochkov, S., Ionova, I.: Analytical model of design workflows organization in the automated design of complex technical products. In: Lopata, A., Butkienė, R., Gudonienė, D., Sukackė, V. (eds.) ICIST 2020. CCIS, vol. 1283, pp. 84–101. Springer, Cham (2020). https://doi.org/10.1007/978-3-030-59506-7_8
Voit, N.N.: The ensemble principle and analytical model of project workflow organization. Autom. Control Process. 61(3), 124–137 (2020). https://doi.org/10.35752/1991-2927-2020-3-61-124-137
Voit, N., Bochkov, S., Kirillov, S.: Temporal automaton RVTI-grammar for the diagrammatic design workflow models analysis. In: 2020 IEEE 14th International Conference on Application of Information and Communication Technologies (AICT 2020). IEEE (2020). https://doi.org/10.1109/aict50176.2020.9368810
Repa, V., Bruckner, T.: Methodology for modeling and analysis of business processes (MMABP). J. Syst. Integr. 6(4), 17–28 (2015)
Amjad, A., Azam, F., Anwar, M.W., Buttm, W.H.: Verification of event-driven process chain with timed automata and time Petri nets. In: 9th IEEE-GCC Conference and Exhibition (GCCCE). IEEE (2017). https://doi.org/10.1109/IEEEGCC.2017.8448053
Jugel, D., Kehrer, S., Schweda, C.M., Zimmermann, A.: Providing EA decision support for stakeholders by automated analyses. In: Digital Enterprise Computing (DEC 2015), pp. 151–162. Gesellschaft für Informatik e.V, Bonn, Germany (2015)
Feja, S., Fötsch, D.: Model checking with graphical validation rules. In: Proceedings of 15th Annual IEEE International Conference on Workshop Engineering of Computer Based System (ECBS), pp. 117–125. IEEE, USA (2008). https://doi.org/10.1109/ECBS.2008.45
Pfeiffer, J.-H., Rossak W.R., Speck, A.: Applying model checking to workflow verification. In: Proceedings, 11th IEEE International Conference and Workshop on the Engineering of Computer-Based Systems, pp. 144–151. IEEE (2004)
Mendling, J., Verbeek, H.M.W., van Dongen, B.F., van der Aalst, W.M.P., Neumann, G.: Detection and prediction of errors in EPCs of the SAP reference model. Data Knowl. Eng. 1(64), 312–329 (2008)
van Dongen, B.F., van der Aalst, W.M.P., Verbeek, H.M.W.: Verification of EPCs: using reduction rules and petri nets. In: Pastor, O., Falcão e Cunha, J. (eds.) CAiSE 2005. LNCS, vol. 3520, pp. 372–386. Springer, Heidelberg (2005). https://doi.org/10.1007/11431855_26
van der Aalst, W.M.P., et al.: ProM 4.0: comprehensive support for real process analysis. In: Kleijn, J., Yakovlev, A. (eds.) ICATPN 2007. LNCS, vol. 4546, pp. 484–494. Springer, Heidelberg (2007). https://doi.org/10.1007/978-3-540-73094-1_28
van der Aalst, W.M.P.: Formalization and verification of event-driven process chains. Inf. Softw. Technol. 10(41), 639–650 (1999)
Napalkov, A.: Human Brain and Artificial Intelligence. MSU, Moscow (1985)
Plummer, W.: Asynchronous arbiters. IEEE Trans. Comput. 1(C-21), 37–42 (1972)
Corsini, P., Frosini, G.: A model for asynchronous control networks. Digit. Process. 2, 47–62 (1976)
Rumbaugh, J.: A data flow multiprocessor. IEEE Trans. Comput. 26(1), 138–147 (1977)
Anishev, P.: Methods of Parallel Microprogramming. Nauka, Novosibirsk (1981)
Baranov, S.: Synthesis of Microprogram State Machines. Energiya, Leningrad (1979)
Virolainen, A.V.: Modeling business processes. Best Sci. Article 2019, 82–86 (2019)
Chernyshov, A.S.: Analysis of the methods of modeling automated systems. Information Technology and Control Automation, pp. 363–370 (2019)
Kopp, A., Orlovskyi, D.: An approach to analysis and optimization of business process models in BPMN notation. Inf. Process. Syst. 2(45), 108–116 (2018)
Sergievskiy, M.V., Kirpichnikova, K.K.: Validating and optimizing UML class diagrams. Cloud Sci. 5(2), 367–378 (2018)
Bohdan, I., Zadorozhnii, A.: The classification of errors on UML-diagrams occuring in the development of IT-projects. Tech. Sci. Technol. 1, 68–78 (2018)
Kopp, A., Orlovskyi, D.: Analysis and optimization of business process models in BPMN and EPC notation. Tech. Sci. Technol. 4(14), 145–152 (2018)
Anseeuw, J., et al.: Design time validation for the correct execution of BPMN collaborations. In: CLOSER (1), pp. 49–58 (2016)
Ramos-Merino, M., et al.: A pattern based method for simplifying a BPMN process model. Appl. Sci. 9(11), 2322 (2019)
Claes, J., Vandecaveye, G.: The impact of confusion on syntax errors in simple sequence flow models in BPMN. In: Proper, H.A., Stirna, J. (eds.) Advanced Information Systems Engineering Workshops: CAiSE 2019 International Workshops, Rome, Italy, June 3-7, 2019, Proceedings, pp. 5–16. Springer, Cham (2019). https://doi.org/10.1007/978-3-030-20948-3_1
Lima, L., Tavares, A., Nogueira, S.C.: A framework for verifying deadlock and nondeterminism in UML activity diagrams based on CSP. Sci. Comput. Program. 197, 102497 (2020)
Huang, H., Peng, R., Feng, Z.: Efficient and exact query of large process model repositories in cloud workflow systems. IEEE Trans. Serv. Comput. 11(5), 821–832 (2015)
Aalst, W.M.P.: Everything you always wanted to know about petri nets, but were afraid to ask. In: Hildebrandt, T., van Dongen, B.F., Röglinger, M., Mendling, J. (eds.) BPM 2019. LNCS, vol. 11675, pp. 3–9. Springer, Cham (2019). https://doi.org/10.1007/978-3-030-26619-6_1
Barash, M., Okhotin, A.: Generalized LR parsing algorithm for grammars with one-sided contexts. Theory Comput. Syst. 61(2), 581–605 (2016). https://doi.org/10.1007/s00224-016-9683-3
Bakinova, E., Basharin, A., Batmanov, I., Lyubort, K., Okhotin, A., Sazhneva, E.: Formal languages over GF(2). In: Klein, S.T., Martín-Vide, C., Shapira, D. (eds.) LATA 2018. LNCS, vol. 10792, pp. 68–79. Springer, Cham (2018). https://doi.org/10.1007/978-3-319-77313-1_5
Gorokhov, A., Grigorev, S.: Extended context-free grammars parsing with generalized LL. In: Itsykson, V., Scedrov, A., Zakharov, V. (eds.) TMPA 2017. CCIS, vol. 779, pp. 24–37. Springer, Cham (2018). https://doi.org/10.1007/978-3-319-71734-0_3
Afanasyev, A.N., Voit, N.N., Kirillov, S.Y.: Temporal automata RVTI-grammar for processing diagrams in visual languages as BPMN, EEPC and ASKON-Volga. In: ACM International Conference Proceeding Series: 5, Istanbul, pp. 71–75 (2019)
The Standish Group. https://www.standishgroup.com/
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2021 Springer Nature Switzerland AG
About this paper
Cite this paper
Voit, N.N., Bochkov, S.I. (2021). Design Workflows Graph Schemes Correctness Proof in Computer Aided Design Activity. In: Lopata, A., Gudonienė, D., Butkienė, R. (eds) Information and Software Technologies. ICIST 2021. Communications in Computer and Information Science, vol 1486. Springer, Cham. https://doi.org/10.1007/978-3-030-88304-1_4
Download citation
DOI: https://doi.org/10.1007/978-3-030-88304-1_4
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-88303-4
Online ISBN: 978-3-030-88304-1
eBook Packages: Computer ScienceComputer Science (R0)