We consider the framework of Document Modeling, which lays the formal basis for representing the document lifecycle in Business Process Management systems. We formulate document models in the scope of the logic-based Semantic Modeling language and study the question whether transactions given by a document model terminate on any input. We show that in general this problem is undecidable and formulate sufficient conditions, which guarantee decidability and tractability of computing effects of transactions.

Andrei Mantsivoda, Dr. Sci. (Phys.–Math.), Prof., Irkutsk State University, 1, K. Marx st., Irkutsk, 664003, Russian Federation; Sobolev Institute of Mathematics, 4, Acad. Koptyug st., Novosibirsk, 630090, Russian Federation, e-mail: andrei@baikal.ru

Denis Ponomaryov, Cand. Sci. (Phys.–Math.), Ershov Institute of Informatics Systems, Sobolev Institute of Mathematics, Novosibirsk State University, 6, Lavrentyev av., Novosibirsk, 630090, Russian Federation, e-mail: ponom@iis.nsk.su

Mantsivoda A.V., Ponomaryov D.K. On Termination of Transactions over Semantic Document Models. The Bulletin of Irkutsk State University. Series Mathematics, 2020, vol. 31, pp. 111-131. https://doi.org/10.26516/1997-7670.2020.31.111

1. Ershov Yu.L., Goncharov S.S., Sviridenko D.I. Semantic Programming. Information processing 86: Proc. IFIP 10th World Comput. Congress. 1986, vol. 10, Elsevier Sci., Dublin, pp. 1093-1100.

2. Ershov Yu.L., Goncharov S.S., Sviridenko D.I. Semantic Foundations of Programming. Fundamentals of Computation Theory: Proc. Intern. Conf. FCT 87, Kazan, 116–122. Lect. Notes Comp. Sci., 1987, vol. 278. https://doi.org/10.1007/3-540-18740-5_28

3. Goncharov S.S., Sviridenko D.I. Σ-programming. Transl. II. Amer. Math. Soc., 1989, no. 142, pp. 101-121.

4. Goncharov S.S., Sviridenko D.I. Σ-programming and its Semantics. Vychisl. Systemy, 1987, no. 120, pp. 24-51. (in Russian).

5. Goncharov S.S., Sviridenko D.I. Theoretical Aspects of Σ-programming. Lect. Notes Comp. Sci., 1986, vol. 215, pp. 169-179. https://doi.org/10.1007/3-540-16444-8_13

6. Goncharov S.S. Conditional Terms in Semantic Programming. Siberian Mathematical Journal, 2017, vol. 58, no. 5, pp. 794-800. https://doi.org/10.1134/S0037446617050068

7. Goncharov S.S., Sviridenko D.I. The Logic Language of Polynomial Computability. Doklady Mathematics, 2019, vol. 99, no.2, pp. 11-14.

8. Goncharov S.S., Sviridenko D.I. Recursive Terms in Semantic Programming. Siberian Mathematical Journal, 2018, vol. 59, no. 6, pp. 1279-1290.

9. Kazakov I.A., Kustova I.A., Lazebnikova E.N., Mantsivoda A.V. Locally Simple Models Construction: Methodology and Practice. The Bulletin of Irkutsk State University. Series Mathematics, 2017, vol. 22, pp. 71-89. (in Russian). https://doi.org/10.26516/1997-7670.2017.22.71

10. Malykh A.A., Mantsivoda A.V. Document Models. The Bulletin of Irkutsk State University. Series Mathematics, 2017, vol. 21, pp. 89-107. (in Russian). https://doi.org/10.26516/1997-7670.2017.21.89

11. Mantsivoda A.V., Ponomaryov D.K. A Formalization of Document Models with Semantic Modelling. Bulletin of Irkutsk State University, Series Mathematics, 2019. vol. 27, pp. 36-54.

12. Ospichev S., Ponomarev D. On the Complexity of Formulas in Semantic Programming. Siberian Electronic Mathematical Reports, 2018, vol. 15, pp. 987-995.

13. Reiter R. Knowledge in Action: Logical Foundations for Describing and Implementing Dynamical Systems. MIT Press, 2001. https://doi.org/10.7551/mitpress/4074.001.0001

14. Vityaev E.E. Semantic Probablistic Inference of Predictions. The Bulletin of Irkutsk State University. Series Mathematics, 2017, vol. 21, pp. 33-50. (in Russian).