Cagdas Evren Gerede

Specification and Verification of Artifact Behaviors in Business Process Models

SOA has influenced business process modeling and management. Recent business process models have elevated data representation to the same level as control flows, for example, the artifact-centric business process models allow the life cycle properties of artifacts (data objects) to be specified and analyzed. In this paper, we develop a specification language ABSL based on computation tree logic for artifact life cycle behaviors (e.g., reachability). We show that given a business model and starting configuration, it can be decided if an ABSL sentence is satisfied when the domains are bounded, and if an ABSL-core (sublanguage of ABSL) sentence is satisfied when the domains are totally ordered but unbounded. We also show that if the starting configuration is not given, ABSL(-core) is still decidable if the number of artifacts is bounded with bounded (resp. unbounded but ordered) domains.

Static Analysis of Business Artifact-centric Operational Models

Business artifacts are the core entities used by businesses to record information pertinent to their operations. Business operational models are representations of the processing of business artifacts. Traditional process modeling approaches focus on the actions taken to achieve a certain goal (verb-centric). Business artifact-centric modeling starts by identifying what is acted upon (noun-centric), and constructs business operational models by identifying the tasks/actions that business actors execute to add business value. In this paper, we identify important classes of properties on artifact-centric operational models. In particular, we focus on persistence, uniqueness and arrival properties. To enable a static analysis of these properties, we propose a formal model for artifact-centric operational models. We show that the formal model guarantees persistence and uniqueness. We prove that, while checking an arrival property is undecidable in general, under a restricted version of the formalism, an arrival property can be checked in EXPTIME.

SPiDeR: P2P-based web service discovery

In this paper, we describe SPiDeR, a peer-to-peer (P2P) based framework that supports a variety of Web service discovery operations. SPiDeR organizes the service providers into a structured P2P overlay and allows them to advertise and lookup services in a completely decentralized and dynamic manner. It supports three different kinds of search operations: For advertising and locating services, service providers can use keywords extracted from service descriptions (keyword-based search), categories from a global ontology (ontology-based search), and/or paths from the service automaton (behavior-based search). The users can also rate the quality of the services they use. The ratings are accumulated within the system so that users can query for the quality ratings of the discovered services. Finally, we present the performance of SPiDeR in terms of routing using a simulator.

On Exploiting System Dynamics Modeling to Identify Service Requirements

SOA provides a flexible framework tor better-integrated systems that meet business needs. However, the existing methods are not successful in helping business analysts to devise appropriate business services. Herein, a novel approach is presented to address service identification and thereby developing sound SOA. In contrast with conventional methodologies, we press on the criticality of exploiting the information of dynamic business behavior to develop business services