Process-centric views of data-driven business artifacts

Koutsos, Adrien; Vianu, Victor

doi:10.1016/j.jcss.2016.11.012

Cited by 6 publications

(5 citation statements)

References 31 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Further decidable fragments could be sought using covers [33], or aiming for compatibility with locally finite theories [32]. Moreover, a restricted version of the bounded lookback property could guarantee decidability of CTL * f , similarly to the way feedback freedom was strengthened in [35]. We conjecture that many of the DPNs used in the experiments could be in such a class.…”

Section: Discussionmentioning

confidence: 99%

CTL* model checking for data-aware dynamic systems with arithmetic

Felli¹,

Montali²,

Winkler³

2022

Preprint

View full text Add to dashboard Cite

The analysis of complex dynamic systems is a core research topic in formal methods and AI, and combined modelling of systems with data has gained increasing importance in applications such as business process management. In addition, process mining techniques are nowadays used to automatically mine process models from event data, often without correctness guarantees. Thus verification techniques for linear and branching time properties are needed to ensure desired behavior.Here we consider data-aware dynamic systems with arithmetic (DDSAs), which constitute a concise but expressive formalism of transition systems with linear arithmetic guards. We present a CTL * model checking procedure for DDSAs that relies on a finite-state abstraction by means of a set of formulas that capture variable configurations. Linear-time verification was shown to be decidable in specific classes of DDSAs where the constraint language or the control flow are suitably confined. We investigate several of these restrictions for the case of CTL * , with both positive and negative results: CTL * verification is proven decidable for monotonicity and integer periodicity constraint systems, but undecidable for feedback free and bounded lookback systems. To demonstrate the feasibility of our approach, we implemented it in the SMT-based prototype ada, showing that many practical business process models can be effectively analyzed.

show abstract

Section: Discussionmentioning

confidence: 99%

CTL* model checking for data-aware dynamic systems with arithmetic

Felli¹,

Montali²,

Winkler³

2022

Preprint

View full text Add to dashboard Cite

show abstract

“…Further decidable fragments could be sought using covers [33], or aiming for compatibility with locally finite theories [32]. Moreover, a restricted version of the bounded lookback property could guarantee decidability of CTL f , similarly to the way feedback freedom was in [35]. The implementation could be improved to avoid the computation of many similar formulas, thus gaining efficiency.…”

Section: Discussionmentioning

confidence: 99%

CTL$$^*$$ Model Checking for Data-Aware Dynamic Systems with Arithmetic

Felli

Montali

Winkler

2022

Automated Reasoning

View full text Add to dashboard Cite

The analysis of complex dynamic systems is a core research topic in formal methods and AI, and combined modelling of systems with data has gained increasing importance in applications such as business process management. In addition, process mining techniques are nowadays used to automatically mine process models from event data, often without correctness guarantees. Thus verification techniques for linear and branching time properties are needed to ensure desired behavior.Here we consider data-aware dynamic systems with arithmetic (DDSAs), which constitute a concise but expressive formalism of transition systems with linear arithmetic guards. We present a CTL$$^*$$ ∗ model checking procedure for DDSAs that addresses a generalization of the classical verification problem, namely to compute conditions on the initial state, called witness maps, under which the desired property holds. Linear-time verification was shown to be decidable for specific classes of DDSAs where the constraint language or the control flow are suitably confined. We investigate several of these restrictions for the case of CTL$$^*$$ ∗ , with both positive and negative results: witness maps can always be found for monotonicity and integer periodicity constraint systems, but verification of bounded lookback systems is undecidable. To demonstrate the feasibility of our approach, we implemented it in an SMT-based prototype, showing that many practical business process models can be effectively analyzed.

show abstract

“…In this light, a different paradigm for managing processes should be adopted. One such approach focuses on business data records-called business artifacts-that correspond to business-relevant objects, which are updated by a set of services that implement business process tasks [27,[33][34][35][36]. All organizations, regardless of their activity domain, rely on business records [33], which contain information on what they produce.…”

Section: Business Artifacts As Operational Agility Capabilitiesmentioning

confidence: 99%

“…Business artifacts reflect both data and process aspects and are used as building blocks in a process model [27]. A business artifact is described by an information model and an instance of it that reflects all the possible evolutions of the artifact over its lifecycle (in terms of activities or tasks acting on the artifact instance) [35,38,45]. Artifacts can be conceptualized as objects that are created and used in practice to facilitate work activities [46]; they are heterogeneous and dynamic.…”

Section: Artifact Modellingmentioning

confidence: 99%

On Increasing Service Organizations’ Agility: An Artifact-Based Framework to Elicit Improvement Initiatives

et al. 2023

View full text Add to dashboard Cite

The present research focuses on operational agility in service organizations, which are subject to variability through customers, service providers, suppliers, or unexpected events. As such, their management teams may face challenges in understanding their agility-related assets and success metrics, and furthermore in defining the scope of work for improvement initiatives. Previous research offers quite general insights into agility-related capabilities, practices, obstacles, or (agility-related) information quality evaluation. Yet, management teams need specific practices and techniques in order to improve operational agility capabilities, and thus increase their sustainable performance. We propose a conceptual framework and an artifact-centric algorithm that elicits and prioritizes improvement initiatives by (a) understanding agility-related assets by modelling operational business artifacts, (b) determining agility bottlenecks by identifying quality issues in operational artifacts, and (c) eliciting and prioritizing improvement initiatives to increase artifact quality. The framework application is discussed through a case study in a company operating in the rail freight industry, in which a set of initiatives to improve operational agility capabilities is obtained and prioritized. We conclude that the proposed algorithm is an applicable and relevant tool for management teams in service organizations, in their operational agility improvement endeavors.

show abstract

Process-centric views of data-driven business artifacts

Cited by 6 publications

References 31 publications

CTL* model checking for data-aware dynamic systems with arithmetic

CTL* model checking for data-aware dynamic systems with arithmetic

CTL$$^*$$ Model Checking for Data-Aware Dynamic Systems with Arithmetic

On Increasing Service Organizations’ Agility: An Artifact-Based Framework to Elicit Improvement Initiatives

Contact Info

Product

Resources

About