Sciweavers

Share
AWPN
2008
268views Algorithms» more  AWPN 2008»
8 years 6 months ago
EWFN - A Petri Net Dialect for Tuplespace-Based Workflow Enactment
Abstract Petri nets are a formalism for describing systems where interactions between active components
Daniel Martin, Daniel Wutke, Frank Leymann
AWPN
2008
311views Algorithms» more  AWPN 2008»
8 years 6 months ago
WoPeD 2.0 goes BPEL 2.0
WoPeD (Workflow Petrinet Designer) is an easy-to-use, Java-based open source software tool being developed at the University of Cooperative Education, Karlsruhe. WoPeD is able to e...
Andreas Eckleder, Thomas Freytag
AWPN
2008
241views Algorithms» more  AWPN 2008»
8 years 6 months ago
ImageNetDiff: A Visual Aid to Support the Discovery of Differences in Petri Nets
In this paper we propose a method and present a tool as plugin for Renew that supports the process of discovery of differences in possibly conflicting versions of Petri net code. T...
Lawrence Cabac, Jan Schlüter
AWPN
2008
274views Algorithms» more  AWPN 2008»
8 years 6 months ago
A Janus-Faced Net Component for the Prototyping of Open Systems
We introduce a Janus-faced reference net component that presents the basis for the recursive composition of complex systems from open system units. We particularly focus on the ope...
Matthias Wester-Ebbinghaus, Daniel Moldt
AWPN
2008
249views Algorithms» more  AWPN 2008»
8 years 6 months ago
Towards Synthesis of Petri Nets from General Partial Languages
In this paper we investigate synthesis of place/transition Petri nets from three different finite representations of infinite partial languages, generalizing previous results.
Robert Lorenz
AWPN
2008
272views Algorithms» more  AWPN 2008»
8 years 6 months ago
Finding Cost-Efficient Adapters
When adapting services in a SOA environment, not only the validity of the adapter may be of importance, but also non-functional properties like the costs of the adapter. We introdu...
Christian Gierds
AWPN
2008
273views Algorithms» more  AWPN 2008»
8 years 6 months ago
An Approach to Tackle Livelock-Freedom in SOA
We calculate a fixed finite set of state space fragments for a service P, where each fragment carries a part of the whole behavior of P. By composing these fragments according to t...
Christian Stahl, Karsten Wolf
AWPN
2008
232views Algorithms» more  AWPN 2008»
8 years 6 months ago
Synthesis of Petri Nets from Infinite Partial Languages with VipTool
Abstract. In this paper we show an implementation of an algorithm to synthesize a place/transition Petri net (p/t-net) from a possibly infinite partial language, which is given by ...
Robin Bergenthum, Sebastian Mauser
books