Stephan Borgert

On Entropy-Based Molecular Descriptors: Statistical Analysis of Real and Synthetic Chemical Structures

This paper presents an analysis of entropy-based molecular descriptors. Specifically, we use real chemical structures, as well as synthetic isomeric structures, and investigate properties of and among descriptors with respect to the used data set by a statistical analysis. Our numerical results provide evidence that synthetic chemical structures are notably different to real chemical structures and, hence, should not be used to investigate molecular descriptors. Instead, an analysis based on real chemical structures is favorable. Further, we find strong hints that molecular descriptors can be partitioned into distinct classes capturing complementary information.

ePASS-IoS 1.1: Enabling Inter-enterprise Business Process Modeling by S-BPM and the Internet of Services Concept

The future “Internet of Services” (IoS) will provide an open environment allowing market participants to offer and consume services over Internet marketplaces. It gives businesses the opportunity to outsource parts of their business processes. This leads to networks of cooperating businesses with a distributed execution of processes and provides a good support for inter-enterprise modeling. Many methods have been proposed to describe such processes, however most only focus on certain aspects and fall short of others. We present ePASS-IoS, a unified approach to describe processes and service choreographies with well-defined execution and verification semantics. With the formulation of the well-known workflow and interaction patterns in ePASS-IoS, we show that its expressiveness is adequate. To clearly define the semantics of the language, we formalize it using a process algebra.

Distributed Execution of S-BPM Business Processes

Subject-oriented business process management (S-BPM) introduces a new technique for process modeling that emphasizes the importance of the actors in business processes (subjects) and gives a balanced consideration to subjects, their actions, and goals. Because of the formal foundation and the clear declaration of subjects, S-BPM allows the distributed modeling and execution of processes, without losing the capability to verify the compatibility of processes.

Modern Software Engineering Concepts and Practices: Advanced Approaches

The Internet of services introduces new requirements for service engineering in terms of addressing both business and technical perspectives. The inherent complexity of the new wave of services that is emerging requires new approaches for an effective and efficient service design. In this chapter a novel service engineering framework is introduced: the Integrated Service Engineering (ISE) framework. With its ISE workbench, it can address the emerging requirements of Internet of services. The chapter presents the foundations on how the service engineering process can be conducted by applying the separation of concerns to model different service dimensions within various layers of abstraction. Additionally, three novel extensions are presented to the aforementioned ISE workbench in order to enrich the capabilities of the service modeling process.

A S-BPM Suite for the Execution of Cross Company Subject Oriented Business Processes

The execution of cross-company business process models becomes more and more important. This paper introduces a Software as a Service S-BPM suite called S-BPM groupware. It supports cross company execution and is designed for performance scalability.

Application of Subject-Oriented Modeling in Automatic Service Composition

Next generation SOA systems promise to enable an “Internet of Services” (IoS) - an open environment, in which every participant is free to offer and consume services. Such an IoS gives businesses the opportunity to outsource parts of their internal processes and to replace them by using external services. However, businesses must ensure that external services are compatible with their processes and that they can quickly adapt if service offering changes on the market. This raises the need for a process definition language with a formal foundation and well-defined semantics. In this paper, we discuss the suitability of different process definition languages for automatic service composition, show that subject-oriented modeling with PASS is well-suited for this domain, and how automatic service composition is implemented in the Theseus/TEXO project.

A Domain Specific Language for Describing S-BPM Processes

Natural language is the first choice for most stakeholders for describing business processes. S-BPM addresses this by taking basic natural language structure into consideration. However, so far S-BPM processes can only be modeled with graph-based tools. Although graph-based tools provide a good overview of processes they have also their disadvantages, because changing or adding language elements is costly, and graphical symbols cannot be written like natural sentences. In this paper, we present a Domain Specific Language to specify S-BPM processes and a process engine kernel for executing these modeled processes.

Network Classes and Graph Complexity Measures

In this paper, we propose an information-theoretic approach to discriminate graph classes structurally. For this, we use a measure for determining the structural information content of graphs. This complexity measure is based on a special information functional that quantifies certain structural information of a graph. To demonstrate that the complexity measure captures structural information meaningfully, we interpret some numerical results.

Formal Based Correctness Check for ePASS-IoS 1.1 Process Models with Integrated User Support for Error Correcting

To ensure the correctness of business process models, automatic and manual methods are applied. Since the manual checks are time consuming and expensive, the automatic methods should be as effective as possible. An established verification check is the check for the interaction soundness, i.e. the process model can be executed without deadlocks. Normally, these approaches compile the graph based models to expressions of a formal language which is passed on to a model checking tool for verification. The drawback with this methods is that the results are hard to use for analyzing the causes of errors. In this paper, we present an integrated approach that is able to find important error patterns, and supports the user in correcting errors while still having a high performance.

CHARACTERIZING CLASSES OF STRUCTURED OBJECTS BY MEANS OF INFORMATION INEQUALITIES

The problem to characterize and investigate structured objects by using information theory is currently of considerable interest. In this article, we describe a method for characterizing structured objects representing graphs by means of information inequalities. For this, we deal with information inequalities that describe relations between information measures for graphs. Additionally, we sketch an approach for comparing such information measures qualitatively.