05 Fakultät Informatik, Elektrotechnik und Informationstechnik

Permanent URI for this collectionhttps://elib.uni-stuttgart.de/handle/11682/6

Browse

Publication Type: search.filters.UBSTyp.ArbeitspapierStart date: 2007End date: 2007

Search Results

Now showing 1 - 4 of 4
  • Thumbnail Image
    ItemOpen Access
    Coordination protocols for split BPEL loops and scopes
    (2007) Khalaf, Rania; Leymann, Frank
    The document presents an approach to enable loops and fault handling, compensating scopes to be split among a set of BPEL processes running on different BPEL engines. A mechanism to split a scope or loop into multiple fragments is presented, then a protocol is defined that can be used to coordinate fragments of a loop or a scope so that those fragments run as if they had been in a single process. The requirements for running split scopes and loops are explained. For compensation, this paper focuses on explicit compensation and makes the assumption that compensation handing does not fail. Two protocols are defined such that they may be plugged into the WS-Coordination framework. The messages between the participant fragments and the coordinator are defined. The information about the participating processes that the coordinator needs to have is specified. An algorithm is provided to locate a fault handler in the hierarchy of scopes that can handle a particular BPEL fault. Additionally, the behavior of both participants and the coordinator are specified.
  • Thumbnail Image
    ItemOpen Access
    Note on syntactic details of split BPEL-D business processes
    (2007) Khalaf, Rania
    The document presents the syntactic details of the generation of process fragments created by the algorithm in [1], which defined the mechanisms for splitting a business process defined using a variant of WS-BPEL. The variant, BPEL-D, replaced BPEL’s variable style of data handling with explicit data links. We add new support in this note for syntactically splitting loops and scopes.
  • Thumbnail Image
    ItemOpen Access
    A proof of the factorization forest theorem
    (2007) Kufleitner, Manfred
    We show that for every homomorphism $\Gamma^+ \to S$ where $S$ is a finite semigroup there exists a factorization forest of height $\leq 3 \abs{S}$. The proof is based on Green's relations.
  • Thumbnail Image
    ItemOpen Access
    Interprocedural static single assignment form in Bauhaus
    (2007) Staiger, Stefan; Vogel, Gunther; Keul, Steffen; Wiebe, Eduard
    In this paper we describe interprocedural static single assignment form (ISSA) with optimizations as implemented in the Bauhaus project. We explain our framework which uses an abstract program representation enabling us to use different pointer analyses ranging from fast but imprecise to slow but precise ones. Our implementation includes the computation of (may and must) side effects and optimizations like pruning definitions with simple linear-time algorithms. This paper also provides comprehensive test results and statistics for a large test suite.