Crawling of object model using transformation graph
US8296722B2 · kind B2 · utility
Assignee
Inventors
Key dates
| Filing date | Oct 6, 2008 |
| Grant date | Oct 23, 2012 |
| Priority date | — |
| Expiry date | Jul 24, 2031 |
Classification
- Technology area (CPC G)Physics
- CPC primaryG06F8/10
- WIPO fieldComputer technology
- WIPO sectorElectrical engineering
Abstract
A transformation tree for an object model (OM) is defined. The transformation tree has nodes interconnected by edges, where each node is connected to at most one other tree node. Each node corresponds to a state of the OM; each edge corresponds to an event causing the OM to transition from the state of one node to the state of another node. A transformation graph for the OM is constructed by simulating the transformation tree. The transformation graph has nodes interconnected by edges, and is a directed graph in which each node is connected to one or more other nodes. Each node corresponds to a state of the OM; each edge corresponds to an event causing the OM to transition from the state of one node to the state of another node. Crawling-oriented actions are performed in relation to the OM by being performed in relation to the transformation graph.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.