Tuplespace middleware for Petri net-based workflow execution Online publication date: Mon, 15-Mar-2010
by Daniel Martin, Daniel Wutke, Frank Leymann
International Journal of Web and Grid Services (IJWGS), Vol. 6, No. 1, 2010
Abstract: Petri nets are a formalism for describing coordinated interactions between independent entities, called transitions, by means of synchronised token exchange through places. Tuplespaces are an abstraction of the shared memory concept that provide means for loosely coupled coordination between individual components. In the tuplespace model, coordination between applications is achieved by production and blocking consumption of tuples, which are communicated over tuplespace buffers. On the basis of the conceptual similarities of Petri nets and tuplespaces, we investigate in this paper whether tuplespaces are a suitable platform for execution of applications modelled as Petri net-based workflows, motivate an extension to the original tuplespace interface to facilitate efficient synchronisation of control flow, and highlight its benefits by providing quantitative and qualitative evaluations of an application using the traditional tuplespace interface versus an application using our extension.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Web and Grid Services (IJWGS):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook