Formal Transformation from Sequence Diagrams to Coloured Petri Nets

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 ru...

Full description

Saved in:
Bibliographic Details
Main Authors: Bowles, J, Meedeniya, D
Format: Conference Proceeding
Language:English
Subjects:
Analytical models
Color
Coloured Petri Nets
Formal Model Transformation
Language Equivalence
Logic gates
Object oriented modeling
Petri nets
Sequence Diagrams
Stochastic processes
UML2
Unified modeling language
Citations: Items that cite this one
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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 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.
ISSN:1530-1362
2640-0715
DOI:10.1109/APSEC.2010.33