Statecharts: A visual formalism for complex systems
Science of Computer Programming
The ESTEREL synchronous programming language: design, semantics, implementation
Science of Computer Programming
The STATEMATE semantics of statecharts
ACM Transactions on Software Engineering and Methodology (TOSEM)
What is in a Step: On the Semantics of Statecharts
TACS '91 Proceedings of the International Conference on Theoretical Aspects of Computer Software
Communicating Hierarchical State Machines
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
Operational and Compositional Semantics of Synchronous Automaton Compositions
CONCUR '92 Proceedings of the Third International Conference on Concurrency Theory
A Compositional Semantics for Statecharts using Labeled Transition Systems
CONCUR '94 Proceedings of the Concurrency Theory
CONCUR '96 Proceedings of the 7th International Conference on Concurrency Theory
Modeling Statecharts Behaviour in a Fully Abstract Way
CAAP '88 Proceedings of the 13th Colloquium on Trees in Algebra and Programming
| Hi-index | 0.00 |
The semantics of Statecharts macro steps, as introduced by Pnueli and Shalev, lacks compositionality. This paper first analyzes the compositionality problem and traces it back to the invalidity of the Law of the Excluded Middle. It then characterizes the semantics via a particular class of linear, intuitionistic Kripke models, namely stabilization sequences. This yields, for the first time in the literature, a simple fully-abstract semantics which interprets Pnueli and Shalev's concept of failure naturally. The results not only give insights into the semantic subtleties of Statecharts, but also provide a basis for developing algebraic theories for macro steps and for comparing different Statecharts variants.