TRANSFORMING UML DIAGRAMS TO COLOURED PETRI NETS
| dc.contributor.advisor | Janicki, Ryszard | |
| dc.contributor.advisor | Nedialkov, N. S. | |
| dc.contributor.author | Yao, Wenxiang | |
| dc.contributor.department | Computing and Software | en_US |
| dc.date.accessioned | 2025-05-21T19:38:36Z | |
| dc.date.available | 2025-05-21T19:38:36Z | |
| dc.date.issued | 2005-02 | |
| dc.description.abstract | UML is a graphically based language to specify, visualize, construct, and document the requirements of software systems. UML is defined informally. We need a well- defined semantic base for better analysis and application. Place/Transition nets (P/T-nets) and Coloured Petri Nets are two of the most useful languages for modelling of systems containing concurrent processes. P/T-nets axe low-level Petri nets, whose tokens contain very simple information. Coloured Petri Nets (CP-nets) are high-level Petri nets. Each token of CP-nets can carry many attributes. CP-nets have a well-defined semantics allowing formal description. The main purpose of this thesis is to proposed a set of transitions rules, which can transform UML graphs into the Coloured Petri Nets. These rules can be used to describe and analyse concurrent systems. The verification scheme and some examples to support the method axe provided. | en_US |
| dc.description.degree | Master of Applied Science (MASc) | en_US |
| dc.description.degreetype | Thesis | en_US |
| dc.identifier.uri | http://hdl.handle.net/11375/31696 | |
| dc.language.iso | en | en_US |
| dc.subject | UML Diagrams | en_US |
| dc.subject | CP-Nets | en_US |
| dc.subject | P/T-nets | en_US |
| dc.subject | Unified Modelling Language | en_US |
| dc.subject | Coloured Petri Nets | en_US |
| dc.subject | Place/Transition Nets | en_US |
| dc.title | TRANSFORMING UML DIAGRAMS TO COLOURED PETRI NETS | en_US |
| dc.title.alternative | TRANSFORMING UML DIAGRAMS TO CP-NETS | en_US |
| dc.type | Thesis | en_US |