Mehdi Kargahi
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Mehdi Kargahi has a total of 38 co-authors. Here are the top co-authors by number of shared publications:
- Lothar Thiele
ETH Zurich Switzerland
4 shared publications - Mahmoud Shirazi
Department of Computer Science and Information Technology, Institute for Advanced Studies in Basic Sciences (IASBS), Zanjan, Iran
3 shared publications - Fathiyeh Faghih
College of Engineering Department of Electrical and Computer Engineering University of Tehran Tehran Iran
2 shared publications - Iraj Moghaddasi
Department of Computer Engineering, Chosun University, Gwangju, South Korea
2 shared publications - Mehran Alidoost Nia
Faculty of Computer Science and Engineering, Shahid Beheshti University, Tehran, Iran
2 shared publications - Mostafa Ersali Salehi
School of Electrical and Computer Engineering, University of Tehran, Tehran, Iran
2 shared publications
Latest Publications
- Open Access
- 18 March 2025
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Autonomous and Adaptive Systems
- Vol. 20 (1) , 1-45
Efficient Model Verification at Runtime through Adaptive Dynamic Approximation
In dynamic environments, safety-critical autonomous systems must adapt to environmental changes without violating safety requirements. Model verification at runtime supports adaptation through the periodic analysis of continually updated models. A major limitation of the technique is the high overhead associated with the regular analyses of large state-space models. Our article introduces an adaptive approximation strategy that tackles this limitation by delaying unnecessary model updates, significantly reducing the overheads of these analyses. The strategy is applicable to Markov decision processes (MDPs) and is partitioned into components that can be analyzed independently and approximately. Each component is assigned a priority that depends on its impact on the accuracy of verification, and only the highest-priority components affected by changes are scheduled for updating/approximating. A complete update and verification of the entire model is triggered infrequently when the accuracy drops below a predefined threshold. We provide theoretical guarantees and proofs which ensure that our strategy can be applied without impacting the overall safety of the verified autonomous system. The experimental results from a case study in which we applied the strategy to a rescue robot team show that it is fully robust against safety-critical errors and can achieve a decision accuracy of over 97%.
- 18 March 2025
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Autonomous and Adaptive Systems
- Vol. 20 (1) , 1-45
Open AccessEfficient Model Verification at Runtime through Adaptive Dynamic Approximation
In dynamic environments, safety-critical autonomous systems must adapt to environmental changes without violating safety requirements. Model verification at runtime supports adaptation through the periodic analysis of continually updated models. A major limitation of the technique is the high overhead associated with the regular analyses of large state-space models. Our article introduces an adaptive approximation strategy that tackles this limitation by delaying unnecessary model updates, significantly reducing the overheads of these analyses. The strategy is applicable to Markov decision processes (MDPs) and is partitioned into components that can be analyzed independently and approximately. Each component is assigned a priority that depends on its impact on the accuracy of verification, and only the highest-priority components affected by changes are scheduled for updating/approximating. A complete update and verification of the entire model is triggered infrequently when the accuracy drops below a predefined threshold. We provide theoretical guarantees and proofs which ensure that our strategy can be applied without impacting the overall safety of the verified autonomous system. The experimental results from a case study in which we applied the strategy to a rescue robot team show that it is fully robust against safety-critical errors and can achieve a decision accuracy of over 97%.
- 1 December 2024
- Published by Springer Nature in The Journal of Supercomputing
- Vol. 81 (1) , 1-54
Energy-harvesting-aware federated scheduling of parallel real-time tasks
- 1 December 2024
- Published by Springer Nature in The Journal of Supercomputing
- Vol. 81 (1) , 1-54
Energy-harvesting-aware federated scheduling of parallel real-time tasks
- 28 June 2024
- Published by Elsevier in Internet of Things
- Vol. 27
Resource-aware in-edge distributed real-time deep learning
- 28 June 2024
- Published by Elsevier in Internet of Things
- Vol. 27
Resource-aware in-edge distributed real-time deep learning
- Open Access
- 30 April 2024
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Cyber-Physical Systems
- Vol. 8 (2) , 1-19
Control Performance Analysis of Automotive Cyber-physical Systems: A Study on Efficient Formal Verification
Automotive cyber-physical systems consist of multiple control subsystems working under resource limitations, and the trend is to run the corresponding control tasks on a shared platform. The resource requirements of the tasks are usually variable at runtime due to the uncertainties in the environment, necessitating some kinds of adaptation to deal with the resource limitations. Such adaptations may positively or negatively affect the control performance of several subsystems. Since there might be some thresholds on the control performances as quality constraints, this matter should be considered carefully to avoid any quality attribute constraint violation. This article proposes a scalable control performance constraint verification method for such a system that works based on a feedback scheduler. The scalability is the result of a control-aware pruning method. In case of a constraint violation, the designer may change the system configuration and perform re-verification. Our evaluations show that the proposed method scales well while preserving the verification soundness.
- 30 April 2024
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Cyber-Physical Systems
- Vol. 8 (2) , 1-19
Open AccessControl Performance Analysis of Automotive Cyber-physical Systems: A Study on Efficient Formal Verification
Automotive cyber-physical systems consist of multiple control subsystems working under resource limitations, and the trend is to run the corresponding control tasks on a shared platform. The resource requirements of the tasks are usually variable at runtime due to the uncertainties in the environment, necessitating some kinds of adaptation to deal with the resource limitations. Such adaptations may positively or negatively affect the control performance of several subsystems. Since there might be some thresholds on the control performances as quality constraints, this matter should be considered carefully to avoid any quality attribute constraint violation. This article proposes a scalable control performance constraint verification method for such a system that works based on a feedback scheduler. The scalability is the result of a control-aware pruning method. In case of a constraint violation, the designer may change the system configuration and perform re-verification. Our evaluations show that the proposed method scales well while preserving the verification soundness.
- 1 March 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
- Vol. 43 (8) , 2340-2353
Inter-Task Energy-Hotspot Elimination in Fixed-Priority Real-Time Embedded Systems
Multitask real-time embedded systems are often restricted by tight energy budgets, whilst they usually have environmental interactions through software-controlled energy-hungry peripheral modules, such as LTE, WiFi, and GSM. The way that the driver calls are used within the embedded software to do such a control introduces program energy-hotspots (EHs) from the peripheral module perspective, namely, the code pieces wasting the system energy. By the energy waste, we mean that the energy consumption is reducible via some program code modifications without threatening the system schedulability and logical correctness. This article examines the program EHs of fixed-priority real-time tasks where two types of energy inefficiency can occur: 1) intra-task type, causing energy waste even if a task runs individually and 2) inter-task type, happening due to the interaction between different system tasks, namely, preemption scenarios even if there is no intra-task EH. The main cause of such EHs is the unnecessary time intervals between the driver calls, causing extra energy consumption by peripheral modules. We propose some static analysis methods to automatically detect and eliminate both types of intra- and inter-task EHs regarding their mutual relevance, according to the extreme (worst-case and best-case) execution times of certain task code parts. Our manipulations on the tasks to eliminate the EHs include some program code modifications with the awareness of system schedulability and logical correctness, and changing some scheduling decisions, namely, limiting the preemption points. After applying our proposed method to the test tasks, our simulation results show an energy reduction of up to 19%.
- 1 March 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
- Vol. 43 (8) , 2340-2353
Inter-Task Energy-Hotspot Elimination in Fixed-Priority Real-Time Embedded Systems
Multitask real-time embedded systems are often restricted by tight energy budgets, whilst they usually have environmental interactions through software-controlled energy-hungry peripheral modules, such as LTE, WiFi, and GSM. The way that the driver calls are used within the embedded software to do such a control introduces program energy-hotspots (EHs) from the peripheral module perspective, namely, the code pieces wasting the system energy. By the energy waste, we mean that the energy consumption is reducible via some program code modifications without threatening the system schedulability and logical correctness. This article examines the program EHs of fixed-priority real-time tasks where two types of energy inefficiency can occur: 1) intra-task type, causing energy waste even if a task runs individually and 2) inter-task type, happening due to the interaction between different system tasks, namely, preemption scenarios even if there is no intra-task EH. The main cause of such EHs is the unnecessary time intervals between the driver calls, causing extra energy consumption by peripheral modules. We propose some static analysis methods to automatically detect and eliminate both types of intra- and inter-task EHs regarding their mutual relevance, according to the extreme (worst-case and best-case) execution times of certain task code parts. Our manipulations on the tasks to eliminate the EHs include some program code modifications with the awareness of system schedulability and logical correctness, and changing some scheduling decisions, namely, limiting the preemption points. After applying our proposed method to the test tasks, our simulation results show an energy reduction of up to 19%.
- 29 August 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. 72 (1) , 69-81
Energy-Resilient Real-Time Scheduling
Embedded nodes in future cyber-physical systems are mostly self-powered, scavenging their required energy from the environment. The environmental sources of energy are usually variable, so that some prediction methods are employed to proactively adapt to the variable harvesting energy. However, prediction errors may surprise the system with some unpredicted changes, needing appropriate reactions. We consider an energy-harvesting real-time system with periodic tasks of multiple performance levels. An energy-resilient scheduler is proposed for the system to react to the unpredicted changes such that the system is survivable, recovers from such a change in a timely manner, and appropriately controls its performance degradation. After the recovery, however, the energy-resilient scheduler preserves the system survivability and maximizes its performance in a prediction time horizon, while it will be ready for another surprise. We provide some theoretical properties and a feasibility test which are used in the design of the energy-resilient scheduler. Our simulations show that the proposed resilient scheduler outperforms well-known performance maximization methods, effectively approximates the optimal solution, and reacts appropriately against surprises of high severity.
- 29 August 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. 72 (1) , 69-81
Energy-Resilient Real-Time Scheduling
Embedded nodes in future cyber-physical systems are mostly self-powered, scavenging their required energy from the environment. The environmental sources of energy are usually variable, so that some prediction methods are employed to proactively adapt to the variable harvesting energy. However, prediction errors may surprise the system with some unpredicted changes, needing appropriate reactions. We consider an energy-harvesting real-time system with periodic tasks of multiple performance levels. An energy-resilient scheduler is proposed for the system to react to the unpredicted changes such that the system is survivable, recovers from such a change in a timely manner, and appropriately controls its performance degradation. After the recovery, however, the energy-resilient scheduler preserves the system survivability and maximizes its performance in a prediction time horizon, while it will be ready for another surprise. We provide some theoretical properties and a feasibility test which are used in the design of the energy-resilient scheduler. Our simulations show that the proposed resilient scheduler outperforms well-known performance maximization methods, effectively approximates the optimal solution, and reacts appropriately against surprises of high severity.
- 1 February 2020
- Published by Elsevier in Microprocessors and Microsystems
- Vol. 72
Probabilistic approximation of runtime quantitative verification in self-adaptive systems
- 1 February 2020
- Published by Elsevier in Microprocessors and Microsystems
- Vol. 72
Probabilistic approximation of runtime quantitative verification in self-adaptive systems
- 1 January 2020
- Published by Springer Nature in Real-Time Systems
- Vol. 56 (1) , 64-111
Performance maximization of energy-variable self-powered (m, k)-firm real-time systems
- 1 January 2020
- Published by Springer Nature in Real-Time Systems
- Vol. 56 (1) , 64-111
Performance maximization of energy-variable self-powered (m, k)-firm real-time systems
- 12 November 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Very Large Scale Integration (VLSI) Systems
- Vol. 28 (2) , 433-442
Aging-Aware Instruction-Level Statistical Dynamic Timing Analysis for Embedded Processors
- 12 November 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Very Large Scale Integration (VLSI) Systems
- Vol. 28 (2) , 433-442
Aging-Aware Instruction-Level Statistical Dynamic Timing Analysis for Embedded Processors