On termination of transactions over semantic document models

DOI10.26516/1997-7670.2020.31.111MaRDI QIDQ2307928zbMATH OpenOpenAlexFDO

Authors A. V. Mantsivoda, Denis Konstantinovich Ponomarëv

Publication date 25 March 2020

Published in The Bulletin of Irkutsk State University. Series Mathematics (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial 4.0 International

Full work available at URL https://arxiv.org/abs/2002.05064, http://mathizv.isu.ru/en/article/file?id=1334

zbMATH Keywords

chasedocument modelsemantic modelingtransaction

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Database theory (68P15) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Abstract: 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 polynomial boundedness of effects of transactions.

Recommendations

• Document models
• Petri nets with structured data
• Towards semantic document modelling of business processes
• scientific article; zbMATH DE number 48033
• FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science

Cites work

• Conditional terms in semantic programming
• Document models
• scientific article; zbMATH DE number 4139721 (Why is no real title available?)
• scientific article; zbMATH DE number 3980456 (Why is no real title available?)
• scientific article; zbMATH DE number 4007715 (Why is no real title available?)
• scientific article; zbMATH DE number 4047058 (Why is no real title available?)
• scientific article; zbMATH DE number 1820675 (Why is no real title available?)
• Locally simple models construction: methodology and practice
• On the complexity of formulas in semantic programming
• Recursive terms in semantic programming
• Semantic probabilistic inference of predictions
• Σ-programming

Cited in

(5)

• Document models
• Towards semantic document modelling of business processes
• scientific article; zbMATH DE number 1810206 (Why is no real title available?)
• Semantic machine learning and slow thinking
• Object ontologies as a priori models for logical-probabilistic machine learning

This page was built for publication: On termination of transactions over semantic document models

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2307928)