Succinctness of Hierarchical State Diagrams in Absence ofMessage Passing
Research Output:
Book / Anthology / Report
Report
Open access
Publication Information
Output type
Research Output:
Book / Anthology / Report
Report
Original language
EnglishPublication milestones
- Published - 02/2004
Publication status
Published - 02/2004
Place of publication
CopenhagenEdition
TR-2004-42Book series
- Book series name: IT University Technical Report Series
Series number: TR-2004-42
ISSN: 1600-6100
ISBN (Electronic)
87-7949-063-8Abstract
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.
Access to documents
Final published version, 197.82 KB