## Dynamic Meta Modelling: A Graphical Approach to Operational Semantics (1999)

### Cached

### Download Links

- [www.uni-paderborn.de]
- [www.uni-paderborn.de]
- DBLP

### Other Repositories/Bibliography

Venue: | UML 2000 - The Unified Modeling Language. Advancing the Standard, vol. 1939 of LNCS |

Citations: | 52 - 4 self |

### BibTeX

@INPROCEEDINGS{Engels99dynamicmeta,

author = {Gregor Engels and Reiko Heckel and Stefan Sauer},

title = {Dynamic Meta Modelling: A Graphical Approach to Operational Semantics},

booktitle = {UML 2000 - The Unified Modeling Language. Advancing the Standard, vol. 1939 of LNCS},

year = {1999},

pages = {323--337},

publisher = {Springer}

}

### Years of Citing Articles

### OpenURL

### Abstract

The UML meta model [3] captures the abstract syntax...

### Citations

1286 | A structural approach to operational semantics
- Plotkin
- 1981
(Show Context)
Citation Context ...the dynamic (operational) semantics of behavioural diagrams. For dening the operational semantics of process calculi and programming languages, the paradigm of Structural Operational Semantics (SOS) [=-=5]-=- provides powerful techniques and a well-established methodology. The basic idea is to represent the abstract syntax of program states as terms (abstract syntax trees) and to specify, by structural in... |

995 | D.: A calculus of mobile processes, i
- Milner, Parrow, et al.
- 1992
(Show Context)
Citation Context ... states. The set of all such terms (determining the syntax of the language) is given by an algebraic signature (or context free grammar). Below on the left, a fragment of the syntax of the -calculus [=-=4]-=- is shown. Since the term-representation is often too concrete, it is customary to specify structural equivalences on programs, like commutativity of parallel composition P jQ = QjP . The operational ... |

327 |
Handbook of Graph Grammars and Computing by Graph Transformation
- Rozenberg, ed
(Show Context)
Citation Context ...given goal. Despite the graphical notation, the specification is mathematically rigorous since collaboration diagrams are given a formal interpretation based on graph transformation rules (see, e.g., =-=[24, 6, 7]-=- for a recent collection of surveys and [1] for an introductory text) within our approach. In particular, they can be considered as a special form of graphical operational semantics (GOS) rules [4], a... |

99 |
F.: Graph processes
- Corradini, Montanari, et al.
- 1996
(Show Context)
Citation Context ...es (given, e.g., by the values of attributes and links), and their control states. The relation between class and instance diagrams can be formally captured by the concept of type and instance graphs =-=[5]-=-. 1 Given a type graph TG, representing a class diagram, a TG-typed instance graph consists of a graph G together with a typing homomorphism g : G → TG associating to each vertex and edge x of G its t... |

68 |
Formalising uml state machines for model checking
- Paltor, Lilius
- 1999
(Show Context)
Citation Context ...dels, or on automatic verification and reasoning. Reggio et al. [23], for example, use algebraic specification techniques to define the operational semantics of UML state machines. Lillius and Paltor =-=[17]-=- formalize UML state machines in PROMELA, the language of the SPIN model checker. Knapp uses temporal logic [15] for formalizing UML interactions. Övergaard [21] presents a formal meta modeling approa... |

65 | The tile model
- Gadducci, Montanari
- 2000
(Show Context)
Citation Context ...el. The given diagrams are depicted in iconized form with sequential composition and invocation as horizontal and vertical juxtaposition, respectively. This presentation is inspired by the tile model =-=[12]-=-, a generalization of the SOS paradigm [22] towards open (e.g., incomplete) systems. In fact, in our example, such a semantics is required since the model in Fig. 1 is incomplete, i.e., it does not sp... |

59 | Application of graph transformation to visual languages
- Bardohl, Minas, et al.
(Show Context)
Citation Context ...guage. One possible solution is to complement the graph representing the abstract syntax by a spatial relationship graph, and to realize the mapping by a graphical parser specified by a graph grammar =-=[2]-=-.sA related problem is the integration of model execution and animation in existing UML tools. Rather than hard-coding the semantics into the tools, our approach provides the opportunity to allow for ... |

57 | Graph transformation for specification and programming
- Andries, Engels, et al.
- 1999
(Show Context)
Citation Context ...ecification is mathematically rigorous since collaboration diagrams are given a formal interpretation based on graph transformation rules (see, e.g., [24, 6, 7] for a recent collection of surveys and =-=[1]-=- for an introductory text) within our approach. In particular, they can be considered as a special form of graphical operational semantics (GOS) rules [4], a generalization of Plotkin’s structured ope... |

44 | Core Meta-Modelling Semantics of UML: The pUML Approach
- Evans, Kent
- 1999
(Show Context)
Citation Context ...hould be extended to cover a semantically complete kernel of the language which can be used to define more specific, derived modeling concepts. This approach is advocated by the pUML group (see e.g., =-=[9]-=-). Concrete examples how to define such a mapping of concepts include the flattening of statecharts by means of graph transformation rules [13] and the simplification of class diagrams [14] by impleme... |

37 | State Diagrams in UML: A Formal Semantics using Graph Transformations
- Gogolla, Presicce
- 1998
(Show Context)
Citation Context .... This approach is advocated by the pUML group (see e.g., [9]). Concrete examples how to define such a mapping of concepts include the flattening of statecharts by means of graph transformation rules =-=[13]-=- and the simplification of class diagrams [14] by implementing inheritance in terms of associations. Our experience with specifying a small fragment of UML shows that tool support is required for test... |

33 | Richters.Equivalence rules for UML class diagrams
- Gogolla, Mark
- 1998
(Show Context)
Citation Context ... the static meta model). Structural equivalences between abstract syntax graphs can be specied by means of graph transformation rules which, in this case, would have an 1 \equational" interpretat=-=ion [2]-=-. However, the need for such equivalences in operational semantics is less obvious than in the term-based case since graphs, by their very nature, are associative and commutative. (It doesn't matter i... |

31 | Analysing UML active classes and associated state machines – A lightweight formal approach
- Reggio, Astesiano, et al.
- 2000
(Show Context)
Citation Context ...e can be developed among its users. Presently, most approaches to dynamic UML semantics focus on the implementation and simulation of models, or on automatic verification and reasoning. Reggio et al. =-=[23]-=-, for example, use algebraic specification techniques to define the operational semantics of UML state machines. Lillius and Paltor [17] formalize UML state machines in PROMELA, the language of the SP... |

24 |
Story Diagrams: A new Graph Transformation Language based on
- Fischer, Niere, et al.
(Show Context)
Citation Context ...mall fragment of UML shows that tool support is required for testing and animating the specification. While the implementation of flat collaboration diagrams is reasonably well understood (see, e.g., =-=[8, 10]-=-), the animation of the results of an execution on the level of concrete syntax is still under investigation. It requires a well-defined mapping between the concrete and the abstract syntax of the mod... |

18 |
A Formal Semantics for UML Interactions
- Knapp
- 1999
(Show Context)
Citation Context ...echniques to define the operational semantics of UML state machines. Lillius and Paltor [17] formalize UML state machines in PROMELA, the language of the SPIN model checker. Knapp uses temporal logic =-=[15]-=- for formalizing UML interactions. Övergaard [21] presents a formal meta modeling approach which extends static meta modeling with a specification of dynamics by means of a simple object-oriented prog... |

11 | Formal specification of object-oriented meta-modelling
- Övergaard
- 2000
(Show Context)
Citation Context ...UML state machines. Lillius and Paltor [17] formalize UML state machines in PROMELA, the language of the SPIN model checker. Knapp uses temporal logic [15] for formalizing UML interactions. Övergaard =-=[21]-=- presents a formal meta modeling approach which extends static meta modeling with a specification of dynamics by means of a simple object-oriented programming language that is semantically based on th... |

10 | Graphical operational semantics
- Corradini, Heckel, et al.
- 2000
(Show Context)
Citation Context ... 6, 7] for a recent collection of surveys and [1] for an introductory text) within our approach. In particular, they can be considered as a special form of graphical operational semantics (GOS) rules =-=[4]-=-, a generalization of Plotkin’s structured operational semantics (SOS) paradigm for the definition of (textual) programming languages [22] towards graphs. The paper is organized as follows: The approa... |

7 |
UML Collaboration Diagrams and Their Transformation to Java
- Sauer, Wagner
- 1999
(Show Context)
Citation Context ...mall fragment of UML shows that tool support is required for testing and animating the specification. While the implementation of flat collaboration diagrams is reasonably well understood (see, e.g., =-=[8, 10]-=-), the animation of the results of an execution on the level of concrete syntax is still under investigation. It requires a well-defined mapping between the concrete and the abstract syntax of the mod... |

7 |
Single Pushout Transformations of Equationally Defined Graph Structures with Applications to Actor Systems
- Korff
- 1994
(Show Context)
Citation Context ..., we also have to identify the corresponding source and target states. Formally, this effect is achieved by defining the union as a pushout construction in a restricted category of graphs (see, e.g., =-=[16]-=-).sIn Fig. 9 it is outlined how these two composition operators are used to build a collaboration diagram representing a possible run of our sample model. The given diagrams are depicted in iconized f... |

5 |
Relating events, messages and methods of multiple threaded objects
- Breu, Grosu
(Show Context)
Citation Context ...he life cycle description of objects in a statechart diagram has to be related to the messaging mechanisms between interacting objects and the invocation of methods on such objects. A recent solution =-=[3]-=- suggests to model dynamic behavior by state machines and to view methods as private virtual objects to allow for concurrent execution by delegation. In contrast, we propose dynamic meta modeling as a... |

3 |
A view-oriented approach to system modelling using graph transformation
- Engels, Heckel, et al.
- 1997
(Show Context)
Citation Context ...se semantics of graph transformation rules extends the classical interpretation where nothing is supposed to happen during the transformation which is not specied by the rule. It has been applied in [=-=1-=-] in order to capture the dynamic aspects of incomplete views in system specication. Analogous to the term-based case, a graphical SOS rule consists of a set of graph transformation rules (graphical s... |