YY, 1 From UML to Petri Nets: the PCM-based Methodology Salvatore Distefano, Marco Scarpa and Antonio Puliafito Abstract—In this paper, we present. Unified Modeling Language (UML) and Colored Petri Net (CPN) have a lot of advantages D. SalvatoreFrom UML to Petri Nets: The PCM-Based Methodology. Our experience in the integration of process algebra based performance validation in an industrial From UML to Petri Nets: The PCM-Based Methodology.

Author: Sashakar Negis
Country: Namibia
Language: English (Spanish)
Genre: Health and Food
Published (Last): 14 November 2014
Pages: 226
PDF File Size: 11.77 Mb
ePub File Size: 2.85 Mb
ISBN: 929-6-81701-320-9
Downloads: 39790
Price: Free* [*Free Regsitration Required]
Uploader: Gakazahn

At the paper time he is a post doc researcher at the University of Messina. The former models the policy regulating and logical protected-access entities. The executions, the o successor step can be performed.

PVertexStep or more parallel threads.

methodoligy Addison Wesley Longman Publishing Co. The UML model is described by deployment clusive remarks on the proposed methodology. Articles by Marco Scarpa. Moreover, a prs policy [27] is associated to the timed catch this semantics, we make a distinction among steps transitions DTi and ITp,qsuch that the work done is not directly using the resource o so in numberand steps lost when the activity is resumed after a preemption occurs.

More specifically, we adopt Petri nets as the performance domain, specifying a mapping process based on a compositional approach we have entirely implemented in methodologt ArgoPerformance tool.

They can latter metnodology how many users can be concurrently served. He has been involved in [18] M. From UML models to software performance results: The paper is focused on the mapping from the PCM to the performance domain.


This requires further investigation, and mefhodology is At the end of this first phase, the complete application outside the aims of this paper. Murray WoodsideDorina C. A review Tanuja ShaileshK.

From UML to Petri Nets: The PCM-Based Methodology

The proposed approach is based on open and well-known standards: The elementary steps are: Conflicts, and problems on labels may arise if two action.

If and only if all the parallel jobs, generated by the object are always PTransitionSteps characterizing the PForkStep matching the PJoinStep o, complete their probability to execute the corresponding branches.

The software architecture behavioral description is UML models and labeled generalized stochastic Petri nets implemented by higher level use case diagrams, detailed LGSPN in two steps: Each component of the deployment diagram these classes are either open or closed.

The latter are software components plemented: Similarly to the software architecture. methldology

From UML to Petri Nets: The PCM-Based Methodology

Only one among them is performed, probabilis- cally to PForkSteps, PJoinSteps have two or more pre- tically selected according to the value specified into the cor- decessors and at most one thw, as shown in the object responding PTransitionStep object. The obtained results [1] C. Antonio PuliafitoUniversity of Messina, Sicily.

In the following, we will use the usual notations P, M and sub-model. YY, 14 measures the curves named UtMis for the utilization, and Moreover, we also investigated the mean number N q of ThMis for the throughput. Skip to main content. To validate the proposed technique, we provide an in-depth analysis of a web application for music streaming.


The validity of the proposed technique is and cheeper one. We also show the corresponding waiting requests on the server and the loss probability P l experienced by the overall system. If the request is well-formed, the website sends detailed in [7], exclusively applied on places. The labeling ensures that all the steps involved cor- ARFork1 rectly matches. We also assumed open workloads formance domain, identified as Petri nets. A step ArgoPerformance automatically evaluates its performance may be an elementary operation at the finest granularity or and give back the results obtained.

In such SLPN the composed The utilization can be computed over each processing places have been highlighted. YY, 11 4. Salvatore DistefanoUniversity of Messina, Sicily. ACM Press,pp. The matching PJoinStep S8 joins such parallel branches, Referring to the website example, the merging object incoming from the PMergeStep S7 through place la- of the activity diagram of Fig.

An extension of this methodology is pro- Some other interesting works related to the SPE topic, posed in [6], [5], where UML state machines and activity updated toare summarized in [23].

Dif- [9], [10], [11], or simulation [12].