#### DMCA

## Semantic translation of Simulink/Stateflow models to hybrid automata using graph transformations (2004)

### Cached

### Download Links

- [www.isis.vanderbilt.edu]
- [w3.isis.vanderbilt.edu]
- [w3.isis.vanderbilt.edu]
- DBLP

### Other Repositories/Bibliography

Venue: | International Workshop on Graph Transformation and Visual Modeling Techniques |

Citations: | 48 - 5 self |

### Citations

670 | The Theory of Hybrid Automata
- HENZINGER
- 1996
(Show Context)
Citation Context ...t that allows representation of hybrid systems using dynamic networks of hybrid automata. The detailed specification is available in [3]. The automata in HSIF follow the definition of hybrid automata =-=[4]-=- with a finite number of locations (or discrete states), where each location has a number of differential and algebraic equations associated with it. Differential equations capture continuous time dyn... |

71 | Sprinkle J.: On the Use of Graph Transformations for the Formal Specification of Model Interpreters
- Karsai, Agrawal, et al.
- 2003
(Show Context)
Citation Context ...cutable semantics. In this paper only the necessary language constructs are explained, [5] describes the full approach and support tools, and the operational semantics of GReAT is formally defined in =-=[10]-=-. GReAT is based on the theoretical work of graph grammars and transformations [6][8][9] and belongs to the set of practical graph transformations systems, like AGG and PROGRES. GReAT has two parts: (... |

64 | Graph transformation for specification and programming
- Andries, Engels, et al.
- 1999
(Show Context)
Citation Context ...] describes the full approach and support tools, and the operational semantics of GReAT is formally defined in [10]. GReAT is based on the theoretical work of graph grammars and transformations [6][8]=-=[9]-=- and belongs to the set of practical graph transformations systems, like AGG and PROGRES. GReAT has two parts: (1) graph transformation language, and (2) control flow language. The graph transformatio... |

43 | Practical use of graph rewriting
- Blostein, Fahmy, et al.
- 1995
(Show Context)
Citation Context ... [5] describes the full approach and support tools, and the operational semantics of GReAT is formally defined in [10]. GReAT is based on the theoretical work of graph grammars and transformations [6]=-=[8]-=-[9] and belongs to the set of practical graph transformations systems, like AGG and PROGRES. GReAT has two parts: (1) graph transformation language, and (2) control flow language. The graph transforma... |

40 |
An end-to-end domain-driven software development framework
- Agrawal, Karsai, et al.
- 2003
(Show Context)
Citation Context ...ReAT is a tool that allows users to specify graph transformations in a graphical form with precise formal and executable semantics. In this paper only the necessary language constructs are explained, =-=[5]-=- describes the full approach and support tools, and the operational semantics of GReAT is formally defined in [10]. GReAT is based on the theoretical work of graph grammars and transformations [6][8][... |

33 |
How to uniformly specify program anal- ysis and transformation with graph rewrite systems
- Assmann
- 1996
(Show Context)
Citation Context ... problem one often encounters in practice. Frequently the mapping is implemented in code, although automated mappings have been discussed in literature and a subset of these have been implemented. In =-=[16]-=- graph transformations have been used to specify program transformations. Semantics of a hierarchical state machine have been defined by specification of a transformation to FSM in [17]. [18] describe... |

32 | Formal semantics and analysis methods for Simulink Stateflow models
- Tiwari
(Show Context)
Citation Context ...en performed in [14] using a model checker. The mapping however was performed by hand. Semantics of Stateflow have been described by 11sAgrawal,Simon,Karsai defining a mapping to pushdown automata in =-=[15]-=-. 9 Summary and future work We have described a method for converting MSS models into HSIF models. The MSS models may contain continuous time blocks, Stateflow blocks, and switches, while the resultin... |

30 | Translating discrete-time Simulink to Lustre
- Caspi, Curic, et al.
- 2003
(Show Context)
Citation Context ...state machine have been defined by specification of a transformation to FSM in [17]. [18] describes the support of design patterns, while tool integration is via transformations in described in [19]. =-=[13]-=- describes the algorithm for mapping discrete-time Simulink blocks to Lustre. Verification of Simulink/Stateflow models has been performed in [14] using a model checker. The mapping however was perfor... |

25 | Support for design patterns through graph transformation tools
- Radermacher
- 1998
(Show Context)
Citation Context ...nted. In [16] graph transformations have been used to specify program transformations. Semantics of a hierarchical state machine have been defined by specification of a transformation to FSM in [17]. =-=[18]-=- describes the support of design patterns, while tool integration is via transformations in described in [19]. [13] describes the algorithm for mapping discrete-time Simulink blocks to Lustre. Verific... |

16 | A Graph Rewriting Framework for Statecharts Semantics
- Maggiolo-Schettini, Peron
- 1996
(Show Context)
Citation Context ...mplemented. In [16] graph transformations have been used to specify program transformations. Semantics of a hierarchical state machine have been defined by specification of a transformation to FSM in =-=[17]-=-. [18] describes the support of design patterns, while tool integration is via transformations in described in [19]. [13] describes the algorithm for mapping discrete-time Simulink blocks to Lustre. V... |

12 |
Tool integration and construction using generated graph-baseddesign representation
- Bedenfeld, Camposano
- 1995
(Show Context)
Citation Context ...hical state machine have been defined by specification of a transformation to FSM in [17]. [18] describes the support of design patterns, while tool integration is via transformations in described in =-=[19]-=-. [13] describes the algorithm for mapping discrete-time Simulink blocks to Lustre. Verification of Simulink/Stateflow models has been performed in [14] using a model checker. The mapping however was ... |

6 |
Hyvisual: A hybrid system visual modeler
- Hylands, Lee, et al.
- 2003
(Show Context)
Citation Context ...l reveal that state Too High with value of V1 = 1, V2 = 0 and V3 = 0 will never occur and it can thus be eliminated. Figure 6(d) shows the locations in HSIF. The visualization is provided by HyVisual =-=[12]-=-. After all the discrete locations have been identified, the continuous time dynamics for each location will be found using the backward trace algorithm. 8 Related Work Semantic mapping between differ... |