Patent application number | Description | Published |
20090063370 | Composition of Web Services Using Representations - A system for composing Web services may include a goal determiner unit and a composer unit. The goal determiner unit may be configured to access a primary goal of final states of Web service representations. The composer unit may be configured to compute a set of transitions from initial states of the Web service representations to the primary goal, compute intermediate states of one or more Web service representations, and generate a copy rule of the set of transitions, the copy rule having a condition part that specifies the intermediate states and a portion of the final states of the primary goal and an activity part that includes assignments of input variables consumed by transitions from the intermediate states. | 03-05-2009 |
20100031240 | ONTOLOGY-BASED GENERATION AND INTEGRATION OF INFORMATION SOURCES IN DEVELOPMENT PLATFORMS - Methods and systems to generate derivative information sources, from original information sources, use an ontology that provides a logic-based representation formalism of each of a number of original information sources, the original information sources having heterogeneous representation formalisms. The original information sources are transformed to the ontology. A number of derivative information sources, corresponding to the original information sources, may be automatically generated from the ontology. | 02-04-2010 |
20100121864 | DATA MODEL OPTIMIZATION - A name of one or more entity classes of the data model may be refined to conform to a naming convention. A semantic meaning of each of the names and one or more attributes of each entity class may be determined. It may be determined that the name of a first entity class is semantically similar to the name of a second entity class based on a semantic distance between the semantic meaning of the names, where a substantial similarity may be determined between the first entity class and the second entity class by comparing the semantic meaning of the one or more attributes of the first entity class to the semantic meaning of the one or more attributes of the second entity class. The data model may be normalized based on the substantial similarity. | 05-13-2010 |
20120041794 | METHOD AND SYSTEM TO VALIDATE COMPONENT-BASED IMPLEMENTATIONS OF BUSINESS PROCESSES - A computer-implemented method and system to validate component-based implementation of business processes are provided. The method comprises accessing an abstract business process and a specific business process. The specific business process includes sub-steps that refine a step in the abstract business process. A refinement between the abstract business process and the specific business process is validated using a first Petri Net. Component models are accesses, where the respective component models describe an operation performed by a component corresponding to the component model. A grounding between the sub-steps and the component models is validated using a second Petri Net. | 02-16-2012 |
20120324588 | DATA MODEL OPTIMIZATION - A name of one or more entity classes of the data model may be refined to conform to a naming convention. A semantic meaning of each of the names and one or more attributes of each entity class may be determined. It may be determined that the name of a first entity class is semantically similar to the name of a second entity class based on a semantic distance between the semantic meaning of the names, where a substantial similarity may be determined between the first entity class and the second entity class by comparing the semantic meaning of the one or more attributes of the first entity class to the semantic meaning of the one or more attributes of the second entity class. The data model may be normalized based on the substantial similarity. | 12-20-2012 |
20130204909 | User-guided Multi-schema Integration - Methods, systems, and computer-readable storage media for user-guided multi-schema integration and include actions of receiving a plurality of schemas, each schema defining a data structure and including a plurality of intermediate elements and a plurality of leaf elements, receiving leaf correspondences that match leaf elements between schemas of the plurality of schemas, processing the plurality of schemas and the leaf correspondences using closed frequent itemset mining to define a first plurality of redundancy groups, each redundancy group including a proposed correspondence between intermediate elements of schemas, displaying the first plurality of redundancy groups to a user, receiving user input, the user input including one or more actions to one or more redundancy groups in the first plurality of redundancy groups, processing the plurality of schemas, the leaf correspondences and the one or more actions to define a second plurality of redundancy groups, and displaying the second plurality of redundancy groups. | 08-08-2013 |
20130246480 | Computing Canonical Hierarchical Schemas - Methods, systems, and computer-readable storage media for receiving a plurality of source hierarchical schemas, processing the source hierarchical schemas to generate a merged graph, which is comprising a plurality of merged nodes, each merged node being provided based on one or more nodes from at least two of the source hierarchical schemas, determining and resolving using conflicts in the merged graph to generate a conflict-free merged graph, wherein resolving comprises splitting one or more merged nodes into respective sub-sets of merged nodes, defining and processing a constraints satisfaction problem (CSP) to generate a plurality of mediated hierarchical schemas (MHSs), each MHS being a solution to the CSP, identifying an MHS of the plurality of MHSs as an optimum MHS, wherein a canonical hierarchical schema (CHS) is provided as the optimum MHS, and storing the CHS as a computer-readable document in a computer-readable memory. | 09-19-2013 |
20130275389 | Verification of Status Schemas based on Business Goal Definitions - Methods, systems, and computer-readable storage media for evaluating a validity of a status and action management (SAM) schema. In some implementations, actions include receiving the SAM schema, the SAM schema being stored as a computer-readable document in memory, providing one or more goals, each goal representing an intention of the SAM schema, the one or more goals being provided in a computer-readable document stored in memory and including one or more primary goals and one or more recovery goals that each express an intention of a process underlying the SAM schema, and processing the one or more goals using a computer-executable model checking tool for evaluating the validity of the SAM schema. | 10-17-2013 |
20140040217 | Checking Compatibility of Extended and Core SAM Schemas Based on Complex Goals - Methods, systems, and computer-readable storage media for evaluating a validity of an extended status and action management (SAM) schema. In some implementations, actions include receiving the extended SAM schema, the extended SAM schema being stored as a computer-readable document in memory and being an extension of a core SAM schema, providing one or more goals, each goal representing an intention of the core SAM schema, the one or more goals being provided in a computer-readable document stored in memory and comprising one or more primary goals that each express an intention of a process underlying the core SAM schema, and processing the one or more goals using a computer-executable model checking tool for evaluating the validity of the extended SAM schema. | 02-06-2014 |
20140330612 | Validation of Functional Correctness of SAM Schemas including Action Chains - Methods, systems, and computer-readable storage media for evaluating a validity of an extended status and action management (SAM) schema. In some implementations, actions include receiving the extended SAM schema, the extended SAM schema being an extension of a core SAM schema, providing one or more goals, goals representing an intention of the core SAM schema, receiving one or more action chains, action chains representing one or more actions of the extended SAM schema that are to be automatically executed, the one or more actions being associated with triggerability flags, a triggerability flag indicating whether a respective action is only triggerable using a respective action chain, and processing the one or more goals, the one or more action chains and the triggerability flags using a computer-executable model checking tool for evaluating the validity of the extended SAM schema. | 11-06-2014 |
20140330614 | Validating SAM Schemas Based on Business Functionalities - Methods, systems, and computer-readable storage media for evaluating a validity of an extended status and action management (SAM) schema. In some implementations, actions include receiving the extended SAM schema, the extended SAM schema being stored as a computer-readable document in memory and being an extension of a core SAM schema, receiving one or more business functionalities, at least one business functionality including a plurality of status vectors along a core trace that can be achieved in the core SAM schema, the one or more business functionalities being provided in a computer-readable document stored in memory, and processing the extended SAM schema and the one or more business functionalities using a computer-executable model checking tool for evaluating a validity of the extended SAM schema. | 11-06-2014 |
20150032777 | CANONICAL DATA MODEL FOR ITERATIVE EFFORT REDUCTION IN BUSINESS-TO-BUSINESS SCHEMA INTEGRATION - The present disclosure describes methods, systems, and computer program products for providing and maintaining an evolving canonical data model (CDM) which consolidates current knowledge of the correspondences of existing schemas. One computer-implemented method includes receiving the plurality of source hierarchical schemas, each source hierarchical schema being stored as a computer-readable document in computer-readable memory, processing, using a computer, the source hierarchical schemas to generate a merged graph, the merged graph comprising a plurality of merged nodes, each merged node being provided based on one or more nodes from at least two of the source hierarchical schemas, and determining, using the computer, that the merged graph includes one or more conflicts and, in response, resolving each conflict of the one or more conflicts to generate a computed-transitive-edge-free, conflict-free merged graph as a unified data model (UDM), wherein resolving comprises splitting one or more merged nodes into respective sub-sets of merged nodes. | 01-29-2015 |