Details
| Original language | English |
|---|---|
| Pages (from-to) | 26-47 |
| Number of pages | 22 |
| Journal | Software and systems modeling |
| Volume | 5 |
| Issue number | 1 |
| Publication status | Published - Apr 2006 |
Abstract
We suggest a framework for UML diagram validation and execution that takes advantage of some of the practical restrictions induced by diagrammatic representations (as compared to Turing equivalent programming languages) by exploiting possible gains in decidability. In particular, within our framework we can prove that an object interaction comes to an end, or that one action is always performed before another. Even more appealingly, we can compute efficiently whether two models are equivalent (aiding in the redesign or refactoring of a model), and what the differences between two models are. The framework employs a simple modelling object language (called MOL) for which we present formal syntax and semantics. A first generation of tools has been implemented that allows us to collect experience with our approach, guiding its further development.
Keywords
- Modelling, Modelling language, UML, Validation of models
ASJC Scopus subject areas
- Computer Science(all)
- Software
- Mathematics(all)
- Modelling and Simulation
Cite this
- Standard
- Harvard
- Apa
- Vancouver
- BibTeX
- RIS
In: Software and systems modeling, Vol. 5, No. 1, 04.2006, p. 26-47.
Research output: Contribution to journal › Article › Research › peer review
}
TY - JOUR
T1 - Exploiting practical limitations of UML diagrams for model validation and execution
AU - Steimann, Friedrich
AU - Vollmer, Heribert
PY - 2006/4
Y1 - 2006/4
N2 - We suggest a framework for UML diagram validation and execution that takes advantage of some of the practical restrictions induced by diagrammatic representations (as compared to Turing equivalent programming languages) by exploiting possible gains in decidability. In particular, within our framework we can prove that an object interaction comes to an end, or that one action is always performed before another. Even more appealingly, we can compute efficiently whether two models are equivalent (aiding in the redesign or refactoring of a model), and what the differences between two models are. The framework employs a simple modelling object language (called MOL) for which we present formal syntax and semantics. A first generation of tools has been implemented that allows us to collect experience with our approach, guiding its further development.
AB - We suggest a framework for UML diagram validation and execution that takes advantage of some of the practical restrictions induced by diagrammatic representations (as compared to Turing equivalent programming languages) by exploiting possible gains in decidability. In particular, within our framework we can prove that an object interaction comes to an end, or that one action is always performed before another. Even more appealingly, we can compute efficiently whether two models are equivalent (aiding in the redesign or refactoring of a model), and what the differences between two models are. The framework employs a simple modelling object language (called MOL) for which we present formal syntax and semantics. A first generation of tools has been implemented that allows us to collect experience with our approach, guiding its further development.
KW - Modelling
KW - Modelling language
KW - UML
KW - Validation of models
UR - http://www.scopus.com/inward/record.url?scp=33645237137&partnerID=8YFLogxK
U2 - 10.1007/s10270-005-0097-y
DO - 10.1007/s10270-005-0097-y
M3 - Article
AN - SCOPUS:33645237137
VL - 5
SP - 26
EP - 47
JO - Software and systems modeling
JF - Software and systems modeling
SN - 1619-1366
IS - 1
ER -