A Graph-Search Based Algorithm for Verifying Workflow Graphs

Perumal, Sinnakkrishnan; Mahanti, Ambuj

doi:10.1109/dexa.2005.17

Cited by 11 publications

(18 citation statements)

References 5 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…And Sinnakkrishnan P. [8], proposed a new algorithm which is, according to them, simpler and more efficient because its complexity is O(|F | 2 ) where |F | is the number of transitions (flow). As this algorithm operates two traversals in depth for each instance subgraph, its robustness increases with or-split node number and outgoing flow number of each of these nodes.…”

Section: Discussionmentioning

confidence: 98%

“…9. Counterexample of performance compared to [8] Property 1 (Termination). an algorithm finishes if it doesn't lead to a system blockage, an infinite buckle or all other problem that can prevent the completion of the execution process.…”

Section: Discussionmentioning

confidence: 99%

“…In this algorithm, the structural conflicts are identified after two Traversals in depth of every instance subgraph by using the procedures: CreateInstance-Subgraph (CIS) and Verify-Instance-Subgraph (V IS). Its complexity, according to them, is O(|F | 2 ) where |F | is the number of transitions (flow) [8].…”

Section: Mahanti-sinnakkrishnan Graph-traversal-based Algorithmmentioning

confidence: 99%

“…In the goal to verify or to assure the correctness of a process model, several propositions were made of which among others: reduction-based algorithms [4,7], graph-traversal-based algorithm [8,9], approach of transformation of not valid model in valid model [10] and approach of model conversion in Petri net [6]. As our approach does not concern this last point, we are not going to present it during this paper.…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

An Efficient Algorithm for Workflow Graph Structural Verification

Touré¹,

Bäına²,

Benali

2008

On the Move to Meaningful Internet Systems: OTM 2008

View full text Add to dashboard Cite

Abstract. Any big enterprise is organized around business process having a value towards its customers and its products. Appropriate definition, analysis, checking and improvement of those business process models are indispensable before their deployment within workflow management systems. In this paper, we focus on business process model verification that insures business process structural correctness. Our proposal consist in a new efficient hybrid algorithm of workflow graph structural validation combining graph reduction and traversal mechanisms. Our algorithm will be disussed and compared to existing workflow structural checking approaches from completeness and performance points of view.

show abstract

Section: Discussionmentioning

confidence: 98%

Section: Discussionmentioning

confidence: 99%

Section: Mahanti-sinnakkrishnan Graph-traversal-based Algorithmmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

An Efficient Algorithm for Workflow Graph Structural Verification

Touré¹,

Bäına²,

Benali

2008

On the Move to Meaningful Internet Systems: OTM 2008

View full text Add to dashboard Cite

show abstract

“…This involves identifying structural conflicts in the workflow process definition. MahantiSinnakkrishnan algorithm is a graph-search based algorithm for verifying workflow graphs and this algorithm is given in [5] and [6]. In this paper, intricacies of this algorithm in using typical graph search techniques for solving the problem of workflow verification are detailed.…”

mentioning

confidence: 99%

Applying Graph Search Techniques for Workflow Verification

Peramal

Mahanti

2007

2007 40th Annual Hawaii International Conference on System Sciences (HICSS'07)

View full text Add to dashboard Cite

Workflow verification is a critical topic in workflow management. This involves identifying structural conflicts in the workflow process definition. MahantiSinnakkrishnan algorithm is a graph-search based algorithm for verifying workflow graphs and this algorithm is given in [5] and [6]. In this paper, intricacies of this algorithm in using typical graph search techniques for solving the problem of workflow verification are detailed. AO* and Depth First Search are the two graph search techniques used in this algorithm.

show abstract

Practical Compiler-Based User Support during the Development of Business Processes

Prinz

Amme

2014

Lecture Notes in Computer Science

View full text Add to dashboard Cite

An erroneous execution of business processes causes high costs and could damage the prestige of the providing company. Therefore, validation of the correctness of business processes is essential. In general, business processes are described with Petri nets semantics, even though this kind of description allows only algorithms with a worse processing time and bad failure information to this moment.In this paper, we describe new compiler-based techniques that could be used instead of Petri net algorithms for the verification of business processes. Basic idea of our approach is, to start analyses on different points of workflow graphs and to find potential structural errors. These developed techniques improved other known approaches, as it guarantees a precise visualization and explanation of all determined structural errors, which substantially supports the development of business processes.

show abstract

A Graph-Search Based Algorithm for Verifying Workflow Graphs

Cited by 11 publications

References 5 publications

An Efficient Algorithm for Workflow Graph Structural Verification

An Efficient Algorithm for Workflow Graph Structural Verification

Applying Graph Search Techniques for Workflow Verification

Practical Compiler-Based User Support during the Development of Business Processes

Contact Info

Product

Resources

About