2012 IEEE 19th International Conference and Workshops on Engineering of Computer-Based Systems 2012
DOI: 10.1109/ecbs.2012.6487436
|View full text |Cite
|
Sign up to set email alerts
|

Using MDE and priority time petri nets for the schedulability analysis of embedded systems modeled by UML activity diagrams

Abstract: This paper proposes a model driven approach for the schedulability analysis at an early stage of the embedded system development life-cycle. The activity diagram of Unified Modeling Language (UML) annotated with the profile for the Modeling and Analysis of Real-Time and Embedded systems (MARTE) is mapped into Priority Time Petri Net (PTPN) to enhance formal schedulability test of given real time tasks. The generated PTPN model is interpreted and executed to check whether a schedule of a task execution meets th… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
5
0

Year Published

2012
2012
2020
2020

Publication Types

Select...
5
2
1

Relationship

0
8

Authors

Journals

citations
Cited by 8 publications
(5 citation statements)
references
References 14 publications
0
5
0
Order By: Relevance
“…At this level, a preliminary transformation of the workload model to NCES formalism is required to enhance formal analysis. In this paper, the mapping of end-to-end flow into formal models is inspired from previously published works (Kacem et al, 2012) (Yang et al, 2010). Therefore, each end-to-end scenario is represented with an oriented graph of places and transitions.…”
Section: Mapping Workload Behavior To Ncesmentioning
confidence: 99%
“…At this level, a preliminary transformation of the workload model to NCES formalism is required to enhance formal analysis. In this paper, the mapping of end-to-end flow into formal models is inspired from previously published works (Kacem et al, 2012) (Yang et al, 2010). Therefore, each end-to-end scenario is represented with an oriented graph of places and transitions.…”
Section: Mapping Workload Behavior To Ncesmentioning
confidence: 99%
“…The improvement works make the model checking method capable of being used in RTES. For example, the work [32] presented a flexible analysis method for the worst-case execution time (WCET) using UML-MARTE Model Checker, which was aimed at detecting the wrong software designs and refining the correct ones with respect to the WCET; The work [33] mapped the UML activity diagram into the priority time petri net (PTPN) to enhance the formal schedulability test; The work [34] mapped the workload model of the real-time systems into a Petri Nets to perform the P-invariant method to generate all transactions. However, the model checking method needs to specify the policy-dedicated rules throughout the task model for the case in this paper, which makes it inflexible for analyzing the variability.…”
Section: B Timing Analysis Of the Rtes 1) Dynamic Approachmentioning
confidence: 99%
“…When used in our case, the simulation-based methods need a model transformation (or refinement) for each alternative policy, which is inflexible. For the model checking, the work [13] presented an analysis method for the worst-case execution time (WCET) using UML-MARTE model checker, which was aimed at detecting wrong software designs and refined the correct ones with respect to WCET; the work [14] mapped the activity diagram of UML into the priority time Petri net (PTPN) to enhance the formal schedulability test of given real-time tasks; The work [15] mapped the workload model of real-time systems into a Petri Nets formalism to generate all transactions for the timing analysis. However, as for our case, the model checking method needs to specify the policy-dedicated rules throughout the task model, which is flexible or even impossible.…”
Section: Related Workmentioning
confidence: 99%
“…If the task is executable, we visit the functional block child-node (say fb) of the root node, then visit the functional block child-node (say fb') of fb, then visit the functional block child-node of fb', ..., until all functional block nodes are visited (L. 20). For each functional block node, we check its execution condition and analyze its time cost based on the operation node (if exists) and the parameter node (the analysis procedure will be introduced later), then update the time cost of the root node (L. [14][15][16]. When all the functional block nodes are visited, the task is set as completely traversed, the time cost on the root node indicates the response time of the task.…”
Section: B Timing Analysis For Etatmentioning
confidence: 99%