Applying Propositional Logic to Workflow Verification

Bi, Henry H.; Zhao, J. Leon

doi:10.1023/b:item.0000031583.16306.0f

Cited by 70 publications

(34 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…We implement this case with the open source software ActiveBPEL [12], the experiment is implemented on a testbed consisting of 2 IBM x 3650 servers and 12 PCs connected by a 100Mbps Ethernet. Each server is equipped with 4 Intel 2930MHz processors and 1GB memory running SuSE 10.2 Linux.…”

Section: Application Of Composition Transactionmentioning

confidence: 99%

Failure Recovery Dependency Analysis for Web Composition Transactions Based on Extended Petri-Nets

Mei¹,

Huang²,

Tang³

et al. 2015

IJUNESST

View full text Add to dashboard Cite

show abstract

Section: Application Of Composition Transactionmentioning

confidence: 99%

Failure Recovery Dependency Analysis for Web Composition Transactions Based on Extended Petri-Nets

Mei¹,

Huang²,

Tang³

et al. 2015

IJUNESST

View full text Add to dashboard Cite

show abstract

“…Well-formed business processes correspond to sound workflow nets (van der Aalst, 2007). Petri nets have been extensively studied since the mid 1990s as an abstraction of the workflow to check the soundness property (van der Aalst, 1998;Barkaoui and Ayed, 2011;Barkaoui and Petrucci, 1998;Basu and Blanning, 2000;Bi and Zhao, 2004;Clempner and Retchkiman, 2005;Clempner, 2014;Dehnert and Rittgen, 2001;van Dongen and Verbeek, 2005;Fu and Su, 2002;2004;van Hee and Voorhoeve, 2005;2004;Karamanolis and Wheater, 2000;Kindler and Reisig, 2000;Lin and Chen, 2002;Lohmann and Weinberg, 2006;Martens, 2005a;2005b;Mendling and van der Aalst, 2007;Sadiq and Orłowska, 1997;Salimifard and Wright, 2001;Vanhatalo and Leymann, 2007;ter Hofstede, 2001, Verbeek andWombacher, 2006;Wynn and ter Hofstede, 2005;Wynn and Edmond, 2006). In their research the authors have proposed alternative notions of soundness and more sophisticated languages, making these notions undecidable.…”

Section: Brief Reviewmentioning

confidence: 99%

An analytical method for well-formed workflow/Petri net verification of classical soundness

Clempner

2014

International Journal of Applied Mathematics and Computer Science

View full text Add to dashboard Cite

In this paper we consider workflow nets as dynamical systems governed by ordinary difference equations described by a particular class of Petri nets. Workflow nets are a formal model of business processes. Well-formed business processes correspond to sound workflow nets. Even if it seems necessary to require the soundness of workflow nets, there exist business processes with conditional behavior that will not necessarily satisfy the soundness property. In this sense, we propose an analytical method for showing that a workflow net satisfies the classical soundness property using a Petri net. To present our statement, we use Lyapunov stability theory to tackle the classical soundness verification problem for a class of dynamical systems described by Petri nets. This class of Petri nets allows a dynamical model representation that can be expressed in terms of difference equations. As a result, by applying Lyapunov theory, the classical soundness property for workflow nets is solved proving that the Petri net representation is stable. We show that a finite and non-blocking workflow net satisfies the sound property if and only if its corresponding PN is stable, i.e., given the incidence matrix A of the corresponding PN, there exists a Φ strictly positive m vector such that AΦ ≤ 0. The key contribution of the paper is the analytical method itself that satisfies part of the definition of the classical soundness requirements. The method is designed for practical applications, guarantees that anomalies can be detected without domain knowledge, and can be easily implemented into existing commercial systems that do not support the verification of workflows. The validity of the proposed method is successfully demonstrated by application examples.

show abstract

“…To find such an order we first establish a partial order between workflow activities which respects their dependencies; in doing this we also detect whether there are dependency conflicts that may result in deadlocks. While there is ample work in deadlock detection [3,5], we think that the technique we propose is clean, can be used for arbitrarily complex dependencies between activities, and uses well-proven, existing technology, which simplifies its implementation.…”

Section: Derivation Of Control and Data Dependenciesmentioning

confidence: 99%

A sharing-based approach to supporting adaptation in service compositions

2012

View full text Add to dashboard Cite

Data-related properties of the activities involved in a service composition can be used to facilitate several design-time and run-time adaptation tasks, such as service evolution, distributed enactment, and instance-level adaptation. A number of these properties can be expressed using a notion of sharing. We present an approach for automated inference of data properties based on sharing analysis, which is able to handle service compositions with complex control structures, involving loops and sub-workflows. The properties inferred can include data dependencies, information content, domain-defined attributes, privacy or confidentiality levels, among others. The analysis produces characterizations of the data and the activities in the composition in terms of minimal and maximal sharing, which can then be used to verify compliance of potential adaptation actions, or as supporting information in their generation. This sharing analysis approach can be used both at design time and at run time. In the latter case, the results of analysis can be refined using the composition traces (execution logs) at the point of execution, in order to support run-time adaptation.

show abstract

Applying Propositional Logic to Workflow Verification

Cited by 70 publications

References 13 publications

Failure Recovery Dependency Analysis for Web Composition Transactions Based on Extended Petri-Nets

Failure Recovery Dependency Analysis for Web Composition Transactions Based on Extended Petri-Nets

An analytical method for well-formed workflow/Petri net verification of classical soundness

A sharing-based approach to supporting adaptation in service compositions

Contact Info

Product

Resources

About