An institution for UML 2.0 state machines
The theory of institutions provides an elegant and robust framework for programming in the large and in particular for compositionality. It can be used to define an heterogeneous environment for the semantic definition of UML, consisting of a family of formalisms which capture various UML sublanguag...
Saved in:
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | report |
| Published: |
2011
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/20.500.12008/3454 |
| Tags: |
No Tags, Be the first to tag this record!
|
| Summary: | The theory of institutions provides an elegant and robust framework for programming in the large and in particular for compositionality. It can be used to define an heterogeneous environment for the semantic definition of UML, consisting of a family of formalisms which capture various UML sublanguages, and morphisms that represent the expected semantic relationships between them. In this article we present an institution for UML 2.0 State Machines devised for collaborating with the definition of such environment. The semantics behind the institution is based on a previous work which deals with processing simple input events within a transition step. We also extend this semantics for handling sequences of events, and then for considering runs through the state machine |
|---|