Time Petri Nets with Action Duration

Belala, Nabil; Saïdouni, Djamel Eddine; Boukharrou, Radja; Chaouche, Ahmed-Chawki; Seraoui, A.; Chachoua, Amina

doi:10.4018/jertcs.2013040104

Cited by 12 publications

(6 citation statements)

References 19 publications

(33 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The Unified Modeling Language (UML) (Booch, Rumbaugh, & Jacobson, 1999) has become a widelyacceptedstandardinthesoftwaredevelopmentindustry.Somediagramsareusedtomodel thestructureofasystemwhileothersareusedtomodelthebehaviorofasystem.TheTimePetri Nets with Action Duration (DTPN) model (Belala et al,2013) supports at the same time timing constraints and actions duration based on maximality semantics (Saїdouni,D.E, Belala, Bouneb, Boudjadar,&Ouchenne,2008).…”

Section: Time Petri Nets With Action Duration (Dtpn)mentioning

confidence: 99%

A Graph Transformation Approach for Modeling UML Diagrams

Hachichi

2022

International Journal of Systems and Service-Oriented Engineering

View full text Add to dashboard Cite

This article proposes an approach for transforming UML Statecharts, Sequence Diagrams and activity Diagrams to Time Petri Nets with Action Duration (DTPN) using graph transformation. By this transformation the author aims to bridge the gap between semi-formal models generated by UML and formal models DTPN. UML is considered to be the standardized language for modelling and describing systems behaviors for analysis. In other hand, DTPN models are tools for the specification and performance analysis of distributed and concurrent systems. However, the proposed approach allows to generate automatically a visual modeling tool for DTPN. The cost of building a visual modeling tool from scratch is prohibitive. Meta-modeling approach is useful to deal with this problem since it allows the modeling of the formalisms themselves, by means of graph grammars. The meta-modeling tool AToM3 is used.

show abstract

Section: Time Petri Nets With Action Duration (Dtpn)mentioning

confidence: 99%

A Graph Transformation Approach for Modeling UML Diagrams

Hachichi

2022

International Journal of Systems and Service-Oriented Engineering

View full text Add to dashboard Cite

show abstract

“…To investigate the verification and validation of real time embedded systems, we opt for the operational semantics developed in [20] to generate a semantics model to DTPN specification. The true-concurrency semantics based DTPN model is used to obtain the durational action Timed Automata (daTA) depicted in Figure 28.…”

Section: Verificationmentioning

confidence: 99%

“…In our proposed approach, Time Petri Nets with action Duration (DTPN) specification model is used as a semantics model of MARTE SD specification [20]. In fact, DTPN has a true concurrency semantics and considers both timing constraints and duration of actions.…”

Section: Introductionmentioning

confidence: 99%

Formal Verification of UML MARTE Specifications Based on a True Concurrency Real Time Model

Chabbat

Saïdouni

Boukharrou

et al. 2020

cai

View full text Add to dashboard Cite

For critical embedded systems the formal validation and verification is required. However, the real-time model checking suffers from problems of statespace explosion and clock explosion. The aim of this paper is to ensure an improvement of the Modeling and Analysis of Real-Time Embedded systems (MARTE), which is de facto standard, with formal semantics for verification finality. Therefore, we propose an operational method for translating UML sequence diagrams with MARTE annotations to Time Petri nets with Action Duration specifications (DTPN). Based on true concurrency semantics, the semantics of these specifications are defined in terms of Duration Action Timed Automata (daTA).

show abstract

“…In the literature, the durational actions Timed Automata model (daTA) was proposed in the respect of those requirements, (Saidouni & Belala, 2006;Kitouni et al, 2012;Belala et al, 2013) they are a form of timed automata that admit a more natural representation of action durations and advocates carrying true concurrency. It's based on maximality semantics (Saidouni et al, 2008).…”

Section: Introductionmentioning

confidence: 99%

“…A nice characterization of the model was presented in (Kitouni et al, 2012) concerning determinizability and decidability of the model. More recently, daTA is defined as a semantic support of temporally timed Petri nets (Belala et al, 2013).…”

Section: Introductionmentioning

confidence: 99%

True Concurrency Semantics

Guellati

Kitouni

Matmat

et al. 2014

International Journal of Embedded and Real-Time Communication Systems

View full text Add to dashboard Cite

The model checking algorithms have been widely studied for timed automata, it's a validation technique for automatically verifying correctness properties of finite-state systems, which are based on interleaving semantics. Therefore the actions are assumed instantaneous. To overcome the hypothesis of temporal and structural atomicity of actions, we use the durational actions timed automata model (daTA). This model is based on the maximality semantics. Properties to be verified are expressed using the Timed Computation Tree Logic (TCTL). For dealing with formal verification, the Maximality-based Region Graph (MRG) is defined and an adaptation of the model checking algorithm is proposed. The use of the maximality semantics based verification provides new class of properties related to simultaneous progress of actions at different states.

show abstract

Time Petri Nets with Action Duration

Cited by 12 publications

References 19 publications

A Graph Transformation Approach for Modeling UML Diagrams

A Graph Transformation Approach for Modeling UML Diagrams

Formal Verification of UML MARTE Specifications Based on a True Concurrency Real Time Model

True Concurrency Semantics

Contact Info

Product

Resources

About