Abstract
We show a subexponential but superpolynomial lower bound for
flattening problem for statecharts. The result presented is resistant
to many variations in statecharts semantics.
The immediate consequence is that usage of common flattening
algorithms in the implementations of tools should be carefully
examined, taking into account presence of signal communication in the
target language. This specifically affects flattening-based
strategies for automatic model-based program synthesis.
flattening problem for statecharts. The result presented is resistant
to many variations in statecharts semantics.
The immediate consequence is that usage of common flattening
algorithms in the implementations of tools should be carefully
examined, taking into account presence of signal communication in the
target language. This specifically affects flattening-based
strategies for automatic model-based program synthesis.
| Original language | English |
|---|
| Place of Publication | Copenhagen |
|---|---|
| Edition | TR-2004-42 |
| Number of pages | 11 |
| ISBN (Electronic) | 87-7949-063-8 |
| Publication status | Published - Feb 2004 |
| Externally published | Yes |
| Series | IT University Technical Report Series |
|---|---|
| Number | TR-2004-42 |
| ISSN | 1600-6100 |