# US 2003/0069908 A1 · Software composition using graph types,graph, and agents

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

- Number: US 2003/0069908 A1
- Document ID: US20030069908A1
- Status: Published application
- Kind: A1
- Application number: 10/182,295
- Filed: 2002-07-26
- Published: 2003-04-10
- Earliest claimed: 2002-07-26
- Assignees: Poppet International, Inc.
- Inventors: Jon S Anthony; Dean T Allemang
- Web page: https://patentgrep.com/patent/US20030069908A1

## CPC

- G06F 16/258: {Data format conversion from or to a database}
- G06F 40/143: Markup, e.g. Standard Generalized Markup Language [SGML] or Document Type Definition [DTD]
- G06F 40/154: Tree transformation for tree-structured or markup documents, e.g. XSLT, XSL-FO or stylesheets
- Y10S 707/99936: Pattern matching access
- Y10S 707/99943: Generating database or data structure, e.g. via user interface
- Y10S 707/99945: Object-oriented database structure processing
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)
- Y10S: TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS

## Abstract

An environment for composing software permits the separation of control functions from information about the context in which the control functions operate. The software composition environment is used to make a system which will translate XML documents into models and vice-versa. The translation system is used to translate an XML document having one DTD into an XML document having another DTD by translating the first XML document into a model representing the semantics of the XML document and translating the model into the second XML document (2005). The system for translating XML documents into models employs a general technique for translating any XML documents into a mirror model (2107) that reflects the structure of the XML document and a general technique of using tag pattern models (2109) to obtain information from one model and using it to make or modify another model. In the system for translating XML document, the tag pattern models are used to translate mirror models into semantic models and vice-versa.

## Claims

### Claim 1

Apparatus for controlling a processor that has access to a storage device,
the apparatus comprising:
a model type in the storage device that defines a class of models, a model being a graph that has one or more entities as vertices;
an agent in the storage device that is associated with the model type and specifies an operation to be performed in a context provided by a model of the class defined by the model type; and
a particular model of the model type in the storage device to which the agent has been made available,
the processor responding to the agent by performing the operation specified thereby in the context provided by the particular model.

### Claim 2 (depends on 1)

The apparatus for controlling a processor set forth in claim 1 further comprising:
a set of one or more definitions of events in the storage device, the agent being further associated with a definition of an event and the processor responding to the event defined in the definition by performing the operation specified by the agent in the context of the particular model.

### Claim 3 (depends on 2)

The apparatus for controlling a processor set forth in claim 2 wherein:
the set of definitions of events is a model.

### Claim 4 (depends on 1)

The apparatus for controlling a processor set forth in claim 1 wherein:
there is a plurality of the particular models; and
the agent is available to more than one of the particular models.

### Claim 5 (depends on 1)

The apparatus for controlling a processor set forth in claim 1 wherein:
there is a plurality of the particular models; and
a given vertex belongs to more than one of the particular models.

### Claim 6 (depends on 1)

The apparatus for controlling a processor set forth in claim 1 wherein:
there is a plurality of the model types; and
the agent is associated with more than one of the model types.

### Claim 7 (depends on 1)

The apparatus for controlling a processor set forth in claim 1 wherein:
the agent is made available to the particular model when the agent is an entity in the particular model.

### Claim 8 (depends on 1, 2, 3, 4, 5, 6, 7)

The apparatus for controlling a processor set forth in any one of claims 1 through 7 wherein:
the model type defines a facet type that specifies a type of relationship to a vertex of a model of the type; and
the particular model has a facet of the facet type; and
the processor manipulates the particular model as specified by the facet type definition for the facet.

### Claim 9 (depends on 8)

The apparatus for controlling a processor set forth in claim 8 wherein:
there is a plurality of the facet types defined in the model type.

### Claim 10 (depends on 9)

The apparatus for controlling a processor set forth in claim 9 wherein:
there is a plurality of vertices in the particular model, ones of the plurality of vertices being related to others thereof by facets having types belonging to the plurality of types

### Claim 11 (depends on 10)

The apparatus for controlling a processor set forth in claim 10 wherein:
a given vertex has a plurality of facets of different facet types.

### Claim 12 (depends on 8)

The apparatus for controlling a processor set forth in claim 8 wherein:
the facet type definition specifies a set-theoretic character of the relationship.

### Claim 13 (depends on 8)

The apparatus for controlling a processor set forth in claim 8 wherein:
the facet type definition specifies a constraint on the facet.

### Claim 14 (depends on 8)

The apparatus for controlling a processor set forth in claim 8 wherein:
the facet type definition specifies a propagator on the facet.

### Claim 15 (depends on 1, 2, 3, 4, 5, 6, 7)

The apparatus for controlling a processor set forth in any one of claims 1 through 7 wherein:
there is a plurality of the vertices;
the vertices of a first subset of the vertices are instance vertices representing things; and
the vertices of a second subset of the vertices are vertices representing abstractions concerning the things represented by the first subset of the vertices.

### Claim 16 (depends on 15)

The apparatus for controlling a processor set forth in claim 15 wherein:
an instance vertex may represent an instance of an abstraction represented by a vertex of the second subset.

### Claim 17 (depends on 15)

The apparatus for controlling a processor set forth in claim 15 wherein:
an instance vertex may exhibit a property represented by a vertex of the second subset.

### Claim 18 (depends on 15)

The apparatus for controlling a processor set forth in claim 15 wherein:
there is a plurality of the particular models; and
a vertex in the first subset represents another particular model.

### Claim 19 (depends on 15)

The apparatus for controlling a processor set forth in claim 15 wherein the apparatus further comprises:
things represented by the instance vertices in the storage device; and
a thing represented by an instance vertex is locatable from the instance vertex.

### Claim 20

Apparatus employed in a system having a processor and storage accessible thereto for using information contained in a first graph stored in the storage to make or modify a second graph stored in the storage, both graphs having vertices containing information that are joined by edges specifying relationships between the vertices, the apparatus comprising:
a third graph stored in the storage, the third graph including
a pattern part that specifies a pattern of vertices and/or edges in the first graph and
a synthesis part that specifies a modification of the second graph; and
code stored in the storage and executable by the processor that matches the pattern part to vertices and/or edges having the pattern in the first graph and uses information from the matched vertices and/or edges in the first graph as specified in the synthesis part to make or modify the second graph.

### Claim 21 (depends on 20)

The apparatus set forth in claim 20 wherein:
the first graph and the second graph have types; and
the third graph is associated with the types of the first and second graphs.

### Claim 22 (depends on 20, 21)

The apparatus set forth in claim 20 or claim 21 wherein:
there is a plurality of the third graphs; and
the code matches the third graphs to the first graph in a predetermined order.

### Claim 23 (depends on 22)

The apparatus set forth in claim 22 wherein:
the predetermined order is associated with the types of the first and second graphs.

### Claim 24 (depends on 20, 21)

The apparatus set forth in claim 20 or claim 21 wherein:
there is a plurality of predefined ones of the third graphs; and
a user of the apparatus selects a set of the third graphs from the predefined ones and determines an order in which the third graphs in the set are matched to the first graph.

### Claim 25 (depends on 24)

The apparatus set forth in claim 24 wherein:
the user further associates the selected and ordered set of the third graphs with the types of the first and second graphs

### Claim 26 (depends on 24)

The apparatus set forth in claim 24 further comprising:
a graphical user interface for selecting the set of third graphs and determining the order.

### Claim 27 (depends on 20)

The apparatus set forth in claim 20 further comprising:
a graphical user interface for specifying a pattern part in the third graph by selecting one or more vertices in the first graph.

### Claim 28 (depends on 27)

The apparatus set forth in claim 27 wherein:
the graphical user interface further specifies the pattern part by specifying a class of edge in the first graph..

### Claim 29 (depends on 28)

The apparatus set forth in claim 28 wherein:
the first graph is hierarchical; and
when the graphical user interface selects a plurality of the vertices, the pattern part in the third graph includes vertices corresponding to the vertices in the smallest subtree with regard to the selected class of edge in the first graph that contains the selected vertices.

### Claim 30 (depends on 20)

The apparatus set forth in claim 20 wherein:
a vertex of a pattern part matches a class of vertex in the first graph and an edge of a pattern part matches a class of edge in the first graph.

### Claim 31 (depends on 30)

The apparatus set forth in claim 30 wherein:
an annotation in the vertex of the pattern part specifies the class of vertex or the class of edge.

### Claim 32 (depends on 20)

The apparatus set forth in claim 20 wherein:
the synthesis part includes a vertex that that specifies a class of vertex or a class of edge that is to be made or modified in the second graph.

### Claim 33 (depends on 32)

The apparatus set forth in claim 32 wherein:
an annotation in the vertex specifies the class of vertex or class of edge.

### Claim 34 (depends on 32)

The apparatus set forth in claim 32 wherein:
the synthesis part further includes a vertex that combines information from a plurality of vertices in the third graph for use in a further vertex of the synthesis part.

### Claim 35 (depends on 32)

The apparatus set forth in claim 32 wherein:
an edge in the synthesis part together with an annotation in a vertex of the synthesis part specifies a portion of a flow of the information via the third graph from the matched vertices of the first graph to the edges and/or vertices being made or modified in the second graph.

### Claim 36

Apparatus employed in a system having a processor and storage accessible thereto for producing a graph having a plurality of vertices and edges in the storage, the apparatus comprising:
a linear representation of a plurality of nested entities in the storage; and
code stored in the storage and executable by the processor that makes the graph in response to the linear representation, the graph having vertices representing the entities and edges representing the nesting.

### Claim 37 (depends on 36)

The apparatus set forth in claim 36 wherein:
the entities in the linear representation have content; and
the code associates content from the entity with the vertex corresponding to the entity.

### Claim 38 (depends on 36, 37)

The apparatus set forth in either of claims 36 or 37 wherein:
the linear representation is an XML document and the entities are XML constructs.

### Claim 39

Apparatus employed in a system having a processor and storage accessible thereto for producing a linear representation in the storage, the linear representation having a plurality of nested entities and the apparatus comprising:
a graph in the storage, the graph having vertices connected by edges indicating an enclosure relationship; and
code stored in the storage and executable by the processor that makes the linear representation in response to the graph, entities in the linear representation corresponding to vertices in the graph and the entities being nested in the linear representation as indicated by the edges of the graph.

### Claim 40 (depends on 39)

The apparatus set forth in claim 39 wherein:
the vertices in the graph are associated with content; and
an entity in the linear representation corresponding to a vertex contains the content associated with the vertex.

### Claim 41 (depends on 39, 40)

The apparatus set forth in either of claims 39 or 40 wherein:
the linear representation is an XML document and the entities are XML constructs.

### Claim 42

Apparatus employed in a system having a processor and storage accessible thereto for translating a XML document having a first DTD into another XML document having a second DTD, the apparatus comprising:
a first translator that executes on the processor and translates any XML document having the first DTD into a semantic representation in the storage of information from the translated XML document; and
a second translator that executes on the processor and translates the semantic representation into the other XML document.

### Claim 43 (depends on 42)

The apparatus set forth in claim 42 wherein:
the semantic representation is a first graph of a type having vertices and edges that are capable of representing information from any XML document having the first or second DTD.

### Claim 44 (depends on 43)

The apparatus set forth in claim 43 further comprising:
a transform component that makes or modifies a target graph using information in a source graph as specified in a tag pattern graph that matches patterns of vertices and edges in the source graph and uses information contained in the matched vertices and edges to make and/or modify vertices and/or edges in the target graph,
the first translator using the transform component in translating from XML to the first graph and the second translator using the transform component in translating from the first graph to XML.

### Claim 45 (depends on 44)

The apparatus set forth in claim 44 wherein:
the first translator comprises an import component that translates any XML document into a graph in the storage of a mirror type whose edges describe nesting in the XML document and whose vertices contain the information from the XML document;
the second translator comprises an export component that translates any graph in the storage of the mirror type into an XML document;
the first translator makes and/or modifies the first graph using the transform component with a first tag pattern graph and a first mirror graph made by the import component from the XML document as a source graph and the first graph as a destination graph; and
the second translator makes and/or modifies a second graph of the mirror type using the transform component with a second tag pattern graph and the first graph as a source graph and the second graph of the mirror type as a destination graph and makes the other XML document using the export component.

### Claim 46

Apparatus employed in a system having a processor and storage accessible thereto that translates an XML document in the storage that has a particular DTD into a first graph in the storage whose vertices and/or edges represent information from the XML document, the apparatus comprising:
an import component that translates any XML document into a graph in the storage of a mirror type whose edges describe nesting in the XML document and whose vertices contain information from the XML document; and
a transform component that makes or modifies a target graph using information in a source graph as specified in a tag pattern graph that matches patterns of vertices and edges in the source graph and uses information contained in the matched vertices and edges to make and/or modify vertices and/or edges in the target graph,
the import component translating the XML document into a second graph and the transform graph using a tag pattern graph for the particular DTD with the second graph as a source graph to make and/or modify the first graph.

### Claim 47 (depends on 46)

The apparatus set forth in claim 46 wherein:
the tag pattern graph includes
a pattern part that specifies a pattern to be matched and
a synthesis part that specifies how the information contained in the matched vertices and/or edges is to be used to make and or modify vertices and/or edges in the target graph,
the transform component making and/or modifying the target graph as specified by the synthesis part.

### Claim 48

Apparatus employed in a system having a processor and storage accessible thereto that translates a first graph in the storage whose vertices and edges represent information into an XML document that contains the information and has a particular DTD, the apparatus comprising:
a transform component that makes or modifies a target graph using information in a source graph as specified in a tag pattern graph that matches patterns of vertices and edges in the source graph and uses information contained in the matched vertices and edges to make and/or modify vertices and/or edges in the target graph; and
an export component that translates a graph in the storage of a mirror type whose edges describe nesting in an XML document and whose vertices contain information to be contained in the XML document into the XML document,
the transform component using a tag pattern graph for the particular DTD with the first graph as a source graph and a second graph of the mirror type as a destination graph and the export component translating the second graph into the XML document.

### Claim 49 (depends on 48)

The apparatus set forth in claim 48 wherein:
the tag pattern graph includes
a pattern part that specifies a pattern to be matched and
a synthesis part that specifies how the information contained in the matched
vertices and/or edges is to be used to make and or modify vertices and/or edges in the target graph,
the transform component making and/or modifying the target graph as specified by the synthesis part.
