Results 1  10
of
20
A structured operational semantics for UMLstatecharts
, 2002
"... The Unified Modeling Language (UML) has gained wide acceptance in very short time because of its variety of wellknown and intuitive graphical notations. However, this comes at the price of an unprecise and incomplete semantics definition. This insufficiency concerns single UML diagram notations on ..."
Abstract

Cited by 32 (0 self)
 Add to MetaCart
The Unified Modeling Language (UML) has gained wide acceptance in very short time because of its variety of wellknown and intuitive graphical notations. However, this comes at the price of an unprecise and incomplete semantics definition. This insufficiency concerns single UML diagram notations on their own as well as their integration. In this paper, we focus on the notation of UMLstatecharts. Starting with a precise textual syntax definition, we develop a precise structured operational semantics (SOS) for UMLstatecharts. Besides the support of interlevel transitions and in contrast to related work, our semantics definition supports characteristic UMLstatechart features like the history mechanism as well as entry and exit actions.
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 29 (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 Semantics of UML State Machines
, 1999
"... The paper discusses a complete formalisation of UML state machine semantics. This formalisation is given in terms of an operational semantics and it can be used as the basis for code generation, simulation and verification tools for UML Statecharts diagrams. The formalisation is done in two steps. F ..."
Abstract

Cited by 28 (3 self)
 Add to MetaCart
The paper discusses a complete formalisation of UML state machine semantics. This formalisation is given in terms of an operational semantics and it can be used as the basis for code generation, simulation and verification tools for UML Statecharts diagrams. The formalisation is done in two steps. First, the structure of a UML state machine is translated into a term rewriting system. In the second step, the operational semantics of state machines is defined. In addition, some problematic situations that may arise are discussed. Our formalisation is able to deal with all the features of UML state machines and it has been implemented in the vUML tool, a tool for modelchecking UML models.
Statecharts Via Process Algebra
 IN CONCUR '99, VOL. 1664 OF LNCS
, 1999
"... Statecharts is a visual language for specifying the behavior of reactive systems. The language extends finitestate machines with concepts of hierarchy, concurrency, and priority. Despite its popularityasa design notation for embedded systems, precisely defining its semantics has proved extremel ..."
Abstract

Cited by 23 (12 self)
 Add to MetaCart
(Show Context)
Statecharts is a visual language for specifying the behavior of reactive systems. The language extends finitestate machines with concepts of hierarchy, concurrency, and priority. Despite its popularityasa design notation for embedded systems, precisely defining its semantics has proved extremely challenging. In this paper, we present a simple process algebra, called Statecharts Process Language (SPL), which is expressive enough for encoding Statecharts in a structurepreserving and semanticspreserving manner. We also establish that the behavioral equivalence bisimulation, when applied to SPL, preserves Statecharts semantics.
Statecharts: From Visual Syntax to ModelTheoretic Semantics
 AUSTRIAN COMPUTER SOCIETY
, 2001
"... This paper presents a novel modeltheoretic account of Harel, Pnueli and Shalev's original step semantics of the visual specification language Statecharts. The graphical syntax of a Statechart is read, directly and structurally, as a formula in propositional logic. This proposition captures all ..."
Abstract

Cited by 13 (4 self)
 Add to MetaCart
(Show Context)
This paper presents a novel modeltheoretic account of Harel, Pnueli and Shalev's original step semantics of the visual specification language Statecharts. The graphical syntax of a Statechart is read, directly and structurally, as a formula in propositional logic. This proposition captures all the logical constraints imposed by the diagram on the Statechart's semantics, i.e., the possible sets of transitions that can be taken together to perform a valid Statecharts step, and their effects on Statecharts configurations. The paper's main result shows that the correct semantics is uniquely described by the intuitionistic interpretation of Statecharts formulas, whereas the naive classical interpretation is insufficient. The advocated intuitionistic approach not only gives a correct, clear and direct logical account of Statecharts' semantics, but also permits the integration of Statecharts with formal validation tools, such as theorem provers.
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 13 (6 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...
A Process Language for Statecharts
 IN PROCEEDINGS OF LOMAPS'96, SPRINGER LNCS VOL 1192
, 1996
"... We define a compositional labelled transition system semantics for statecharts via a translation into a new process language called SP. The main novelty of the language is an operator of process refinement, which reflects the statecharts hierarchical structure. The translation agrees with Pnueli a ..."
Abstract

Cited by 8 (2 self)
 Add to MetaCart
We define a compositional labelled transition system semantics for statecharts via a translation into a new process language called SP. The main novelty of the language is an operator of process refinement, which reflects the statecharts hierarchical structure. The translation agrees with Pnueli and Shalev semantics of statecharts. However, since the language is parametric in the set of basic actions and in some operations over actions, other semantics of statecharts can be obtained by suitably instantiating the actions corresponding to transitions and the operations over actions.
Müller: Transformation of UML StateMachines for Direct Execution
 In Proc. 2005 IEEE Symposium on Visual Languages and HumanCentric Computing (VL/HCC'05
, 2005
"... Executable UML models are nowadays gaining interest in embedded systems design. This domain is strongly devoted to the modeling of reactive behavior using StateChart variants. In this context, the direct execution of UML State Machines is an interesting alternative to native code generation approach ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
(Show Context)
Executable UML models are nowadays gaining interest in embedded systems design. This domain is strongly devoted to the modeling of reactive behavior using StateChart variants. In this context, the direct execution of UML State Machines is an interesting alternative to native code generation approaches since it significantly increases portability. However, fully featured UML 2.0 State Machines may contain a broad set of features with complex execution semantics that differ significantly from other StateChart variants. This makes their direct execution complex and inefficient. In this paper, we demonstrate how such State Machines can be represented using a small subset of the UML State Machine features that enables efficient execution. We describe the necessary model transformations in terms of graph transformations and discuss the underlying semantics and implications for execution. 1.
A Concise Compositional Statecharts Semantics Definition
 In FORTE/PSTV
, 2000
"... Statecharts is a wellknown specification language for modeling system behavior. Its intuitive graphical appeal for specifying hierarchical, concurrent state machines conceals the difficulties in formalizing its semantics. The causes are in Statecharts' twolevel semantics when demanding compos ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
(Show Context)
Statecharts is a wellknown specification language for modeling system behavior. Its intuitive graphical appeal for specifying hierarchical, concurrent state machines conceals the difficulties in formalizing its semantics. The causes are in Statecharts' twolevel semantics when demanding compositionality, as is necessary in order to obtain easy comprehensibility and modularity of system specifications. This paper suggests a compositional approach for formalizing the Statecharts semantics directly on sequences of micro steps using labeled transition systems as semantical domain. Though we consider causality, global consistency, as well as the synchrony hypothesis, our approach results in a very short and concise semantics definition of Statecharts.