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 9,378,071 B2
• Filed: 06/04/2013
• Issued: 06/28/2016
• Est. Priority Date: 06/23/2012
• Status: Active Grant

• Current Assignee: PMDA Services Pty Ltd
• Original Assignee: PMDA Services Pty Ltd
• Inventors: Scomparim, Guilherme
• Primary Examiner(s): DORAIS, CRAIG C
• Application Number:
  US14/407,927
• Publication Number:
  US 20150160988A1
• Time in Patent Office: 1,120 Days
• Field of Search: None
• 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 the 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 by;

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

selecting the second object schema data and the 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 the predicate relationship;

wherein selecting the first object schema data and the first object rules model data in accordance with the first object data and selecting the second object schema data and the 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 structure of a first object definition foundation ontology data and a second object definition foundation ontology data;

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

capturing in a computation-independent manner 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 schema data and rules model data;

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

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

2. The computing device as claimed in claim 1, 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 the first object schema data.

3. The computing device as claimed in claim 2, wherein, if the condition is untrue the valid state transition is not valid and the processor is controlled by the computer program code to perform sending condition constraint data representing the untrue condition.

4. The computing device as claimed in claim 2, wherein, if the condition is true the valid state transition is valid and the processor is controlled by the computer program code to perform:

storing the first object data in the memory device; and

storing optionally the second object data in the memory device.

5. The computing device as claimed in claim 4, wherein, in storing the first object data in the memory device, the processor is controlled by the computer program code to perform calculating a valid action for the valid state transition.

6. The computing device as claimed in claim 5, wherein, in calculating the valid action, the processor is controlled by the computer program code to perform sending valid event data representing the valid action.

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

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

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

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

capturing in a computation-independent manner 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 schema data and rules model data;

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

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

9. The computer-implemented method as claimed in claim 8 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 a first object, the structure data including at least one of class data representing a class for the first object and receiving structure data for a 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 findings in a formal language.

10. The computer-implemented method as claimed in claim 8, 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 a first object, the behaviour data including first object finite state machine data comprising data relating to at least one operation that changes a state of the first object and receiving the behaviour data for a second object, the behaviour data including second object finite state machine data comprising data relating to at least one operation that changes a state of the second object;

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

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

formulating findings in a formal language.

11. The computer-implemented method as claimed in claim 8, 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 a first object and a 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 findings in a formal language.

12. The computer-implemented method as claimed in claim 8, wherein the step of capturing in a computation-independent manner the 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 a first object; and

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

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

formulating findings in a formal language.

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

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

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

14. The computer-implemented method as claimed in claim 8 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.

15. The computer-implemented method as claimed in claim 13 wherein the step of capturing 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 objects with appropriate agents;

receiving output means for state-specific representations of objects;

receiving elements required to build outputs based on object requirements;

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

receiving services required to implement 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 the outputs via actions;

receiving templates declaring 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 findings in a formal language.

16. The computer-implemented method as claimed in claim 14 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 objects and component schemas;

receiving interfaces that embodies a PSM (Platform Specific Model) used by 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 objects;

receiving rules engines that are used for each domain object;

receiving rules repository items used to store object rules; and

formulating findings in a formal language.