<?xml version="1.0" encoding="UTF-8"?><feed xmlns="http://www.w3.org/2005/Atom" xmlns:dc="http://purl.org/dc/elements/1.1/">
<title>P147 - Business Process, Services Computing and Intelligent Service Management 2009</title>
<link href="http://dl.gi.de/handle/20.500.12116/23224" rel="alternate"/>
<subtitle/>
<id>http://dl.gi.de/handle/20.500.12116/23224</id>
<updated>2026-07-21T13:40:03Z</updated>
<dc:date>2026-07-21T13:40:03Z</dc:date>
<entry>
<title>Human activities in distributed BPM</title>
<link href="http://dl.gi.de/handle/20.500.12116/23249" rel="alternate"/>
<author>
<name>Takayama, Yoichi</name>
</author>
<author>
<name>Ghiglione, Ernie</name>
</author>
<author>
<name>Wilson, Scott</name>
</author>
<author>
<name>Dalziel, James</name>
</author>
<id>http://dl.gi.de/handle/20.500.12116/23249</id>
<updated>2019-06-03T12:25:23Z</updated>
<published>2009-01-01T00:00:00Z</published>
<summary type="text">Human activities in distributed BPM
Takayama, Yoichi; Ghiglione, Ernie; Wilson, Scott; Dalziel, James
Abramowicz, Witold; Maciaszek, Leszek; Kowalczyk, Ryszard; Speck, Andreas
The general concept of inter-workflow system communications has been proposed by the WfMC in 1995. However, there has been little study or use case on general inter-workflow system communications, except for business massage exchange-based protocols. Since BPEL allows a local system to invoke remote BPEL Processes via Web Service interface, this can be used as a mechanism for inter-workflow communications for BPEL Processes. Currently, however, it causes a problem if the remote BPEL Processes use BPEL4Peole extension and include People Activities and Human Tasks. This is because BPEL4People has not anticipated Processes to be called remotely and there is no provision for the remote invocation of the user interfaces. This paper studies a possible mechanism in which a local system can invoke a remote BPEL Process with Human Tasks and let local users perform human activities via user interfaces that are defined in the remote Human Tasks.
</summary>
<dc:date>2009-01-01T00:00:00Z</dc:date>
</entry>
<entry>
<title>On modeling "web-service-based" processes for healthcare</title>
<link href="http://dl.gi.de/handle/20.500.12116/23248" rel="alternate"/>
<author>
<name>Rad, Amir Afrasiabi</name>
</author>
<author>
<name>Benyoucef, Morad</name>
</author>
<author>
<name>Kuziemsky, Craig E.</name>
</author>
<id>http://dl.gi.de/handle/20.500.12116/23248</id>
<updated>2019-06-03T12:25:23Z</updated>
<published>2009-01-01T00:00:00Z</published>
<summary type="text">On modeling "web-service-based" processes for healthcare
Rad, Amir Afrasiabi; Benyoucef, Morad; Kuziemsky, Craig E.
Abramowicz, Witold; Maciaszek, Leszek; Kowalczyk, Ryszard; Speck, Andreas
In terms of business process-modeling, healthcare is a rather complex sector of activity. Indeed, modeling healthcare processes presents some special requirements dictated by the complex and dynamic nature of these processes as well as by the specificity and diversity of the actors involved in these processes. We discuss these requirements and propose a framework for evaluating processmodeling languages based on such requirements. The proposed evaluation framework is tested using BPEL and BPMN to model a complex healthcare process and the results of the evaluation are highlighted.
</summary>
<dc:date>2009-01-01T00:00:00Z</dc:date>
</entry>
<entry>
<title>On application of structural decomposition for process model abstraction</title>
<link href="http://dl.gi.de/handle/20.500.12116/23247" rel="alternate"/>
<author>
<name>Polyvyanyy, Artem</name>
</author>
<author>
<name>Smirnov, Sergey</name>
</author>
<author>
<name>Weske, Mathias</name>
</author>
<id>http://dl.gi.de/handle/20.500.12116/23247</id>
<updated>2019-06-03T12:25:23Z</updated>
<published>2009-01-01T00:00:00Z</published>
<summary type="text">On application of structural decomposition for process model abstraction
Polyvyanyy, Artem; Smirnov, Sergey; Weske, Mathias
Abramowicz, Witold; Maciaszek, Leszek; Kowalczyk, Ryszard; Speck, Andreas
Real world business process models may consist of hundreds of elements and have sophisticated structure. Although there are tasks where such models are valuable and appreciated, in general complexity has a negative influence on model comprehension and analysis. Thus, means for managing the complexity of process models are needed. One approach is abstraction of business process models-creation of a process model which preserves the main features of the initial elaborate process model, but leaves out insignificant details. In this paper we study the structural aspects of process model abstraction and introduce an abstraction approach based on process structure trees (PST). The developed approach assures that the abstracted process model preserves the ordering constraints of the initial model. It surpasses pattern-based process model abstraction approaches, allowing to handle graph-structured process models of arbitrary structure. We also provide an evaluation of the proposed approach.
</summary>
<dc:date>2009-01-01T00:00:00Z</dc:date>
</entry>
<entry>
<title>Verifying business rules using an SMT solver for BPEL processes</title>
<link href="http://dl.gi.de/handle/20.500.12116/23245" rel="alternate"/>
<author>
<name>Monakova, Ganna</name>
</author>
<author>
<name>Kopp, Oliver</name>
</author>
<author>
<name>Leymann, Frank</name>
</author>
<author>
<name>Moser, Simon</name>
</author>
<author>
<name>Schäfers, Klaus</name>
</author>
<id>http://dl.gi.de/handle/20.500.12116/23245</id>
<updated>2019-06-03T12:25:23Z</updated>
<published>2009-01-01T00:00:00Z</published>
<summary type="text">Verifying business rules using an SMT solver for BPEL processes
Monakova, Ganna; Kopp, Oliver; Leymann, Frank; Moser, Simon; Schäfers, Klaus
Abramowicz, Witold; Maciaszek, Leszek; Kowalczyk, Ryszard; Speck, Andreas
WS-BPEL is the standard for modelling executable business processes. Recently, verification of BPEL processes has been an important topic in the research community. While most of the existing approaches for BPEL process verification merely consider control-flow based analysis, some actually consider data-flows, but only in a very restrictive manner. In this paper, we present a novel approach that combines control-flow analysis and data-flow analysis, producing a logical representation of a process model. This logical representation captures the relations between process variables and execution paths that allow properties to be verified using Satisfiability Modulo Theory (SMT) solvers under constraints represented by the modelled assertions.
</summary>
<dc:date>2009-01-01T00:00:00Z</dc:date>
</entry>
</feed>
