{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T14:20:02Z","timestamp":1775053202040,"version":"3.50.1"},"reference-count":22,"publisher":"Pleiades Publishing Ltd","issue":"5","license":[{"start":{"date-parts":[[2010,9,1]],"date-time":"2010-09-01T00:00:00Z","timestamp":1283299200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2010,9,1]],"date-time":"2010-09-01T00:00:00Z","timestamp":1283299200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Program Comput Soft"],"published-print":{"date-parts":[[2010,9]]},"DOI":"10.1134\/s0361768810050038","type":"journal-article","created":{"date-parts":[[2010,9,21]],"date-time":"2010-09-21T02:24:48Z","timestamp":1285035888000},"page":"276-288","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Application of if-conversion to verification and optimization of workflows"],"prefix":"10.1134","volume":"36","author":[{"given":"A. A.","family":"Kalenkova","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"137","published-online":{"date-parts":[[2010,9,22]]},"reference":[{"issue":"2","key":"6079_CR1","first-page":"160","volume":"1","author":"A.A. Kalenkova","year":"2009","unstructured":"Kalenkova, A.A., Optimization of the Execution Time of Workflows Based on the Removal of Redundant Control Flows, Trudy MFTI, 2009, vol. 1, no. 2, pp. 160\u2013175.","journal-title":"Trudy MFTI"},{"key":"6079_CR2","doi-asserted-by":"crossref","unstructured":"Allen, J.R., Kennedy, K., Porterfield, C., and Warren, J., Conversion of Control Dependence to Data Dependence, Tenth Annual ACM Symp. on the Principles of Programming Languages, 1983, pp. 177\u2013189.","DOI":"10.1145\/567067.567085"},{"issue":"3","key":"6079_CR3","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1023\/A:1016031730365","volume":"2","author":"W.M.P. Aalst","year":"2002","unstructured":"Aalst, W.M.P., Hirnschall, A., and Verbeek, H.M.W., An Alternative Way to Analyze Workflow Graphs, Electronic Commerce Research, 2002, vol. 2, no. 3, pp. 195\u2013231.","journal-title":"Electronic Commerce Research"},{"key":"6079_CR4","first-page":"289","volume":"9","author":"H. Lin","year":"2002","unstructured":"Lin, H., Zhao, Z., Li, H., and Chen, Z.A., Novel Graph Reduction Algorithm to Identify Structural Conflicts, Proc. of the 35th Annual Hawaii Int. Conf. on System Sciences, 2002, vol. 9, p. 289.","journal-title":"Proc. of the 35th Annual Hawaii Int. Conf. on System Sciences"},{"issue":"3\u20134","key":"6079_CR5","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1023\/B:ITEM.0000031583.16306.0f","volume":"5","author":"H.H. Bi","year":"2004","unstructured":"Bi, H.H. and Zhao, J.L., Applying Propositional Logic to Workflow Verification, Information Technology and Management, 2004, vol. 5, no. 3\u20134, pp. 293\u2013318.","journal-title":"Information Technology and Management"},{"key":"6079_CR6","unstructured":"Tolstov, E.V., Problems of Workflow Simulation using Petri Nets, Cand. Sci. (Eng.) Dissertation, Moscow, 2006."},{"key":"6079_CR7","unstructured":"Netjes, M., Reijers, H.A., and Aaslt, W.M.P., On the Formal Generation of Process Redesigns, First Int. Workshop on Model-Driven Engineering for Business Process Management, 2008, pp. 49\u201360."},{"key":"6079_CR8","doi-asserted-by":"crossref","unstructured":"Cao, H., Jin, H., Wu, S., and Tao, Y., PGWFT: A Petri Net Based Grid Workflow Verification and Optimization Toolkit, Third Int. Conf. on Advances in Grid and Pervasive Computing, 2008, pp. 48\u201358.","DOI":"10.1007\/978-3-540-68083-3_8"},{"key":"6079_CR9","unstructured":"Terminology and Glossary \/ Workflow Management Coalition, 1999. http:\/\/www.wfmc.org\/Download-document\/WFMC-TC-1011-Ver-3-Terminology-and-Glossary-English.html."},{"key":"6079_CR10","volume-title":"Parellel\u2019nye vychisleniya","author":"V.V. Voevodin","year":"2004","unstructured":"Voevodin, V.V. and Voevodin, Vl.,V., Parellel\u2019nye vychisleniya (Parallel Computing), St.Petersburg: BHV-Peterburg, 2004."},{"issue":"3","key":"6079_CR11","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1023\/A:1022883727209","volume":"14","author":"W.M.P. Aalst","year":"2003","unstructured":"Aalst, W.M.P., Hofstede A.H.M., Kiepuszewski, B., and Barros, A.P., Workflow Patterns, Distributed and Parallel Databases, 2003, vol. 14, no. 3, pp. 5\u201351.","journal-title":"Distributed and Parallel Databases"},{"key":"6079_CR12","volume-title":"Optimizing Compilers for Modern Architectures: a Dependence-Based Approach","author":"K. Kennedy","year":"2001","unstructured":"Kennedy, K. and Allen, J.R., Optimizing Compilers for Modern Architectures: a Dependence-Based Approach, San-Francisco: Morgan Kaufmann, 2001."},{"key":"6079_CR13","unstructured":"Web Services Buisiness Process Execution Language Version 2.0, 2007 (Eds. Alves, A., Arkin, A., and Askary, S.), http:\/\/docs.oasis-open.org\/wsbpel\/2.0\/OS\/wsbpel-v2.0-OS.html."},{"key":"6079_CR14","unstructured":"Process Definition Interface \u2014 XML Process Definition Language 0.03, 2001 (Eds. Marin, M., Norin, R., and Shapiro, R.), http:\/\/xml.coverpages.org\/XPDL20010522.pdf."},{"key":"6079_CR15","unstructured":"Business Process Model and Notation (BMPN). FTF Beta1 for Version 2.0. Object Management Group, 2009, http:\/\/www.omg.org\/cgi-bin\/doc?dtc\/09-08-14.pdf."},{"key":"6079_CR16","unstructured":"Coreman, T., Leiserson, Ch., Rivest, R., and Stein, K., Introduction to Algorithms, Prentice-Hall, 2006. Translated under the title Algoritmy: postroenie i analiz, Moscow: Vil\u2019yams, 2007."},{"key":"6079_CR17","volume-title":"Svodimye grafy i graf-modely v programmirovanii","author":"T. Evstigneev","year":"1999","unstructured":"Evstigneev, T. and Kas\u2019yanov, V.N., Svodimye grafy i graf-modely v programmirovanii (Reducible Graphs and Graph-Models in Programming), Novosibirsk: IDMI, 1999."},{"key":"6079_CR18","unstructured":"Aho, A.V., Sethi, J.E., and Ulman, J.D., Compilers: Principles, Techniques, and Tools, Addison-Wesley, 1986. Translated under the title Kompilyatory: printsipy, tekhnologii, instrumenty, Moscow: Vil\u2019yams, 2003."},{"key":"6079_CR19","first-page":"242","volume":"40","author":"J. Dese","year":"1995","unstructured":"Dese, J. and Esparza, J., Free Choice Petri Nets, Cambridge Tracts in Theoretical Computer Science, 1995, vol. 40, p. 242.","journal-title":"Cambridge Tracts in Theoretical Computer Science"},{"key":"6079_CR20","first-page":"117","volume":"25","author":"W. Sadiq","year":"2000","unstructured":"Sadiq, W. and Orlowska, M.E., Analyzing Process Models Using Graph Reduction Techniques, The 11th Int. Conf. on Advanced Information Systems Engineering, 2000, vol. 25, pp. 117\u2013134.","journal-title":"The 11th Int. Conf. on Advanced Information Systems Engineering"},{"key":"6079_CR21","unstructured":"GeoNames, http:\/\/www.geonames.org\/."},{"key":"6079_CR22","unstructured":"ArcWeb Services, http:\/\/www2.arcwebservices.com\/v2006\/index.jsp."}],"container-title":["Programming and Computer Software"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1134\/S0361768810050038.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1134\/S0361768810050038","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1134\/S0361768810050038","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1134\/S0361768810050038.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T02:12:34Z","timestamp":1775009554000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1134\/S0361768810050038"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,9]]},"references-count":22,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2010,9]]}},"alternative-id":["6079"],"URL":"https:\/\/doi.org\/10.1134\/s0361768810050038","relation":{},"ISSN":["0361-7688","1608-3261"],"issn-type":[{"value":"0361-7688","type":"print"},{"value":"1608-3261","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,9]]},"assertion":[{"value":"9 March 2010","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 September 2010","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}