Translation of Simulink-Stateflow models to hybrid automata

Formal analysis of Simulink/Stateflow (SLSF) diagrams requires association of semantics to these diagrams. In this thesis, we present a technique and the related tool called HyLink for translating a useful subclass of SLSF diagrams to hybrid automata. In the absence of official semantics, there are two possible interpretations of these diagrams: one is based on the ideal mathematical interpretation obtained from the syntax of the building blocks and the other is based on the simulation traces generated by the simulation engine. These two interpretations lead to two different kinds of hybrid automata---the former gives an automaton with state-dependent transitions and the latter gives a time-triggered automaton. We show that under certain assumptions, the semantics of the latter converge to the former as the simulation step size decreases. We illustrate HyLink's translation scheme, the assumptions, and the convergence result through several case studies.

Name thesis:degree_name

M.S.

Level thesis:degree_level

Thesis

Discipline thesis:degree_discipline

Electrical & Computer Engr

Grantor

University of Illinois at Urbana-Champaign

Year dc:date

2011

Author dc:creator

• Manamcheri Sukumar, Karthikeyan

Contributors dc:contributor

• Mitra, Sayan

• Translation of Simulink Stateflow
• Hybrid Automata
• Simulink Stateflow models
• Verification of Simulink Stateflow
• Semantics of Simulink Stateflow

Statement dc:rights

• Copyright 2011 Karthikeyan Manamcheri Sukumar

Language dc:language

en

Handle dc:identifier

http://hdl.handle.net/2142/26197

OAI identifier oai:identifier

oai:www.ideals.illinois.edu:2142/26197