Results 1  10
of
28
A Compositional Realtime Semantics of STATEMATE Designs
, 1998
"... Introduction This paper presents a reference semantics for a verification tool currently under development allowing to verify temporal properties of embedded control systems modelled using the StateMate system. The semantics reported differs from others reported in the literature [24] by faithfully ..."
Abstract

Cited by 51 (6 self)
 Add to MetaCart
Introduction This paper presents a reference semantics for a verification tool currently under development allowing to verify temporal properties of embedded control systems modelled using the StateMate system. The semantics reported differs from others reported in the literature [24] by faithfully modelling the semantics as supported in the StateMate simulation tool. It differs from the recent paper by Harel and Naamad [8] by providing a compositional semantics, a prerequisite for the support of compositional verification methods, and by the degree of mathematical rigour. We use a variant of synchronous transition systems introduced by Manna and Pnueli [18] as base model for our semantics. The StateMate modelling language constructs covered in this paper are Activity charts , modelling the functional decomposition of a design into subunits called activities
A compositional semantics for UML state machines aimed at performance evaluation
 Proceedings of the 6th International Workshop on Discrete Event Systems
, 2002
"... Unified Modeling Language (UML) is gaining acceptance to describe the behaviour of systems. It has attracted the attention of researchers that are interested in deriving, automatically, performance evaluation models from system’s descriptions. A required step to automatically produce a performance m ..."
Abstract

Cited by 27 (9 self)
 Add to MetaCart
Unified Modeling Language (UML) is gaining acceptance to describe the behaviour of systems. It has attracted the attention of researchers that are interested in deriving, automatically, performance evaluation models from system’s descriptions. A required step to automatically produce a performance model (as any executable model) is that the semantics of the description language is formally defined. Among the UML diagrams, we concentrate on States Machines (SMs) and we build a semantics for a significant subset of them in terms of Generalized Stochastic Petri Nets (GSPNs). The paper shows how to derive an executable GSPN model from a description of a system, expressed as a set of SMs. The semantics is compositional since the executable GSPN model is obtained by composing, using standard Petri net operators, the GSPN models of the single SMs, and each GSPN model is obtained by composition of submodels for SM basic features. 1
Argos: an automatonbased synchronous language
, 2001
"... Argos belongs to the family of synchronous languages, designed for programming reactive systems: (Lustre ..."
Abstract

Cited by 25 (5 self)
 Add to MetaCart
Argos belongs to the family of synchronous languages, designed for programming reactive systems: (Lustre
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...
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 22 (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.
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 17 (10 self)
 Add to MetaCart
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.
Template Semantics for ModelBased Notations
 IEEE TRANSACTIONS ON SOFTWARE ENGINEERING
, 2003
"... We propose a templatebased approach to structuring the semantics of modelbased specification notations. The basic computation model is a nonconcurrent, hierarchical statetransition machine (HTS), whose execution semantics are parameterized. Semantics that are common among notations (e.g., the co ..."
Abstract

Cited by 16 (4 self)
 Add to MetaCart
We propose a templatebased approach to structuring the semantics of modelbased specification notations. The basic computation model is a nonconcurrent, hierarchical statetransition machine (HTS), whose execution semantics are parameterized. Semantics that are common among notations (e.g., the concept of an enabled transition) are captured in the template, and a notation’s distinct semantics (e.g., which states can enable transitions) are specified as parameters. The template semantics of composition operators define how multiple HTSs execute concurrently and how they communicate and synchronize with each other by exchanging events and data. The definitions of these operators use the template parameters to preserve notationspecific behaviour in composition. Our template is sufficient to capture the semantics of basic transition systems, CSP, CCS, basic LOTOS, a subset of SDL88, and a variety of statecharts notations. We believe that a description of a notation’s semantics using our template can be used as input to a tool that automatically generates formal analysis tools.
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.
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...
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 the ..."
Abstract

Cited by 8 (1 self)
 Add to MetaCart
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.