Automatic Verification of Data-Centric Business Processes

Damaggio, Elio; Deutsch, Alin; Hull, Richard; Vianu, Victor

doi:10.1007/978-3-642-23059-2_3

Cited by 25 publications

(20 citation statements)

References 39 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Declarative languages based on LTL (Linear Temporal Logic) [4] can be fruitfully applied in the context of process discovery [5], [6], [7] and compliance checking [8], [9], [10], [11], [12]. In [3], [13], the authors introduce an LTL-based declarative process modeling language called Declare.…”

Section: Introductionmentioning

confidence: 99%

Techniques for a Posteriori Analysis of Declarative Processes

Burattin

Maggi

Aalst

et al. 2012

2012 IEEE 16th International Enterprise Distributed Object Computing Conference

View full text Add to dashboard Cite

The increasing availability of event data recorded by information systems, electronic devices, web services and sensor networks provides detailed information about the actual processes in systems and organizations. Process mining techniques can use such event data to discover processes and check the conformance of process models. For conformance checking, we need to analyze whether the observed behavior matches the modeled behavior. In such settings, it is often desirable to specify the expected behavior in terms of a declarative process model rather than of a detailed procedural model. However, declarative models do not have an explicit notion of state, thus making it more difficult to pinpoint deviations and to explain and quantify discrepancies. This paper focuses on providing high-quality and understandable diagnostics. The notion of activation plays a key role in determining the effect of individual events on a given constraint. Using this notion, we are able to show cause-and-effect relations and measure the healthiness of the process

show abstract

Section: Introductionmentioning

confidence: 99%

Techniques for a Posteriori Analysis of Declarative Processes

Burattin

Maggi

Aalst

et al. 2012

2012 IEEE 16th International Enterprise Distributed Object Computing Conference

View full text Add to dashboard Cite

show abstract

“…LTL can be used to specify constraints on the ordering of activities (see also [11]). For instance, a constraint like "whenever activity a is executed, eventually activity b is executed" can be formally represented using LTL and, in particular, it can be written as (a → ♦b).…”

Section: Declarementioning

confidence: 99%

Efficient Discovery of Understandable Declarative Process Models from Event Logs

Maggi

Bose

Aalst

2012

Notes on Numerical Fluid Mechanics and Multidisciplinary Design

118

View full text Add to dashboard Cite

Abstract. Process mining techniques often reveal that real-life processes are more variable than anticipated. Although declarative process models are more suitable for less structured processes, most discovery techniques generate conventional procedural models. In this paper, we focus on discovering Declare models based on event logs. A Declare model is composed of temporal constraints. Despite the suitability of declarative process models for less structured processes, their discovery is far from trivial. Even for smaller processes there are many potential constraints. Moreover, there may be many constraints that are trivially true and that do not characterize the process well. Naively checking all possible constraints is computationally intractable and may lead to models with an excessive number of constraints. Therefore, we have developed an Apriori algorithm to reduce the search space. Moreover, we use new metrics to prune the model. As a result, we can quickly generate understandable Declare models for real-life event logs.

show abstract

“…Transition from one state to another depends on user's choices and the actual instances of the dynamic and static databases. -The artifact-centric approach was introduced by IBM research in [AN03] and studied in many works [BGL + 05, BCK + 07, BGH + 07, GS07, KRG07, KLW08, DHPV09, DDHV11,DDV11]. A Business artifact record key business-relevant entities.…”

Section: Related Workmentioning

confidence: 99%

Decidability and Complexity of Simulation Preorder for Data-Centric Web Services

Akroun

Benatallah

Nourine

et al. 2014

Service-Oriented Computing

View full text Add to dashboard Cite

In this thesis we address the problem of analyzing specifications of data-centric Web service interaction protocols (also called data-centric business protocols). Specifications of such protocols include data in addition to operation signatures and messages ordering constraints. Analysis of data-centric services is a complex task because of the inherently infinite states of the underlying service execution instances. Our work focuses on characterizing the problem of checking a refinement relation between service interaction protocol specifications. More specifically, we consider the problem of checking the simulation preorder when service business protocols are represented using data-centric state machines. First we study the Colombo model [BCG + 05]. In this framework, a service (i) exchanges messages using variables; (ii) acts on a shared database; (iii) has a transition based behavior. We show that the simulation test for unbounded Colombo is undecidable. Then, we consider the case of bounded Colombo where we show that simulation is (i) exptimecomplete for Colombo services without any access to the database (noted Colombo DB=∅), and (ii) 2exptime-complete when only bounded databases are considered (the obtained model is noted Colombo bound). In the second part of this thesis, we define a generic model to study the impact of various parameters on the simulation test in the context of datacentric services. The generic model is a guarded transition system acting (i.e., read and write) on databases (i.e., local and shared) and exchanging messages with its environment (i.e., other services or users). The model was designed with a database theory perspective, where all actions are viewed as queries (i.e modification of databases, messages exchanges and guards). In this context, we obtain the following results (i) for update free guarded services (i.e., generic services with guards and only able to send empty messages) the decidability of simulation is fully characterized w.r.t decidability of satisfiability of the query language used to express the guards augmented with a restrictive form of negation, (ii) for update free send services (i.e., generic services without guards and able to send as messages the result of queries over local and shared database), we exhibit sufficient conditions for both decidability and undecidability of simulation test w.r.t the language used to compute messages payloads, and (iii) we study the case of insert services (i.e., generic services without guards and with the ability of insert the result of queries into the local and the shared database). In this case, we study the simulation as well as the weak simulation relations where we show that: (i) the weak simulation is undecidable when the insertions are expressed as conjunctive queries, (ii) the simulation is undecidable if satisfiability of the query language used to express the insertion augmented with a restricted form of negation is undecidable. Finally, we study the interaction between the queries used as guards and the ones use...

show abstract

Automatic Verification of Data-Centric Business Processes

Cited by 25 publications

References 39 publications

Techniques for a Posteriori Analysis of Declarative Processes

Techniques for a Posteriori Analysis of Declarative Processes

Efficient Discovery of Understandable Declarative Process Models from Event Logs

Decidability and Complexity of Simulation Preorder for Data-Centric Web Services

Contact Info

Product

Resources

About