EWFN - A Petri Net Dialect for Tuplespace-Based Workflow Enactment

Petri nets are a formalism for describing systems where interactions between active components – so-called transitions – are modeled as exchanges of tokens over passive places. Whether a transition may fire is solely dependent on the availability of tokens in its incoming places; similarly a transition forwards control to subsequent transitions by storing tokens in their respective input places. This interaction model of strong decoupling through local actions and local effects makes distributed systems modeled via Petri nets highly extensible. In this paper, we present the syntax and semantics of a model that leverages the extensibility provided by Petri nets for representing BPEL processes in a way that enables their distributed and decentralized execution using tuplespace middleware. Said middleware implements the proposed Petri net dialect and therefore allows for direct, distributed execution of the modeled processes.

[1]  Wil M. P. van der Aalst,et al.  On the Notion of Coupling in Communication Middleware , 2005, OTM Conferences.

[2]  Jonathan Robie,et al.  Editors , 2003 .

[3]  Christoph Schneider,et al.  Prozeßmodellierung mit ereignisgesteuerten Prozeßketten (EPKs) und Petri-Netzen , 1997, Wirtschaftsinf..

[4]  Frank Leymann,et al.  Model and infrastructure for decentralized workflow enactment , 2008, SAC '08.

[5]  Moshé M. Zloof Query by example , 1975, AFIPS '75.

[6]  Wolfgang Reisig Petri Nets: An Introduction , 1985, EATCS Monographs on Theoretical Computer Science.

[7]  编程语言 Query by Example , 2010, Encyclopedia of Database Systems.

[8]  Kurt Jensen Coloured Petri Nets , 1992, EATCS Monographs in Theoretical Computer Science.

[9]  Wil M. P. van der Aalst,et al.  The Application of Petri Nets to Workflow Management , 1998, J. Circuits Syst. Comput..

[10]  Alexandre Yakovlev,et al.  Unfolding and Finite Prefix for Nets with Read Arcs , 1998, CONCUR.

[11]  David Gelernter,et al.  Generative communication in Linda , 1985, TOPL.