Variants in graphical modeling environments

• US 8,700,368 B1
• Filed: 02/07/2013
• Issued: 04/15/2014
• Est. Priority Date: 06/15/2004
• Status: Active Grant

• Current Assignee: The MathWorks, Inc.
• Original Assignee: The MathWorks, Inc.
• Inventors: Ciolfi, John E., Guo, Yang, Mani, Ramamurthy
• Primary Examiner(s): Shah, Kamini S
• Assistant Examiner(s): OCHOA, JUAN CARLOS
• Application Number:
  US13/761,656
• Time in Patent Office: 432 Days
• Field of Search: 703/6
• US Class Current: 703/6
• CPC Class Codes: G06F 2111/02 CAD in a network environment, e.g. collaborative CAD or distributed simulation
• CPC Class Codes: G06F 30/20 Design optimisation, verification or simulation optimisation, verification or simulation of circuit designs G06F30/30

Abstract

This invention allows users to build, manipulate, and finally deploy various model configurations with little performance overhead, better syntactic clarity and configuration flexibility.

Claims

1. A method comprising:

providing, within a portion of a graphical model having executable semantics, an element having a first variant and a second variant that are parts of the element, where;

the first variant includes at least one computational section that defines a first execution implementation of the element,

the second variant includes at least one computational section that defines a second execution implementation of the element, and

the first and second execution implementations defined by the at least one computational sections of the first and second variants are different from each other and represent alternative execution implementations of the element;

selecting the first variant of the element; and

compiling, by a processor, at least the portion of the graphical model using only the first execution implementation defined by the at least one computational section of the first variant of the element, the compiling based on the selecting.

2. The method of claim 1 where the first and second execution implementations defined by the first and second variants represent different functions to be performed by the element.

3. The method of claim 1 where the element is

a source element of the graphical model,

a sink element of the graphical model or

an intermediary element of the graphical model.

4. The method of claim 1, further comprising:

making the first execution implementation active;

using the active first execution implementation when compiling the graphical model.

5. The method of claim 1, further comprising:

swapping out the second execution implementation to make the second execution implementation inactive.

6. The method of claim 1, further comprising:

saving the graphical model in a memory, the saved graphical model including the first execution implementation and not the second execution implementation.

7. The method of claim 1, further comprising:

pruning the second execution implementation from the graphical model; and

saving the graphical model in a memory after the second execution implementation has been pruned from the graphical model.

8. The method of claim 1, further comprising:

storing, in a memory, a representation of the graphical model that includes the first and the second variants of the element.

9. The method of claim 1 further comprising:

generating code for at least the portion of the graphical model, where

the generated code includes a segment for the first execution implementation defined by the at least one computational section of the first variant, and

the generated code does not include a segment for the second execution implementation defined by the at least one computational section of the second variant.

10. A non-transitory computer-readable medium for storing one or more executable instructions, the medium comprising one or more instructions to:

provide, within a portion of a graphical model having executable semantics, an element having a first variant and a second variant that are parts of the element, where;

the first variant includes at least one computational section that defines a first function for the element,

the second variant includes at least one computational section that defines a second function for the element, and

the first and second functions defined by the at least one computational sections of the first and second variants are different from each other and represent alternative execution implementations of the element;

receive a selection of the first variant of the element; and

compile, by a processor, at least the portion of the graphical model using only the first function defined by the at least one computational section of the first variant of the element, the compiling based on the received selection.

11. The non-transitory computer-readable medium of claim 10 where the first and second functions defined by the first and second variants represent different functions to be performed by the element.

12. The non-transitory computer-readable medium claim 10 where the element is

a source element of the graphical model,

a sink element of the graphical model or

an intermediary element of the graphical model.

13. The non-transitory computer-readable medium of claim 10, further comprising one or more instructions to:

make the first function active; and

use the active first function when compiling the graphical model.

14. The non-transitory computer-readable medium of claim 10, further comprising one or more instructions to:

save the graphical model in a memory, the saved graphical model including the first function and not the second function.

15. The non-transitory computer-readable medium of claim 10, further comprising one or more instructions to:

prune the second function from the graphical model; and

save the graphical model in a memory after the second function has been pruned from the graphical model.

16. The non-transitory computer-readable medium of claim 10 wherein the first variant includes a state chart having executable semantics.

17. The non-transitory computer-readable medium of claim 10 further comprising one or more instructions to:

generate code for at least the portion of the graphical model, where

the generated code includes a segment for the first function defined by the at least one computational section of the first variant, and

the generated code does not include a segment for the second function defined by the at least one computational section of the second variant.

18. An apparatus comprising:

a memory storing an executable block diagram model, the block diagram model including a component having a first variant and a second variant that are parts of the component, where;

the first variant includes at least one computational section that defines a first execution branch through the component,

the second variant includes at least one computational section that defines a second execution branch through the component, and

the first and second execution branches defined by the at least one computational sections of the first and second variants are different from each other and represent alternative execution implementations of the component; and

a processor coupled to the memory, the processor configured to;

receive a selection of the first variant of the component; and

based on the received selection, compile at least the component of the block diagram model using only the first execution branch defined by the at least one computational section of the first variant of the component.

19. The apparatus of claim 18 wherein

the first variant includes a first set of blocks, and

the second variant includes a second set of blocks.

20. The apparatus of claim 18 wherein the first and second execution branches share at least one point of connectivity.

21. The apparatus of claim 18 wherein the first and section execution branches extend between a first shared point of connectivity and a second shared point of connectivity.

22. The apparatus of claim 18 wherein the processor is further configured to:

save the executable block diagram model in the memory, the saved executable block diagram model including the first execution branch and not the second execution branch.

23. The apparatus of claim 18 wherein the processor is further configured to:

generate code for at least the component of the executable block diagram model, where

the generated code includes a segment for the first execution branch defined by the at least one computational section of the first variant, and

the generated code does not include a segment for the second execution branch defined by the at least one computational section of the second variant.