On Termination of Transactions over Semantic Document Models

02/12/2020
by   Andrei Mantsivoda, et al.
0

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

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/29/2021

Verifying Transactional Consistency of MongoDB

MongoDB is a popular general-purpose, document-oriented, distributed NoS...
research
05/12/2022

A Multivariate Hawkes Process Model for Stablecoin-Cryptocurrency Depegging Event Dynamics

Stablecoins, digital assets pegged to a specific currency or commodity v...
research
06/23/2009

On Chase Termination Beyond Stratification

We study the termination problem of the chase algorithm, a central tool ...
research
12/04/2017

On the linkability of Zcash transactions

Zcash is a fork of Bitcoin with optional anonymity features. While trans...
research
01/02/2018

Um Sistema Multiagente no Combate ao Braqueamento de Capitais

Money laundering is a crime that makes it possible to finance other crim...
research
05/30/2023

Reviewing BPMN as a Modeling Notation for CACAO Security Playbooks

As cyber systems become increasingly complex and cybersecurity threats b...
research
05/18/2021

Informatiekunde – Visie 2003

This document discusses (in Dutch) the vision underlying the business in...

Please sign up or login with your details

Forgot password? Click here to reset