Semantic Translation of Stateflow Diagrams into I/O-EFA Models
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Simulink/Stateflow designs lack a model that is amenable for formal analysis such as verification and validation, particularly for safety and security concerns, and there is a need for translating Stateflow charts into Input/Output Extended Finite Automata (I/O-EFA) models that preserve discrete behaviors and enable automatic test generation.
Innovation Solution
A recursive semantic translation approach that treats each state of the Stateflow model as an atomic module, applies composition and refinement rules to interconnect these modules, and translates Stateflow charts into I/O-EFA models, allowing for automated test generation based on these models.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Ease of operation
If Simulink/Stateflow diagrams are used for system modeling, then graphical visualization and simulation capabilities are improved, but the model is not amenable for formal analysis such as verification and validation
Solution Approach 1:
The patent introduces an intermediary translation process that converts Simulink/Stateflow diagrams into I/O-EFA models. This mediator preserves the discrete behaviors of the original diagram while transforming it into a formal model suitable for verification and validation, thus resolving the contradiction between graphical ease of use and formal analysis capability
Solution Approach 2:
The patent creates a formal copy (I/O-EFA model) of the Simulink/Stateflow diagram that replicates its discrete behaviors. This copy can be used for formal analysis without modifying the original graphical model, allowing both graphical visualization and formal verification to coexist
2Reliability
If Stateflow charts are translated into I/O-EFA models, then discrete behaviors are preserved and formal analysis is enabled, but translation complexity increases
Solution Approach 1:
The patent segments the translation process into distinct components: identifying states and transitions, extracting discrete behaviors, and constructing I/O-EFA models. This segmentation makes the complex translation process more manageable and systematic
Solution Approach 2:
The patent replaces manual translation efforts with an automated computational process that systematically converts Simulink/Stateflow diagrams into I/O-EFA models, reducing the practical complexity despite the theoretical sophistication required
3Adaptability or versatility
If manual verification and testing are performed on Simulink/Stateflow designs, then flexibility in analysis is maintained, but time consumption and productivity decrease
Solution Approach 1:
The patent enables the model itself to serve the verification purpose by translating it into a form that can be automatically analyzed. The I/O-EFA model can be subjected to automated formal verification methods, eliminating the need for manual testing while preserving analytical flexibility
Solution Approach 2:
The patent performs preliminary translation of the Simulink/Stateflow diagram into an I/O-EFA model before verification. This preliminary action enables subsequent automated analysis to proceed efficiently without time-consuming manual intervention during the verification phase
Data Source
AI summary
A method of translation of a chart associated with a graphical modeling environment into an input/output-extended finite automata (I/O-EFA) model is provided. The method includes receiving a representation of the chart and processing the representation of the chart with a computing device by (a) representing atomic models for each individual state of the chart, (b) applying composition rules to interconnect the atomic models while preserving state execution and transition behaviors to obtain the I/O-EFA model.