An Execution Algorithm for UML Activity Graphs


Share/Save/Bookmark

Eshuis, Rik and Wieringa, Roel (2001) An Execution Algorithm for UML Activity Graphs. In: 4th International Conference on The Unified Modeling Language, October 1-5, 2001, Toronto, Canada (pp. pp. 47-61).

[img] PDF
Restricted to UT campus only
: Request a copy
192kB
Abstract:We present a real-time execution semantics for UML activity graphs that is intended for workflow modelling. The semantics is defined in terms of execution algorithms that define how components of a workflow system execute an activity graph. The semantics stays close to the semantics of UML state machines, but differs from it in some minor points. Our semantics deals with real time. The semantics provides a basis for verification of UML activity graphs, for example using model checking, and also for executing UML activity graphs using simulation tools. We illustrate an execution by means of a small example.
Item Type:Conference or Workshop Item
Copyright:© 2001 Springer
Faculty:
Electrical Engineering, Mathematics and Computer Science (EEMCS)
Research Group:
Link to this item:http://purl.utwente.nl/publications/61809
Official URL:http://dx.doi.org/10.1007/3-540-45441-1_5
Export this item as:BibTeX
EndNote
HTML Citation
Reference Manager

 

Repository Staff Only: item control page

Metis ID: 204959