Semantic translation of time-driven simulink diagrams using input/output extended finite automata

1. A method of semantic translation of a diagram associated with a graphical modeling environment into an input/output-extended finite automata (I/O-EFA) model, the method comprising:

receiving a representation of the diagram at a computing device;

processing the representation of the diagram with the computing device by (a) representing all atomic blocks in said diagram as a tuple, (b) representing the diagram using a connecting rule and a conditioning rule, (c) determining an order in which the blocks included inside the diagram are executed, (d) translating the atomic blocks into the I/O-EFA model using a first algorithm, and (e) translating for the connecting rule and the condition rule using a second algorithm and a third algorithm, respectively to thereby modify the I/O-EFA model; and

storing the I/O-EFA model on a non-transitory computer readable storage medium.

2. The method of claim 1 wherein the step of processing is performed by the computing device according to an instruction set stored on the non-transitory computer readable storage medium.

3. The method of claim 1 wherein the diagram is a diagram associated with a graphical block diagramming tool.

4. The method of claim 1 wherein the diagram represents a hybrid system combining event-driven discrete and time-dependent continuous behaviors.

5. The method of claim 1 wherein the diagram represents a system with time-dependent continuous behaviors and wherein the input/output-extended finite automata model represents a reactive untimed infinite state system and wherein input-state-output behavior of the I/O-EFA preserves input-state-output behavior of the diagram at each sample time.

6. The method of claim 1 wherein the diagram represents multi-rate systems and comprises blocks with sample times having initial offsets and wherein input-state-output behavior of the diagram is obtained by variable-step solvers.

7. The method of claim 1 wherein the diagram comprises mathematically representable automic blocks and rules of combining automic blocks to form complex blocks.

8. The method of claim 1 wherein the input/output-extended finite automata model is defined as a tuple wherein

L is a set of locations (symbolic-states),

D=D1 Dn is a set of typed data (numeric-states),

U=U1 Um is a set of typed numeric-inputs,

Y=Y1 Yp is a set of typed numeric-outputs,

is a set of symbolic-inputs,

Δ is a set of symbolic-outputs,

is an initial location,

D0 D is a set of initial-data values,

is a final location, and

E is a set of edges, and each e E is a 7-tuple,

where

oe L is an origin location,

te L is a terminal location,

is a symbolic-input,

is a symbolic-output,

Ge D U is an enabling guard (a predicate),

is a data-update function, and

is an output-assignment function.

9. A non-transitory computer-readable storage medium storing computer-executable instructions that are executed on a processing device, the computer-executable instructions comprising:

instructions for receiving a data representation of a diagram, said diagram comprising a plurality of blocks and said diagram being associated with a graphical modeling environment in which blocks within the diagram define semantics for executing the diagram; and

instructions for processing the data representation of the diagram to translate the diagram into an input/output-extended finite automata model.

10. The non-transitory computer readable storage medium of claim 9 wherein the instructions for processing the data representation of the diagram to translate the diagram into the input/output-extended finite automata model provide for (a) representing all atomic blocks in said diagram as a triple, (b) representing the diagram using a connecting rule and a conditioning rule, (c) determining an order in which the blocks included inside the diagram are executed, (d) translating the atomic blocks into the I/O-EFA model using a first algorithm, and (e) translating for the connecting rule and the conditioning rule using a second algorithm and a third algorithm, respectively to thereby modify the I/O-EFA model.

11. The non-transitory computer readable storage medium of claim 10 wherein the diagram represents a system with time-dependent continuous behaviors and wherein the input/output-extended finite automata model represents a reactive untimed infinite state system and wherein input-state-output behavior of the I/O-EFA preserves input-state-output behavior of the diagram at each sample time.

12. The non-transitory computer readable storage medium of claim 10 wherein the diagram represents multi-rate systems and comprises blocks with sample times having initial offsets and wherein input-state-output behavior of the diagram is Obtained by variable-step solvers.

13. The non-transitory computer readable storage medium of method of claim 10 wherein the diagram comprises mathematically representable automic blocks and rules of combining automic blocks to form complex blocks.

14. The non-transitory computer readable storage medium of claim 9 wherein the diagram represents a hybrid system combining event-driven discrete and time-dependent continuous behaviors.

15. The non-transitory computer readable storage medium of claim 10 wherein the input/output-extended finite automata model is defined as a tuple wherein

L is a set of locations (symbolic-states),

D=D1 Dn is a set of typed data (numeric-states),

U=U1 Um is a set of typed numeric-inputs,

Y=Y1 Yp is a set of typed numeric-outputs,

is a set of symbolic-inputs,

Δ is a set of symbolic-outputs,

is an initial location,

D0 D is a set of initial-data values,

is a final location, and

E is a set of edges, and each e E is a 7-tuple,

where

oe L is an origin location,

te L is a terminal location,

is a symbolic-input,

is a symbolic-output,

Ge D U is an enabling guard (a predicate),

is a data-update function, and

is an output-assignment function.

16. A method of semantic translation of a diagram into input/output-extended finite automata (I/O-EFA) model, the method comprising:

(i) representing atomic blocks in the diagram as a tuple;

(ii) representing the diagram using a connecting-rule and a conditioning-rule;

(iii) determining an order in which the atomic blocks of the diagram are executed;

(iv) translating the atomic-blocks into an I/O-EFA model;

(v) translating for the connecting-rule and the conditioning-rule to adjust the I/O-EFA model;

(vi) storing the I/O-EFA model on a non-transitory computer readable storage medium;

wherein steps (i) to (v) are performed by a computing device.

17. A system comprising logic performing the method of claim 16 embodied on at least one non transitory computer readable medium.

18. A method of translating a class of diagrams as input/output-extended finite automata, the method comprising:

receiving a data representation of a diagram at a computing device, said diagram comprising a plurality of blocks and said diagram being associated with a graphical modeling environment which defines semantics for executing the diagram;

processing using the computing device the data representation of the diagram to translate the diagram into an input/output-extended finite automata model; and

storing the input/output-extended finite automata model on a non-transitory computer readable storage medium.