# US 2010/0168875 A1 · Method for Process Optimisation

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2010/0168875 A1
- Document ID: US20100168875A1
- Status: Published application
- Kind: A1
- Application number: 12/224,034
- Filed: 2007-02-05
- Published: 2010-07-01
- Earliest claimed: 2006-02-20
- Inventors: Andreas Hennig; Lev Olkhovich; Rainer Wasgint
- Web page: https://patentgrep.com/patent/US20100168875A1

## CPC

- G06Q 10/04: Forecasting or optimisation specially adapted for administrative or management purposes, e.g. linear programming or "cutting stock problem" (market predictions or forecasting for commercial activities G06Q30/0202)
- G06Q: INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR

## Abstract

A method is disclosed. In at least one embodiment of the method, firstly, the process as described by a process definition is analysed such that those control sequence dependencies are discovered which are not supported by the data stream, the control sequences contained in the process are transformed in a first step into a corresponding Petri network and, in a second step, the Petri network is analysed. Secondly, the process is then reconstructed without the discovered redundant or unnecessary control sequence dependencies and an optimum process definition generated. Excess dependencies are thus automatically discovered and removed by way of at least one embodiment of the invention, in order to achieve, for example, an increased parallelisation or compatibility of partial processes.

## Claims

### Claim 1

A method, comprising:
analyzing a process, as described by a process definition, in such a way that redundant control flow dependencies in a control flow of the process which are not supported by a corresponding data flow reconstructed from the process definition, are detected;
converting the control flow of the process into a corresponding Petri net;
analyzing the Petri net with the aid of a Petri net analysis;
reconstructing the process with the aid of the process definition, without the detected redundant control flow dependencies; and
generating an optimum process definition for the process.

### Claim 2 (depends on 1)

The method as claimed in claim 1, wherein, in the Petri net analysis, for each transition, a set of further transitions is determined on which a respective transition depends.

### Claim 3 (depends on 2)

The method as claimed in claim 2, wherein the control flow of the process compares and contrasts the dependencies between the individual activities contained in this set and connecting arrows of a control flowchart describing the control flow, supported or demanded by these dependencies, are stored in a second set.

### Claim 4 (depends on 1)

A computer readable medium including program segments for, when executed on a computer device, causing the computer device to implement the method of claim 1.
