Some Rules to Transform Activity Diagrams into Colored Petri Nets
Bhawana Agarwal

Bhawana Agarwal, M. Tech. Scholar, Department of Computer Science, Mewar University, Chittorgarh, India.
Manuscript received on 18 November 2012 | Revised Manuscript received on 25 November 2012 | Manuscript published on 30 November 2012 | PP: 51-56 | Volume-1 Issue-5, November 2012 | Retrieval Number: E0366101512/2012©BEIESP
Open Access | Ethics and Policies | Cite | Mendeley | Indexing and Abstracting
© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC-BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)

Abstract: This paper presents a set of rules that allows software engineers to transform the behavior described by a UML 2.0 Activity Diagram (AD) into a Colored Petri Net (CPN). ADs in UML 2.0 are much richer than in UML 1.x, namely by allowing several traces to be combined in a unique diagram, using high-level operators over interactions. The main purpose of the transformation to Petri nets is to use the theoretical results in the Petri nets domain to analyze the equivalent Petri nets and infer properties of the original workflow. Thus, non-technical stakeholders are able to discuss and validate the captured requirements. The usage of this model is an important topic , since it permits the user to discuss the system behavior using the problem domain language. A small control application from industry is used to show the applicability of the suggested rules.
Keywords: Activity Diagram, Petri Nets, Colored Petri Nets, Verification and Validation.

Scope of the Article: Aggregation, Integration, and Transformation