COMPUTING DEVICE FOR STATE TRANSITIONS OF RECURSIVE STATE MACHINES AND A COMPUTER-IMPLEMENTED METHOD FOR THE DEFINITION, DESIGN AND DEPLOYMENT OF DOMAIN RECURSIVE STATE MACHINES FOR COMPUTING DEVICES OF THAT TYPE

• US 20150160988A1
• Filed: 06/04/2013
• Published: 06/11/2015
• Est. Priority Date: 06/23/2012
• Status: Active Grant

• Current Assignee: PMDA Services Pty Ltd
• Original Assignee: PMDA Services Pty Ltd
• Inventors: Scomparim, Guilherme
• Granted Patent: US 9,378,071 B2
• Time in Patent Office: Days
• US Class Current: 1/1
• CPC Class Codes: G06F 7/00 Methods or arrangements for processing data by operating upon the order or content of the data handled logic circuits H03K19/00
• CPC Class Codes: G06F 9/4488 Object-oriented
• CPC Class Codes: G06F 9/542 Event management; Broadcasting; Multicasting; Notifications
• CPC Class Codes: G06N 5/025 Extracting rules from data

Abstract

A computing device for state transitions of recursive state machines and a computer-implemented method for the definition, design and deployment of domain recursive state machines for computing devices of that type; such devices are intended for the simulation of large systems involving human and automated components, particularly the type generally called “Enterprise Applications”; such devices are also applicable to a much wider range of fields, such as cognitive modelling or robotics. The commonality between the computing device and the computer-implemented method is the Subject Predicate Object Protocol (SPOP) which is used to capture instructions by the computer-implemented method for the definition, design and deployment of recursive state machines and also is the protocol used by the computing device for state transitions of recursive state machines to communicate inbound and outbound events based on the captured instructions.

Claims

1. A computing device for state transitions of recursive state machines, the computing device comprising:

a processor for processing digital data;

a memory device for storing digital data including computer program code coupled to the processor;

a data interface for sending and receiving data coupled to the processor, wherein the processor is controlled by the computer program code to;

receive via the data interface, event data representing an event in relation to a first object;

receive via the data interface, first object data representing the first object;

receive via the data interface, second object data representing a second object;

receive via the data interface, data representing a predicate relationship between the second object and the first object;

calculate a first state in relation to the first object;

calculate a second state in relation to the second object; and

calculate a valid state transition in accordance with the predicate relationship between the second state and the first state.

2. The computing device as claimed in claim 1, wherein, in calculating the valid state transition, the device further comprises:

selecting a first object schema data and a first object rules model data in accordance with the first object data;

selecting a second object schema data and a second object rules model data in accordance with the second object data; and

calculating the valid state transition further in accordance with the first object schema data and the first object rules model data and the second object schema data and the second object rules model data related by a predicate relationship.

3. The computing device as claimed in claim 2, wherein calculating the valid state transition involves:

validating the first object data in accordance with a condition from the first object rules model data and/or first object schema data.

4. The computing device as claimed in claim 3, wherein, if the condition is untrue it is not a valid state transition and the device further comprises sending condition constraint data representing the untrue condition.

5. The computing device as claimed in claim 3, wherein, if the condition is true it is a valid state transition and the device further comprises:

storing the first object data in the memory store; and

storing optionally the second object data in the memory store.

6. The computing device as claimed in claim 5, wherein, in storing the first object data in the memory store, the device further comprises calculating a valid action for the valid state transition.

7. The computing device as claimed in claim 6, wherein, in calculating the valid action, the device further comprises sending valid event data representing the valid action.

8. The computing device as claimed in claim 7, wherein the valid event data further comprises the first object data, second object data and the data representing a predicate relationship between the second object data and the first object data.

9. The computing device as claimed in claim 2, wherein selecting a first object schema data and a first object rules model data in accordance with the first object data and selecting a second object schema data and a second object rules model data in accordance with the second object data, comprises defining, designing and deploying domain recursive state machines comprising the steps of:

capturing in a computation-independent manner the structure of a first object definition foundation ontology data and a second object definition foundation ontology data;

capturing in a computation-independent manner the behaviour of the first object definition foundation ontology data and the second object definition foundation ontology data;

capturing in a computation-independent manner the rules of the first object definition foundation ontology data and the second object definition foundation ontology data;

capturing in a computation-independent manner a component definition foundation ontology data creating a relationship between the second object definition foundation ontology data and the first object definition foundation ontology data;

calculating the schema data and the rules model data;

capturing in a platform-independent manner the design foundation ontology data; and

capturing in a platform-specific manner the deployment foundation ontology data.

10. A computer-implemented method for definition, design and deployment of domain recursive state machines comprising the steps of:

capturing in a computation-independent manner the structure of a first object definition foundation ontology data and a second object definition foundation ontology data;

capturing in a computation-independent manner the behaviour of the first object definition foundation ontology data and the second object definition foundation ontology data;

capturing in a computation-independent manner the rules of the first object definition foundation ontology data and the second object definition foundation ontology data;

capturing in a computation-independent manner a component definition foundation ontology data creating a relationship between the second object definition foundation ontology data and the first object definition foundation ontology data;

calculating the schema data and the rules model data;

capturing in a platform-independent manner the design foundation ontology data; and

capturing in a platform-specific manner the deployment foundation ontology data.

11. The computer-implemented method as claimed in claim 10 wherein the step of capturing in a computation-independent manner the structure of the first object definition foundation ontology data and the second object definition foundation ontology data comprises:

receiving structure data for the first object, the structure data including at least one of class data representing a class for the first object and receiving structure data for the second object, the structure data including at least one of class data representing a class for the second object;

receiving property data representing at least one property for the first object and receiving property data representing at least one property for the second object;

receiving state data representing at least one state of the first object and receiving state data representing at least one state of the second object;

receiving data relating to agents that can manipulate the first object and receiving data relating to agents that can manipulate the second object; and

formulating the findings in a formal language.

12. The computer-implemented method as claimed in claim 10, wherein the step of capturing in a computation-independent manner the behaviour of the first object definition foundation ontology data and the second object definition foundation ontology data comprises:

receiving behaviour data for the first object, the behaviour data including a first object finite state machine data comprising data relating to at least one operation that changes the state of the first object and receiving behaviour data for the second object, the behaviour data including a second object finite state machine data comprising data relating to at least one operation that changes the state of the second object;

receiving an event considered by the operation to communicate with agents;

receiving a filter qualifying the applicability of the at least one operation on the first object'"'"'s finite state machine and receiving a filter qualifying the applicability of the at least one operation on the second object'"'"'s finite state machine; and

formulating the findings in a formal language.

13. The computer-implemented method as claimed in claim 10, wherein the step of capturing in a computation-independent manner the rules of the first object definition foundation ontology data and the second object definition foundation ontology data comprises:

receiving rules data for the first object and second object, the rules data including at least one object-specific, rule-constrained authorization connecting agents to events;

receiving object-specific derivation rules to be applied for a particular authorization;

receiving object-state-specific condition rules which validate the first object and second object state transitions; and

formulating the findings in a formal language.

14. The computer-implemented method as claimed in claim 10,

wherein the step of capturing in a computation-independent manner a component definition foundation ontology data creating a relationship between the second object definition foundation ontology data and the first object definition foundation ontology data comprises:

receiving a reference of the first object definition foundation ontology data defining the first object; and

receiving a reference of the second object definition foundation ontology data defining the second object.

receiving behaviour data comprising the creation of a predicate relationship between the second object finite state machine data and the first object finite state machine data by at least one filter qualifying the recursive aggregation of quasi-orthogonal object state machines into components of wider scope; and

formulating the findings in a formal language.

30. The computer-implemented method as claimed in claim 10, wherein capturing in a platform independent manner the design foundation ontology data comprises:

capturing in a computation-independent manner a first object design foundation ontology data and a second object design foundation ontology data; and

capturing in a platform-independent manner a component design foundation ontology data.

31. The computer-implemented method as claimed in claim 30 wherein the step of capturing in a platform-independent manner the first object design foundation ontology data and the second object design foundation ontology data and the component design foundation ontology data comprises:

receiving communication means required to connect the objects with appropriate agents;

receiving output means for state-specific representations of objects;

receiving elements required to build the outputs based on object requirements;

receiving actions required to implement the events that can be emitted with the output;

receiving services required to implement the operations used to move objects through their states;

receiving subject predicate object protocols means that implement filters responsible for enabling services;

receiving permissions used to connect agents to a communication means or to authorise component and outputs via actions;

receiving templates declaring the formulas implemented inside functionality-specific models used to calculate derivation rules;

receiving rule-defined constructs from the objects'"'"' rule models used to validate conditions; and

formulating the findings in a formal language.

35. The computer-implemented method as claimed in claim 10 wherein the step of capturing in a platform specific manner the deployment foundation ontology data is comprised of the following steps:

Capturing in a platform-specific manner a first object deployment foundation ontology data and a second object deployment foundation ontology data; and

Capturing in a platform-specific manner a component deployment foundation ontology data.

36. The computer-implemented method as claimed in claim 35 wherein the step of capturing in a platform-specific manner the first object deployment foundation ontology data and the second object deployment foundation ontology data and the component deployment foundation ontology data is comprised of the following steps:

receiving addresses of all platform items required for implementing the objects and their agents;

receiving environments specification that provide agents the object-specific operations and user interface functionality;

receiving repository schemas that implement the object and component schemas;

receiving interfaces that embodies the PSM (Platform Specific Model) used by the each object or component to communicate;

receiving application servers specifications that are used to implement the interface for a particular object;

receiving data repository items used to store the objects;

receiving security means used to protect the object;

receiving rules engines that are used for each domain object;

receiving rules repository items used to store the object rules; and

formulating the findings in a formal language.

15-29. -29. (canceled)

32-34. -34. (canceled)

37-43. -43. (canceled)