# US 2017/0288940 A1 · Data governance: change management based on contextualized dependencies

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

- Number: US 2017/0288940 A1
- Document ID: US20170288940A1
- Status: Published application
- Kind: A1
- Application number: 15/089,858
- Filed: 2016-04-04
- Published: 2017-10-05
- Earliest claimed: 2016-04-04
- Assignees: Xerox Corporation
- Applicants: Xerox Corporation
- Inventors: Nikolaos Lagos; Jean-Yves Vion-Dury
- Web page: https://patentgrep.com/patent/US20170288940A1

## CPC

- G06F 16/21: Design, administration or maintenance of databases
- H04L 41/0266: using meta-data, objects or commands for formatting management information, e.g. using eXtensible markup language [XML]
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)

## Abstract

A method for change management includes providing a dependency graph as an instantiation of a linked resource model in which a plurality of resources are linked by at least one dependency. The resources include at least one source resource and at least one target resource, each of the at least one dependency specifying preconditions on at least one of the at least one source resources for the dependency to be activated and an impact on at least one of the at least one target resources when the dependency is activated. A change to one of the plurality of resources is propagated to at least one other of the plurality of resources in the graph and information based on the propagation is output.

## Claims

### Claim 1

A method for change management comprising:
providing a dependency graph as an instantiation of a linked resource model in which a plurality of resources are linked by at least one dependency, the resources including at least one source resource and at least one target resource, each of the at least one dependency specifying preconditions on at least one of the at least one source resource for the dependency to be activated and an impact on at least one of the at least one target resources when the dependency is activated; and
with a processor, propagating a change to one of the plurality of resources to at least one other of the plurality of resources in the graph; and
outputting information based on the propagation.

### Claim 2 (depends on 1)

The method of claim 1, wherein the plurality of resources are selected from concrete resources and abstract resources.

### Claim 3 (depends on 1)

The method of claim 1, wherein each of the at least one dependency is assigned to a class of dependencies from a plurality of classes of dependencies, the plurality of dependency classes including conjunctive dependencies and disjunctive dependencies, wherein for a conjunctive dependency if any of the source resources related to that dependency is changed then the dependency is activated, and wherein for a disjunctive dependency, the dependency is activated only if all source resources related to that dependency are changed.

### Claim 4 (depends on 1)

The method of claim 1, wherein the linked resource model permits a first of the dependencies to be linked to a second of the dependencies in the dependency graph.

### Claim 5 (depends on 4)

The method of claim 4, wherein the linked resource model permits the first of the dependencies to be of a different class of dependencies from the second of the dependencies.

### Claim 6 (depends on 4)

The method of claim 4, wherein the linked resource model provides for the first of the dependencies linked to the second of the dependencies by a dependency connector.

### Claim 7 (depends on 1)

The method of claim 1, wherein in the dependency graph, objects are represented by nodes, the nodes being linked by directed edges which indicate properties of relationships between linked nodes, the objects including resource nodes and at least one dependency node.

### Claim 8 (depends on 1)

The method of claim 1, wherein the dependency graph is implemented as a Resource Description Framework (RDF) graph or triple store.

### Claim 9 (depends on 1)

The method of claim 1, wherein the propagating comprises applying at least one of a forward chaining mechanism and a backward chaining mechanism to propagate changes through the dependency graph.

### Claim 10 (depends on 9)

The method of claim 9, wherein the forward chaining mechanism comprises, for a source resource from the plurality of resources, and for at least one of the dependencies in the dependency graph which links the source resource to a target resource from the plurality of resources and for which an intention descriptor of the dependency is compatible with the preconditions for the dependency to be activated and is compatible with the impact on the target resource, propagating the change in the source resource to the target resource via the dependency.

### Claim 11 (depends on 10)

The method of claim 10, further comprising, for at least one iteration, repeating the forward chaining mechanism using a different resource from the plurality of resources as the source resource.

### Claim 12 (depends on 11)

The method of claim 11, wherein the forward chaining algorithm comprises:
checking that the source resource is not yet in a set of already considered source resources and if so, then adding the source resource to the set;
for each dependency that has a RDF triple in a triple store with a from property with respect to the source resource, and where the dependency is compatible with the intention, determining if the precondition and impact of the dependency satisfy the intention and if so, propagating the change in r to all target resources that are linked to the source resource by that dependency, according to the definition of the impact.

### Claim 13 (depends on 9)

The method of claim 9, wherein the backward chaining mechanism comprises, for a target resource from the plurality of resources for which a change is not detected, and for at least one of the dependencies in the dependency graph which links the target resource to a changed source resource from the plurality of resources and for which an intention descriptor of the dependency is compatible with a chaining intention to be activated and is compatible with an impact on the target resource, propagating the change in the source resource to the target resource via the dependency, according to the definition of the impact.

### Claim 14 (depends on 13)

The method of claim 13, further comprising repeating the backward chaining mechanism for another target resource from the plurality of resources.

### Claim 15 (depends on 9)

The method of claim 9, wherein the propagating comprises applying both of the forward chaining mechanism and the backward chaining mechanism.

### Claim 16 (depends on 1)

The method of claim 1, wherein the output information includes at least one of:
a request to modify at least one external resource which is represented in the graph; and
a modified dependency graph.

### Claim 17 (depends on 1)

The method of claim 1, wherein each of the dependencies specifies an intent which describes the usage of objects involved in the dependency.

### Claim 18 (depends on 1)

A system comprising memory which stores instructions for performing the method of claim 1 and a processor in communication with the memory for executing the instructions.

### Claim 19 (depends on 1)

A computer program product comprising a non-transitory recording medium storing instructions, which when executed on a computer, causes the computer to perform the method of claim 1.

### Claim 20

A system for change management comprising:
memory which stores a dependency graph as an instantiation of a linked resource model in which a plurality of resources are linked by at least one dependency, the resources including at least one source resource and at least one target resource, each of the at least one dependency specifying preconditions on at least one of the at least one source resource for the dependency to be activated and an impact on at least one of the at least one target resources when the dependency is activated;
a propagation component which propagates a change to one of the plurality of resources to at least one other of the plurality of resources in the dependency graph;
an output component which outputs information based on the propagation; and
a processor which implements the propagation component and the output component.

### Claim 21

A method for change management comprising:
providing a dependency graph as an instantiation of a linked resource model in which a plurality of resources are linked by at least one dependency, the resources including at least one source resource and at least one target resource, each of the at least one dependency specifying preconditions on at least one of the at least one source resource for the dependency to be activated and an impact on at least one of the at least one target resources when the dependency is activated and an intention of the dependency; and
with a processor, propagating a change to one of the plurality of resources to at least one other of the plurality of resources in the graph the propagating including applying at least one of:
a forward chaining mechanism configured for propagating a change from a source resource to a target resource linked to the source resource by a dependency to satisfy a given intention, and
a backward chaining mechanism configured for propagating a change from a target resource to a source resource linked to the target resource by a dependency to satisfy a given intention; and
outputting information based on the propagation.
