Semantic Correctness in Adaptive Process Management Systems

Ly, Linh Thao; Rinderle, Stefanie; Dadam, Peter

doi:10.1007/11841760_14

Cited by 34 publications

(40 citation statements)

References 20 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…their controllability, and [27] propose a structure and approach to track processes across cross-organizational workflows. In addition, [15] propose a method for verifying semantic properties of a process w.r.t. execution traces once change operations have been applied, and [5] describe approaches to verify process integration operations.…”

Section: Related Workmentioning

confidence: 99%

Verifying Semantic Business Process Models in Inter-operation

Koliadis

Ghose

2007

IEEE International Conference on Services Computing (SCC 2007)

View full text Add to dashboard Cite

Process inter-operation is characterized as cooperative interactions among loosely coupled autonomous constituents to adaptively fulfill system-wide purpose. Issues of inconsistency can be anticipated in interoperating processes given their independent management and design. To reduce inconsistency (that may contribute to failures) effective methods for statically verifying behavioral interoperability are required. This paper contributes a method for practical, semantic verification of interoperating processes (as represented with BPMN models). We provide methods to evaluate consistency during process design where annotation of the immediate effect of tasks and sub-processes has been provided. Furthermore, some guidelines are defined against common models of inter-operation for scoping traceability to possible causes of inconsistency. This supports subsequent resolution efforts. Disciplines Physical Sciences and MathematicsPublication Details Koliadis, G. & Ghose, A. (2007 AbstractProcess inter-operation is characterized as cooperative interactions among loosely coupled autonomous constituents to adaptively fulfill system-wide purpose. Issues of inconsistency can be anticipated in inter-operating processes given their independent management and design. To reduce inconsistency (that may contribute to failures) effective methods for statically verifying behavioral interoperability are required. This paper contributes a method for practical, semantic verification of interoperating processes (as represented with BPMN models). We provide methods to evaluate consistency during process design where annotation of the immediate effect of tasks and sub-processes has been provided. Furthermore, some guidelines are defined against common models of inter-operation for scoping traceability to possible causes of inconsistency. This supports subsequent resolution efforts.

show abstract

Section: Related Workmentioning

confidence: 99%

Verifying Semantic Business Process Models in Inter-operation

Koliadis

Ghose

2007

IEEE International Conference on Services Computing (SCC 2007)

View full text Add to dashboard Cite

show abstract

“…The tasks are annotated with the data that is created, read or written by the task. Similarly, [24] uses WSM nets which represent both the control flow and the data flow, although the data flow is limited to read and write dependencies between activities and data. [25] represents associations in an operational model, which shows tasks (or services) as nodes connected using arrows or edges.…”

Section: Process-centric Approachesmentioning

confidence: 99%

Specifying Artifact-Centric Business Process Models in UML

Estañol

Queralt

Sancho

et al. 2015

Lecture Notes in Business Information Processing

View full text Add to dashboard Cite

Abstract. In recent years, the artifact-centric approach to process modeling has attracted a lot of attention. One of the research lines in this area is finding a suitable way to represent the dimensions in this approach. Bearing this in mind, this paper proposes a way to specify artifact-centric business process models by means of well-known UML diagrams, from a high-level of abstraction and with a technology-independent perspective. UML is a graphical language, widely used and with a precise semantics.

show abstract

“…The approach of [25,26] checks a notion of semantic correctness that builds on annotations to tasks as being mutually exclusive or dependent. In the first case they cannot co-occur in a trace, in the second case they must appear in a certain order.…”

Section: Compliance Specification and Checkingmentioning

confidence: 99%

“…To model that b depends on a, we simply add a to the precondition of b. Hence the model considered by [25,26] can be viewed as a special case of our framework. On the algorithms side, [25,26] consider exploration of execution traces, and propose techniques to speed up compliance checking for adapted processes, based on excluding paths that are not affected by the changes made in the adaptation.…”

Section: Compliance Specification and Checkingmentioning

confidence: 99%

On compliance checking for clausal constraints in annotated process models

Hoffmann¹,

Weber

Governatori

2009

Inf Syst Front

View full text Add to dashboard Cite

Compliance management is important in several industry sectors where there is a high incidence of regulatory control. It must be ensured that business practices, as reflected in business processes, comply with the rules. Such compliance checks are challenging due to (1) the different life cycles of rules and processes, and (2) their disparate representations.(1) requires retrospective checking of process models. To address (2), we herein devise a framework where processes are annotated to capture the semantics of task execution, and compliance is checked against a set of constraints posing restrictions on the desirable process states. Each constraint is a clause, i.e., a disjunction of literals. If a process can reach a state that falsifies all literals of one of the constraints, then that constraint is violated in that state, and indicates non-compliance.Naively, such compliance can be checked by enumerating all reachable states. Since long waiting times are undesirable, it is important to develop efficient (low-order polynomial time) algorithms that (a) perform exact compliance checking for restricted cases, or (b) perform approximate compliance checking for more general cases. Herein, we observe that methods of both kinds can be defined as a natural extension of our earlier work on semantic business process validation. We devise one method of type (a), and we devise two methods of type (b); both are based on similar restrictions to the processes, where the restrictions made by methods (b) are a subset of those made by method (a). The approximate methods each guarantee either of soundness (finding only non-compliances) or completeness (finding all non-compliances). We describe how one can trace the state evolution back to the process

show abstract

Semantic Correctness in Adaptive Process Management Systems

Cited by 34 publications

References 20 publications

Verifying Semantic Business Process Models in Inter-operation

Verifying Semantic Business Process Models in Inter-operation

Specifying Artifact-Centric Business Process Models in UML

On compliance checking for clausal constraints in annotated process models

Contact Info

Product

Resources

About