Reactive Petri Nets for Workflow Modeling

Abstract

Abstract. Petri nets are widely used for modeling and analyzing workflows. Using the token-game semantics, Petri net-based workflow models can be analyzed before the model is actually used at run time. At run time, a workflow model prescribes behavior of a reactive system (the workflow engine). But the token-game semantics models behavior of closed, active systems. Thus, the token-game semantics behavior of a Petri net-based workflow model will differ considerably from its behavior at run time. In this paper we define a reactive semantics for Petri nets. This semantics can model behavior of a reactive system and its environment. We compare this semantics with the token-game semantics and prove that under some conditions the reactive semantics and the token-game semantics induce similar behavior. Next, we apply the reactive semantics to workflow modeling and show how a workflow net can be transformed into a reactive workflow net. We prove that under some conditions the soundness property of a workflow net is preserved when the workflow net is transformed into a reactive workflow net. This result shows that to analyze soundness, the token-game semantics can safely be used, even though that semantics is not reactive.

UTP Semantics for Shared-State, Concurrent, Context-Sensitive Process Models

“…The affinity of the Petri nets formalism to represent such behaviour has contributed to its popularity to be used in the more 'formal spectrum' of CPs research. Petri nets have been used to model such work-flows [5], [7], [18]. Stochastic treatments are popular for looking at resource and time estimation, e.g.…”

A Language for Task Orchestration and Its Semantic Properties

“…From law (8), (g where y :∈ h) >x> let(x) is (g >x> let(x)) where y :∈ h, which is g where y :∈ h, using induction on g >x> let(x).…”

Mapeamento do modelo de processos de negócio do EKD em redes de Petri

“…Um MPN-EKD é uma quíntupla (I, P, C, Q, A): -I é um conjunto fi nito de inf-set (conjunto de informações); -P é um conjunto fi nito de processos; -C é um conjunto fi nito de conectores lógicos; -Q ∈ C → {AND, OR} é uma função que mapeia cada conector dentro de um tipo de conector; Li et al (1993);Ferscha (1994); Merz et al (1995); Schömig e Rau (1995); Ellis e Nutt (1996); Nutt (1996); Wikarski (1996); Oberweis (1997); Aalst (1998); Adam et al (1998); Badouel e Oliver (1998); Dehnert (2003); Aalst e Hee (2002); Eshuis e Dehnert (2003); Grigova (2003); Verbeck et al (2002). Aalst e Hee (2002) A fundamentação matemática fi rme permite algumas conclusões e verifi cações importantes.…”

“…; Mevius e Oberweis (2005); Chen-Burger et al (2002); Chen-Burger (2001); Koubarakis e Plexousakis (2002); Jonkers et al (2003); Taylor e Toft s (2003); Junginger et al (2001); Jonkers et al (2003); Berio e Petit (2003); ChenBurger e Stader (2003); Dehnert (2003); ; ; Aalst (1999).…”