|
|
|
| R2011b Documentation → Stateflow | |
Learn more about Stateflow |
|
| Contents | Index |
A flow graph is a stateless flow chart because it cannot maintain its active state between updates. As a result, a flow graph always begins executing from a default transition and ends at a terminating junction (a junction that has no valid outgoing transitions).
By contrast, a state chart stores its current state in memory to preserve local data and activity between updates. As a result, state charts can begin executing where they left off in the previous time step, making them suitable for modeling reactive or supervisory systems that depend on history. In these kinds of systems, the current result depends on a previous result. For more information, see What Is State? and Stateflow Chart Concepts.
 | What Is a Flow Graph? | When to Use Flow Graphs |  |
Learn how engineers use Stateflow to model state machines in their Simulink models.
| © 1984-2012- The MathWorks, Inc. - Site Help - Patents - Trademarks - Privacy Policy - Preventing Piracy - RSS |