| |
«UML» 2001 — The Unified Modeling Language. Modeling Languages, Concepts, and Tools (2001), pp. 406-421.
Abstract
The Unified Modeling Language (UML) has gained wide acceptance in very short time because of its variety of well-known and intuitive graphical notations. However, this comes at the prize 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 UML-Statecharts. Starting with a precise textual syntax definition, we develop quite a concise structured operational semantics (SOS) for UML-Statecharts based on ...
|
| |
CONCUR’99 Concurrency Theory (1999), pp. 782-782.
Abstract
Statecharts is a visual language for specifying the behavior of reactive systems. The language extends finite-state machines with concepts of hierarchy, concurrency, and priority. Despite its popularity as a 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 structure-preserving and semanticspreserving manner. We also establish that the behavioral equivalence bisimulation, when applied to SPL, ...
|
| |
Integrated Formal Methods (2000a), pp. 255-276.
Abstract
In this paper we show, by a series of examples, how the μ- chart formalism can be translated into Z. We give reasons for why this is an interesting and sensible thing to do and what it might be used for. ...
|
| |
Formal Methods: Applications and Technology (2007), pp. 244-260.
Abstract
UML has become the standard modeling language for object-oriented systems. The informal description of UML and its continuous extension cause many ambiguities. Therefore, a formal semantics for UML is necessary, especially for formal reasoning and tool development. We present a formal semantics of UML 2.0 state machines, which are used for modeling the reactive behavior of objects, by (i) deriving core state machines with fewer design features and a precise syntax, (ii) developing a formal semantics for core state machines, and ...
|
| |
Software and Systems Modeling, Vol. 6, No. 4. (21 December 2007), pp. 415-435.
Abstract
Abstract State machines, represented by statecharts or state machine diagrams, are an important formalism for behavioural modelling. According to the research literature, the most popular statechart formalisms appear to be Classical, UML, and that implemented by Rhapsody. These three formalisms seem to be very similar; however, there are several key syntactic and semantic differences. These differences are enough that a model written in one formalism could be ill-formed in another formalism. Worse, a model from one formalism might actually be well-formed in ...
|
| |
Software and Systems Modeling, Vol. V3, No. 2. (1 May 2004), pp. 150-163.
Abstract
In this article we present a method for describing the language of UML statecharts. Statecharts are syntactically defined as attributed graphs, with well-formedness rules specified by a set of first-order predicates over the abstract syntax of the graphs. The dynamic semantics of statecharts is defined by Abstract State Machines parameterized with syntactically-correct attributed graphs. The presented approach covers many important constructs of UML statecharts, including internal, completion, interlevel and compound transitions as well as history pseudostates. It also contains strategies to ...
|
| |
Lecture Notes in Computer Science : TAPSOFT '95: Theory and Practice of Software Development (1995), pp. 454-468.
|
| |
Software and Systems Modeling, Vol. 1, No. 2. (24 December 2002), pp. 130-141.
Abstract
Abstract. The Unified Modeling Language (UML) has gained wide acceptance in very short time because of its variety of well-known 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 UML-statecharts. Starting with a precise textual syntax definition, we develop a precise structured operational semantics (SOS) for UML-statecharts. Besides the ...
|
| |
Computer-Aided Design of Integrated Circuits and Systems, IEEE Transactions on, Vol. 18, No. 6. (1999), pp. 742-760.
Abstract
This paper studies the semantics of hierarchical finite state machines (FSM's) that are composed using various concurrency models, particularly dataflow, discrete-events, and synchronous/reactive modeling. It is argued that all three combinations are useful, and that the concurrency model can be selected independently of the decision to use hierarchical FSM's. In contrast, most formalisms that combine FSM's with concurrency models, such as statecharts (and its variants) and hybrid systems, tightly integrate the FSM semantics with the concurrency semantics. An implementation that supports ...
|
| |
Real-Time Systems, Vol. 32, No. 1-2. (February 2006), pp. 105-123.
|
| |
Software Engineering Conference, 2000. APSEC 2000. Proceedings. Seventh Asia-Pacific (2000), pp. 258-263.
Abstract
μ-Charts are a way of specifying reactive systems, i.e. systems which are in some environment to which they have to react, based on the well-established formalism Statecharts. This paper gives (very abbreviated) examples of translating μ-charts to Z, which is itself a well-established language for specifying computational systems with tried and tested methods and support tools which guide its effective use in systems development. We undertake this translation in order that investigation of the modelled system can be performed before expensive ...
|
Search
Search
