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

Author(s):  
Yessine Kacem ◽  
Adel Mahfoudhi ◽  
Amina Magdich ◽  
Chokri Mraidha ◽  
Walid Karamti
Author(s):  
ZHANQI CUI ◽  
LINZHANG WANG ◽  
XI LIU ◽  
LEI BU ◽  
JIANHUA ZHAO ◽  
...  

Dealing with crosscutting concerns has been a critical problem in software development processes. To facilitate handling crosscutting concerns at design phases, we proposed an aspect-oriented modeling and integration approach with UML activity diagrams. The primary concerns are depicted with UML activity diagrams as primary models, whereas crosscutting concerns are described with aspectual extended activity diagrams as aspect models. Aspect models can be integrated into primary models automatically. The AOM approach can reduce the complexity of design models. However, potential faults that violate desired properties of the software system might still be introduced during the modeling or integration processes. The verification technique is well-known for its ability to assure the correctness of models and uncover design problems before implementation. We propose a framework to verify aspect-oriented UML activity diagrams based on Petri net verification techniques. For verification purpose, we transform the integrated activity diagrams into Petri nets and prove the consistency of the transformation. Then, crosscutting concerns in system requirements are refined to properties in the form of CTL formulas. Finally, the Petri nets are verified against the formalized properties to report whether the aspect-oriented design models satisfies the requirements. Furthermore, we implement a tool named Jasmine-AOV to support the verification process. Case studies are conducted to evaluate the effectiveness of the proposed approach.


2004 ◽  
Vol 29 (1) ◽  
pp. 25-36 ◽  
Author(s):  
Juan Pablo López-Grao ◽  
José Merseguer ◽  
Javier Campos

2014 ◽  
Vol 571-572 ◽  
pp. 528-534
Author(s):  
Chyun Chyi Chen ◽  
Yueh Min Huang

Workflow management has been a hot issue in both academic and industrial research. Deadline assignment is of great significance in workflow management. In order to avoid deadline violation, this paper presents an approach to the schedulability analysis of workflow system modeled in p-time Petri nets by separating timing properties from other behavior properties. The analysis of behavioral properties is conducted based on the reachability graph of the underlying p-Time Petri net, whereas timing constraints are checked in term of absolute and relative firing domains. Our technique is based on a concept called clock-stamped state class (CS-class) and temporal logic. With the reachability graph generated based on CS-class, we can directly compute the end-to-end time delay in workflow execution. We have identified a class of well-structured p-time Petri nets such that their reachability can be easy analyzed and temporal behavior can be easy analyzed by time reachability tree logical.


2011 ◽  
Vol 59 (3) ◽  
pp. 1478-1503 ◽  
Author(s):  
Adel Mahfoudhi ◽  
Yessine Hadj Kacem ◽  
Walid Karamti ◽  
Mohamed Abid

Author(s):  
Juan Pablo López-Grao ◽  
José Merseguer ◽  
Javier Campos

Sign in / Sign up

Export Citation Format

Share Document