On Succinctness of Hierarchical State Diagrams in Absence of Message Passing

Authors:
Andrzej Wasowski
Affiliations:
Department of Innovation, IT University of Copenhagen, Denmark
Venue:
Electronic Notes in Theoretical Computer Science (ENTCS)
Year:
2005

Citing 9
Cited 0

Statecharts: A visual formalism for complex systems

Science of Computer Programming
On the power of bounded concurrency I: finite automata

Journal of the ACM (JACM)
The STATEMATE semantics of statecharts

ACM Transactions on Software Engineering and Methodology (TOSEM)
Testing object-oriented systems: models, patterns, and tools

Testing object-oriented systems: models, patterns, and tools
Practical Verification of Embedded Software

Computer
Formal Verification of UML Statecharts with Real-Time Extensions

FASE '02 Proceedings of the 5th International Conference on Fundamental Approaches to Software Engineering
Transformation of UML Specification to XTG

PSI '02 Revised Papers from the 4th International Andrei Ershov Memorial Conference on Perspectives of System Informatics: Akademgorodok, Novosibirsk, Russia
A Comparison of Statecharts Variants

ProCoS Proceedings of the Third International Symposium Organized Jointly with the Working Group Provably Correct Systems on Formal Techniques in Real-Time and Fault-Tolerant Systems
On the compositional properties of UML statechart diagrams

ROOM'00 Proceedings of the 2000 international conference on Rigorous Object-Oriented Methods

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.