A Top-Down Petri Net-Based Approach for Dynamic Workflow Modeling

Chrząstowski-Wachtel, Piotr; Benatallah, Boualem; Hamadi, Rachid; O'Dell, Milton; Susanto, Adi

doi:10.1007/3-540-44895-0_23

Cited by 43 publications

(25 citation statements)

References 5 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The proof follows the one given in [12]. It can easily be checked that making any of the refinement rules doesn't jeopardize the possibility of obtaining a sound dataflow by labeling of a blank dataflow.…”

Section: Proof (Sketch)mentioning

confidence: 76%

See 1 more Smart Citation

Petri Net + Nested Relational Calculus = Dataflow

Hidders

Kwasnikowska

Sroka

et al. 2005

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. In this paper we propose a formal, graphical workflow language for dataflows, i.e., workflows where large amounts of complex data are manipulated and the structure of the manipulated data is reflected in the structure of the workflow. It is a common extension of -Petri nets, which are responsible for the organization of the processing tasks, and -Nested relational calculus, which is a database query language over complex objects, and is responsible for handling collections of data items (in particular, for iteration) and for the typing system.We demonstrate that dataflows constructed in hierarchical manner, according to a set of refinement rules we propose, are sound : initiated with a single token (which may represent a complex scientific data collection) in the input node, terminate with a single token in the output node (which represents the output data collection). In particular they always process all of the input data, leave no "debris data" behind and the output is always eventually computed.

show abstract

Section: Proof (Sketch)mentioning

confidence: 76%

“…All the input edges of the transformed node are copied to all the resulting entry nodes, and an analogous rule applies to the output edges. The rules and the aim to make dataflows structured as in structured programming languages were motivated by the work done on workflow nets by Piotr Chrz astowski [12].…”

Section: Refinement Rulesmentioning

confidence: 99%

Petri Net + Nested Relational Calculus = Dataflow

Hidders

Kwasnikowska

Sroka

et al. 2005

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

“…Top-Down Petri NetBased Approach [19] It increases the soundness of resulting workflow nets Petri Nets Based JAVA Deadlock risks can be reduced.…”

Section: Future Work Environmentmentioning

confidence: 99%

Design and Deployment of Workflows in Cloud Environment

Bala¹,

Chana²

2012

IJCA

View full text Add to dashboard Cite

Cloud computing is a new benchmark towards enterprise application development that can effectively facilitate the execution of workflows in business process management systems. Workflow applications often require very complex execution environments that are difficult to create otherwise. Integration of the workflow management systems for application deployment with any of the cloud platforms is a tedious task. Therefore, various cloud services are required to execute workflows along with workflow management software in cloud environment. In this paper, a comparative analysis of workflow design approaches has been discussed .This paper presents the challenges for implementing workflows in cloud computing and state of the art of workflow design along with a comparison of various workflow engines available. Design of workflow for a real time application has also been discussed with the help of a case study. The experimental results demonstrate how workflow for enterprise applications can be designed, validated, implemented and deployed on any major cloud infrastructures.

show abstract

“…One way of having a correct design of recovery regions is to use a top-down approach and region refinement operators we have defined in [11,25].…”

Section: There Are No Isolated Places or Transitions)mentioning

confidence: 99%

Self-adapting recovery nets for policy-driven exception handling in business processes

Hamadi

Benatallah

Medjahed

2007

Distrib Parallel Databases

Self Cite

View full text Add to dashboard Cite

In this paper, we propose Self-Adapting Recovery Net (SARN), an extended Petri net model, for specifying exceptional behavior in business processes. SARN adapts the structure of the underlying Petri net at run time to handle exceptions while keeping the Petri net design easy. The proposed framework caters for the specification of high-level recovery policies that are incorporated either with a single task or a set of tasks, called a Recovery Region. These recovery policies are generic directives that model exceptions at design time together with a set of primitive operations used at run time to handle the occurrence of exceptions. We identified a set of recovery policies that are useful and commonly needed in many practical situations. A tool has been developed to illustrate the viability of the proposed exception handling technique.

show abstract

A Top-Down Petri Net-Based Approach for Dynamic Workflow Modeling

Cited by 43 publications

References 5 publications

Petri Net + Nested Relational Calculus = Dataflow

Petri Net + Nested Relational Calculus = Dataflow

Design and Deployment of Workflows in Cloud Environment

Self-adapting recovery nets for policy-driven exception handling in business processes

Contact Info

Product

Resources

About