Monthly Archive for Februar, 2008

Extending the Compatibility Notion for Abstract WS-BPEL Processes

Dieter König, Niels Lohmann, Simon Moser, Christian Stahl, and Karsten Wolf. Extending the compatibility notion for abstract WS-BPEL processes. In Wei-Ying Ma, Andrew Tomkins, and Xiaodong Zhang, editors, Proceedings of the 17th International Conference on World Wide Web, WWW 2008, Beijing, China, April 21–25, 2008. ACM, April 2008.

compliance_notion.png

relationship between syntactic compatibility and behavioral equivalence

Abstract. WS-BPEL defines a standard for executable processes. Executable processes are business processes which can be automated through an IT infrastructure. The WS-BPEL specification also introduces the concept of abstract processes: In contrast to their executable siblings, abstract processes are not executable and can have parts where business logic is disguised. Nevertheless, the WS-BPEL specification introduces a notion of compatibility between such an under-specified abstract process and a fully specified executable one. Basically, this compatibility notion defines a set of syntactical rules that can be augmented or restricted by profiles. So far, there exist two of such profiles: the Abstract Process Profile for Observable Behavior and the Abstract Process Profile for Templates. None of these profiles defines a concept of behavioral equivalence. Therefore, both profiles are too strict with respect to the rules they impose when deciding whether an executable process is compatible to an abstract one. In this paper, we propose a novel profile that extends the existing Abstract Process Profile for Observable Behavior by defining a behavioral relationship. We also show that our novel profile allows for more flexibility when deciding whether an executable and an abstract process are compatible.

Fully-automatic Translation of Open Workflow Net Models into Simple Abstract BPEL Processes

Niels Lohmann and Jens Kleine. Fully-automatic translation of open workflow net models into simple abstract BPEL processes. In Thomas Kühne, Wolfgang Reisig, and Friedrich Steimann, editors, Modellierung 2008, 12.–14. März 2008, Berlin, Proceedings, volume P-127 of Lecture Notes in Informatics (LNI), pages 57–72. GI, March 2008.

conditional.png

Abstract. On the one hand, Petri net models have a successful history in the modeling, simulation, and verification of workflows and business processes. On the other hand, BPEL is the de facto standard for describing executable Web service-based business processes. With abstract BPEL processes, BPEL can also be used as modeling language. However, being a complicated language with many syntactic constraints, abstract BPEL processes impede a straightforward modeling.
In this paper, we introduce a fully-automatic translation of Petri net models into abstract BPEL processes which can be refined to executable BPEL processes. This approach combines strengths of Petri nets in modeling and verification with the ability to execute BPEL processes. Furthermore, it completes the Tools4BPEL framework to synthesize BPEL processes which are correct by design.