Results 1 
2 of
2
A Compositional Approach to Statecharts Semantics
, 2000
"... Statecharts is a visual language for specifying reactive system behavior. The formalism extends traditional finitestate machines with notions of hierarchy and concurrency, and it is used in many popular software design notations. A large part of the appeal of Statecharts derives from its basis in ..."
Abstract

Cited by 24 (5 self)
 Add to MetaCart
Statecharts is a visual language for specifying reactive system behavior. The formalism extends traditional finitestate machines with notions of hierarchy and concurrency, and it is used in many popular software design notations. A large part of the appeal of Statecharts derives from its basis in state machines, with their intuitive operational interpretation. The traditional semantics of Statecharts, however, suffers from a serious defect: it is not compositional, meaning that the behavior of system descriptions cannot be inferred from the behavior of their subsystems. Compositionality is a prerequisite for exploiting the modular structure of Statecharts for simulation, verification, and code generation, and it also provides the necessary foundation for reusability. This paper suggests a new compositional approach to formalizing Statecharts semantics as flattened transition systems in which transitions represent system steps. The approach builds on ideas developed for timed process ca...
The Intuitionism Behind Statecharts Steps
, 2000
"... SEMANTICS We have seen in the previous section that the behavior of a parallel con#guration P in all parallel contexts is captured by its set of sequence models SM #P # or, equivalently, its behavior Beh#P #. This yields a denotational semantics in which parallel composition is intersection, i.e., ..."
Abstract

Cited by 8 (1 self)
 Add to MetaCart
SEMANTICS We have seen in the previous section that the behavior of a parallel con#guration P in all parallel contexts is captured by its set of sequence models SM #P # or, equivalently, its behavior Beh#P #. This yields a denotational semantics in which parallel composition is intersection, i.e., SM #P 1 k P 2 #=SM #P 1 # # SM #P 2 #. Similarly, Beh#P 1 k P 2 #=Beh#P 1 ##Beh#P 2 #, where the intersection is taken pointwise. This section shows how this semantics can easily be extended to work with arbitrary contexts, thereby completely characterizing the semantics of PC. However, the question, which still needs to be answered, is how to capture the semantics of the choice operator +. In view of the fact that k is logical conjunction in the intuitionistic logic of stabilization sequences, it would be natural to expect that + corresponds to logical disjunction over sequence models. However, it will turn out that the choice operator + is not a disjunction on sequence models but on be...