On Succinctness of Hierarchical State Diagrams in Absence of Message Passing
Andrzej Wąsowski · Electronic Notes in Theoretical Computer Science · 2005
We show a subexponential but superpolynomial lower bound for flattening problem for statecharts. The result explains why common flattening algorithms explode, if the signal communication is excluded from the target language. This specifically affects flattening-based strategies for automatic model-based program synthesis.