Software composition using graph types, graph, and agents

• US 6,976,020 B2
• Filed: 01/26/2001
• Issued: 12/13/2005
• Est. Priority Date: 01/27/2000
• Status: Expired due to Fees

• Current Assignee: Poppet International Pty Limited
• Original Assignee: Poppet International Pty Limited
• Inventors: Anthony, Jon S., Allemang, Dean T.
• Primary Examiner(s): AMSBURY, WAYNE P
• Application Number:
  US10/182,295
• Publication Number:
  US 20030069908A1
• Time in Patent Office: 1,782 Days
• Field of Search: 707/6, 707/102, 707/104.1, 706/45, 715/513
• US Class Current: 1/1
• CPC Class Codes: G06F 16/258 Data format conversion from or to a database
• CPC Class Codes: G06F 40/143 Markup, e.g. Standard Generalized Markup Language [SGML] or Document Type Definition [DTD]
• CPC Class Codes: G06F 40/154 Tree transformation for tree-structured or markup documents, e.g. XSLT, XSL-FO or stylesheets
• CPC Class Codes: Y10S 707/99936 Pattern matching access
• CPC Class Codes: Y10S 707/99943 Generating database or data structure, e.g. via user interface
• CPC Class Codes: Y10S 707/99945 Object-oriented database structure processing

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

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.

2. 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.

3. The apparatus for controlling a processor set forth in claim 2 wherein:

the set of definitions of events is a model.

4. 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.

5. 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.

6. 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.

7. 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.

8. The apparatus for controlling a processor set forth in claim 1 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.

9. 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.

10. 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.

11. The apparatus for controlling a processor set forth in claim 10 wherein:

a given vertex has a plurality of facets of different facet types.

12. The apparatus for controlling a processor set forth in claim 8 wherein:

the facet type definition specifies a set-theoretic character of the relationship.

13. The apparatus for controlling a processor set forth in claim 8 wherein:

the facet type definition specifies a constraint on the facet.

14. The apparatus for controlling a processor set forth in claim 8 wherein:

the facet type definition specifies a propagator on the facet.

15. The apparatus for controlling a processor set forth in claim 1 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.

16. 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.

17. 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.

18. 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.

19. 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.

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.

21. 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.

22. The apparatus set forth in claim 20 wherein:

there is a plurality of the third graphs; and

the code matches the third graphs to the first graph in a predetermined order.

23. The apparatus set forth in claim 22 wherein:

the predetermined order is associated with the types of the first and second graphs.

24. The apparatus set forth in claim 20 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.

25. 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.

26. The apparatus set forth in claim 24 further comprising:

a graphical user interface for selecting the set of third graphs and determining the order.

27. 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.

28. 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.

29. 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.

30. 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.

31. 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.

32. 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.

33. The apparatus set forth in claim 32 wherein:

an annotation in the vertex specifies the class of vertex or class of edge.

34. 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.

35. 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.

36. Apparatus employed in a system having a processor and storage accessible thereto for producing a model having a plurality of vertices and facets 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 model in response to the linear representation, the graph having vertices representing the entities and facets representing the nesting.

37. 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.

38. The apparatus set forth in claim 36 wherein:

the linear representation is an XML document and the entities are XML constructs.

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 model in the storage, the model having vertices connected by facets 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 facets of the graph.

40. 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.

41. The apparatus set forth in claims 39 wherein:

the linear representation is an XML document and the entities are XML constructs.