2006
DOI: 10.1145/1159974.1134667
|View full text |Cite
|
Sign up to set email alerts
|

Synthesizing safe state machines from Esterel

Abstract: Esterel and Safe State Machines (SSMs) are synchronous languages dedicated to the modeling of embedded reactive systems. While Esterel is a textual language, SSMs are based on the graphical Statecharts formalism. Statecharts are often more intuitive to understand than their textual counterpart, and their animated simulation can help to visualize subtle behaviors of a program. However, in terms of editing speed, revision management, and meta-modeling, the textual nature of Esterel is advantageous. We present an… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2014
2014
2018
2018

Publication Types

Select...
2

Relationship

1
1

Authors

Journals

citations
Cited by 2 publications
(1 citation statement)
references
References 10 publications
0
1
0
Order By: Relevance
“…For example, state transitions correspond to gotos, which are not present in Esterel, but which have been proposed as extensions there, in fact largely motivated by the desire to compile state machines directly into Esterel [27]. Conversely, Esterel has traps that are not present in SCCharts, but that can be encoded with aborts [21]. Our SCG, which results from the high-level compilation phase, is closely related to the concurrent control-flow graph (CCFG) used by the Columbia Esterel Compiler (CEC) as intermediate representation [9], the main difference being that we permit arbitrary control flow including loops and that we have more refined types of data dependencies.…”
Section: Related Workmentioning
confidence: 99%
“…For example, state transitions correspond to gotos, which are not present in Esterel, but which have been proposed as extensions there, in fact largely motivated by the desire to compile state machines directly into Esterel [27]. Conversely, Esterel has traps that are not present in SCCharts, but that can be encoded with aborts [21]. Our SCG, which results from the high-level compilation phase, is closely related to the concurrent control-flow graph (CCFG) used by the Columbia Esterel Compiler (CEC) as intermediate representation [9], the main difference being that we permit arbitrary control flow including loops and that we have more refined types of data dependencies.…”
Section: Related Workmentioning
confidence: 99%