Ahmed Bouzenada

Dr. Ahmed Bouzenada

Université Constantine 2, Constantine, Algeria
orcid

Research Focus & Metrics

Academic Career Length

5Years (2022-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 September 2025 in World Electric Vehicle Journal
Verified
Journal Article
Open access
PDF file
ANAbir Nemouchi
Abir Nemouchi
Ahmed BouzenadaAhmed Bouzenada
Ahmed Bouzenada
DSDjamel Eddine Saïdouni
Djamel Eddine Saïdouni
GDGregorio Diaz-Descalzo
Gregorio Diaz-Descalzo
The increasing integration of autonomous electric vehicles (EVs) into Intelligent Transportation Systems (ITSs) needs rigorous mechanisms to ensure their safe and effective operation in dynamic environments. The reliability of such vehicles depends not only on their internal capabilities but also on the suitability and safety of the environments in which they operate. This paper introduces a formal modelling framework that captures independently the dynamic evolution of the environmental context and the EV agent using multi-parameter transition systems. Two distinct models are defined: the Context Transition System (CTS), which models changes in environmental states, and the Agent Transition System (ATS), which captures the internal state evolution of the EV. Safety and liveness properties are formally specified in Computation Tree Logic (CTL) and verified using the nuXmv model checker. The framework is validated through two representative use cases: a dynamic urban delivery zone and an autonomous electric delivery vehicle. The results highlight the framework’s effectiveness in detecting unsafe conditions, verifying mission objectives, and supporting the reliable deployment of EVs in ITS.

20 December 2024 in Mathematics
Verified
Journal Article
Open access
PDF file
Ahmed BouzenadaAhmed Bouzenada
Ahmed Bouzenada
DSDjamel Eddine Saïdouni
Djamel Eddine Saïdouni
GDGregorio Diaz-Descalzo
Gregorio Diaz-Descalzo
Durational action timed automata (daTAs) are state transition systems like timed automata (TAs) that capture information regarding the concurrent execution of actions and their durations using maximality-based semantics. As the underlying semantics of daTAs are infinite due to the modeling of time progress, conventional model checking techniques become impractical for systems specified using daTAs. Therefore, a finite abstract representation of daTA behavior is required to enable model checking for such system specifications. For that, we propose a finite abstraction of the underlying semantics of a daTA-like region abstraction of timed automata. In addition, we highlight the unique benefits of daTAs by illustrating that they enable the verification of properties concerning concurrency and action duration that cannot be verified using the traditional TA model. We demonstrate mathematically that the number of states in durational action timed automata becomes significantly smaller than the number of states in timed automata as the number of actions increases, confirming the efficiency of daTAs in modeling behavior with action durations.