Abstract
In this paper we define a formal strongly
consistent transformation from UML2 sequence diagrams
to coloured Petri nets (CPNs). We define the language of
sequence diagrams (set of legal traces) and show how this is
mapped onto an equivalent language of CPNs through formal
transformation rules. The rules defined can be extended to model from a sequence diagram model showing that the consider modelling aspects such as stochastic and real-time
behaviour. This work is part of a more general framework
based on model driven transformations to validate UML
models using Petri nets, and hence exploit existing Petri net
analysis and verification tools for UML-based design.
consistent transformation from UML2 sequence diagrams
to coloured Petri nets (CPNs). We define the language of
sequence diagrams (set of legal traces) and show how this is
mapped onto an equivalent language of CPNs through formal
transformation rules. The rules defined can be extended to model from a sequence diagram model showing that the consider modelling aspects such as stochastic and real-time
behaviour. This work is part of a more general framework
based on model driven transformations to validate UML
models using Petri nets, and hence exploit existing Petri net
analysis and verification tools for UML-based design.
| Original language | English |
|---|---|
| Title of host publication | 2010 17th Asia Pacific Software Engineering Conference (APSEC) |
| Publisher | IEEE Computer Society |
| Pages | 216-225 |
| Number of pages | 10 |
| ISBN (Electronic) | 978-0-7695-4266-9 |
| ISBN (Print) | 978-1-4244-8831-5 |
| DOIs | |
| Publication status | Published - 2010 |