# US 2015/0106781 A1 · Verification of uml state machines

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

- Number: US 2015/0106781 A1
- Document ID: US20150106781A1
- Status: Published application
- Kind: A1
- Application number: 14/052,777
- Filed: 2013-10-14
- Published: 2015-04-16
- Earliest claimed: 2013-10-14
- Assignees: International Business Machines Corporation
- Applicants: International Business Machines Corporation
- Inventors: Oshri Adler; Natalia Razinkov; Karen Yorav
- Web page: https://patentgrep.com/patent/US20150106781A1

## CPC

- G06F 9/4494: {data driven}
- G06F 8/35: model driven
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)

## Abstract

A method, apparatus and computer-implemented method, the method comprising: receiving a statechart comprising a complex feature; and replacing the complex feature with a transformed feature, thereby transforming the statechart to a second statechart, wherein replacing the complex feature comprises: creating an auxiliary variable or a default state; changing a value of the auxiliary variable at the beginning of the transformed feature and changing the value of the auxiliary variable again at its end; and taking a transition from the default state, such that the transition occurs in accordance with the value of the auxiliary variable.

## Claims

### Claim 1

A computer-implemented method performed by a computerized device, comprising:
receiving a statechart comprising a complex feature; and
replacing the complex feature with a transformed feature, thereby transforming the statechart to a second statechart,
wherein replacing the complex feature comprises:
creating an auxiliary variable or a default state;
changing a value of the auxiliary variable at the beginning of the transformed feature and changing the value of the auxiliary variable again at its end; and
taking a transition from the default state, such that the transition occurs in accordance with the value of the auxiliary variable.

### Claim 2 (depends on 1)

The computer-implemented method of claim 1 further comprising:
converting the second statechart to input format of a verification tool to obtain a model to be verified; and
verifying the model.

### Claim 3 (depends on 1)

The computer-implemented method of claim 1, wherein the complex feature is a shallow history.

### Claim 4 (depends on 1)

The computer-implemented method of claim 1, wherein the complex feature is a fork transition.

### Claim 5 (depends on 1)

The computer-implemented method of claim 1, wherein the complex feature is a multilevel transition.

### Claim 6 (depends on 1)

The computer-implemented method of claim 1, wherein the complex feature is an exit action of a state.

### Claim 7 (depends on 1)

The computer-implemented method of claim 1, wherein the complex feature is an entry action of a state.

### Claim 8 (depends on 1)

The computer-implemented method of claim 1, wherein the complex feature is a multi-action transition.

### Claim 9 (depends on 1)

The computer-implemented method of claim 1, wherein the complex feature is an IF action.

### Claim 10 (depends on 1)

The computer-implemented method of claim 1, wherein the complex feature is a WHILE action.

### Claim 11

An apparatus having a processing unit and a storage device, the apparatus comprising:
an input receiving component for receiving a statechart comprising a complex feature; and
a feature elimination component for replacing the complex feature with a transformed feature, thereby transforming the statechart to an enhanced statechart,
wherein the feature elimination component comprises commands for:
creating an auxiliary variable and a default state;
changing a value of the auxiliary variable at the beginning of the transformed feature and changing the value of the auxiliary variable again at its end; and
taking a transition from the default state, such that the transition occurs in accordance with the value of the auxiliary variable.

### Claim 12 (depends on 11)

The apparatus of claim 11 further comprising:
a statechart conversion component for converting the enhanced statechart to input format of a verification tool to obtain a model; and
a model verification component for verifying the model.

### Claim 13 (depends on 11)

The apparatus of claim 11, wherein the complex feature is a shallow history.

### Claim 14 (depends on 11)

The apparatus of claim 11, wherein the complex feature is a fork transition.

### Claim 15 (depends on 11)

The apparatus of claim 11, wherein the complex feature is a multilevel transition.

### Claim 16 (depends on 11)

The apparatus of claim 11, wherein the complex feature is an exit action of a state.

### Claim 17 (depends on 11)

The apparatus of claim 11, wherein the complex feature is an entry action of a state.

### Claim 18 (depends on 11)

The apparatus of claim 11, wherein the complex feature is a multi-action transition.

### Claim 19

A computer program product comprising:
a non-transitory computer readable medium;
a first program instruction for receiving a statechart comprising a complex feature; and
a second program instruction for replacing the complex feature with a transformed feature, thereby transforming the statechart to a second statechart,
wherein the second program instruction replacing the complex feature comprises:
a third program instruction for creating an auxiliary variable or a default state;
a fourth program instruction for changing a value of the auxiliary variable at the beginning of the transformed feature and changing the value of the auxiliary variable again at its end; and
a fifth program instruction for taking a transition from the default state, such that the transition occurs in accordance with the value of the auxiliary variable, and
wherein said first, second, third, fourth and fifth program instructions are stored on said non-transitory computer readable medium.
