Faisal Alhwikem

Dr. Faisal Alhwikem

Department of Computer Science, College of Computer, Qassim University, Buraydah, Al Qaşīm, Saudi Arabia
orcid

Research Focus & Metrics

Academic Career Length

4Years (2023-Present)

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

Representative Publications

View All Publications
14 September 2023 in IEEE Transactions on Software Engineering
Verified
Journal Article
Closed access
XFXinwei Fang
Xinwei Fang
RCRadu Calinescu
Radu Calinescu
SGSimos Gerasimou
Simos Gerasimou
FAFaisal Alhwikem
Faisal Alhwikem
We present an efficient parametric model checking technique for the analysis of software performability , i.e., of the performance and dependability properties of software systems. The new parametric model checking (pMC) technique works by using a heuristic to automatically decompose a parametric discrete-time Markov chain (pDTMC) model of the software system under verification into fragments that can be analysed independently, yielding results that are then combined to establish the required software performability properties. Our fast parametric model checking (fPMC) technique enables the formal analysis of software systems modelled by pDTMCs that are too complex to be handled by existing pMC methods. Furthermore, for many pDTMCs that state-of-the-art parametric model checkers can analyse, fPMC produces solutions (i.e., algebraic formulae) that are simpler and much faster to evaluate. We show experimentally that adding fPMC to the existing repertoire of pMC methods improves the efficiency of parametric model checking significantly, and extends its applicability to software systems with more complex behaviour than currently possible.

19 March 2026 in Symmetry
Verified
Journal Article
Open access
PDF file
MAMuhammad Azam
Muhammad Azam
DADalal Alhwikem
Dalal Alhwikem
NUNaseer Ullah
Naseer Ullah
FAFaisal Alhwikem
Faisal Alhwikem
This study presents a systematic comparative benchmark between two distinct paradigms for solving nonlinear partial differential equations (PDEs): the data-driven Physics-Informed Neural Networks (PINNs) and the analytical Homotopy Analysis Method (HAM). We apply both methods to a unified family of canonical PDEs, the Burgers, Huxley, Fisher, Burgers–Huxley, and Burgers–Fisher equations, under identical problem setups, domain discretization, and validation metrics. PINNs incorporate physical laws directly into neural network training by minimizing a loss function that enforces PDE residuals, yielding physically consistent solutions even for strongly nonlinear problems. HAM provides approximate analytical solutions using a unified framework, and the same initial guess, auxiliary linear operator, and auxiliary function across all equations despite their distinct nonlinearities. The controlled, consistent application of both methods enables a fair, reproducible comparison across this equation family. The results provide a quantitative performance map under identical conditions, delineating when PINNs (high accuracy, long-term stability, and generalization capability) are preferable, versus when HAM (computational speed, short-term analytic approximation, and lower memory footprint) offers advantages. While the finite radius of convergence of the truncated HAM series is theoretically expected, our controlled comparison quantifies for the first time how this degradation varies across equation types, revealing that the choice between methods depends on specific problem requirements including error tolerance, available computational resources, and temporal horizon. The novelty lies not in solving each equation individually, but in deriving a performance taxonomy that systematically connects equation features (shocks, stiffness, and reaction–diffusion coupling) to optimal solver choice—providing previously unavailable, evidence-based guidance for the scientific computing community. This study establishes the first rigorous, controlled comparative benchmark between analytic and data-driven PDE solvers across a spectrum of nonlinearities, providing a reproducible baseline for future hybrid scientific machine learning solvers.

10 July 2026 in Applied Sciences
Verified
Journal Article
Open access
PDF file
FAFaisal Alhwikem
Faisal Alhwikem
Safety-critical cyber-physical systems require strict verification methodologies explicitly taken to reference safety properties in their tests. Conventional methods of mutation testing simply lump all mutants together, regardless of their effects on product safety, resulting in ineffective resource allocation and insufficient understanding of the behaviors of crucial safety interest. The novel mutation-guided safety assurance framework presented by this paper is called MuGu and it combines mutation testing and formal safety property enforcement. It uses a hierarchical safety constraint analyzer that classifies mutants (temporally) according to their ability to break temporal safety specifications modeled in Signal Temporal Logic (STL). A graph attention network encodes program semantics and control-flow dependencies to forecast the probability of safety violations, enabling effective prioritization of safety-critical mutants. The proposed safety-conscious mutation delineators use vital areas of the code, such as sensor interfaces, actuator commands, and decision-making code in autonomous systems. Extensive testing on two publicly accessible benchmark sets, namely the Software-artifact Infrastructure Repository (SIR) and Defects4J, shows that MuGu achieves 96.3% safe property coverage and requires 71.8% fewer new tests than traditional methods. The scheme determines 2.4 times as many safety-violating methods as state-of-the-art methods and decreases wasted effort on equivalent mutants by 64.2%. The statistical analysis demonstrates overwhelming improvements across all primary metrics in 12 baseline comparisons p<0.001. MuGu provides a rational basis for applying safety-oriented next-generation mutation testing in autonomous systems.

1 January 2026 in Computers, Materials & Continua
Verified
Journal Article
Open access
PDF file
MKManaswi Kulahara
Manaswi Kulahara
KPKhadija Parwez
Khadija Parwez
FAFaisal Alhwikem
Faisal Alhwikem
FJFawwad Hassan Jaskani
Fawwad Hassan Jaskani
Large Language Models (LLMs) have recently advanced in real-world commonsense reasoning, including understanding everyday object behaviors and inferring their attributes from text. However, they remain limited in reasoning about the real-world consequences of events, such as how object failures, obstructions, or structural changes affect the surrounding environment-especially without visual or sensorimotor input. Existing works like PIQA and NEWTON evaluate narrow sub-skills, such as whether an object action makes sense and whether object properties can be inferred, providing valuable benchmarks for commonsense and physical reasoning but offering limited evaluation of how events alter environmental functionality and downstream conditions. To address this gap, we propose Embodied Semantic Grounding (ESG), a framework that equips LLMs with consequence-aware text representations. ESG learns a consequence-grounded space by aligning event descriptions with affordance maps-structured representations of how an environment can be used or traversed after an event-capturing how structural changes modify environmental functionality. A Flan-T5-XL model is trained with a contrastive alignment objective to encode event descriptions into this space, for coherent prediction of consequences such as collapses, blockages, and environmental changes. Rather than introducing a new language-model architecture, ESG extends affordance-grounding with consequence-level representations of post-event environmental functionality. We evaluate ESG on a unified benchmark comprising PIQA, NEWTON, LIBERO-derived affordance text, and 2400 synthetic scenario-based tasks. Results show that ESG improves performance over baseline language models across commonsense reasoning and consequence-prediction benchmarks. Under structured affordance-map supervision, ESG improves zero-shot accuracy on PIQA and NEWTON and demonstrates improved performance on synthetic consequence-prediction scenarios designed to evaluate post-event environmental reasoning.

17 August 2026 in Automated Software Engineering
Verified
Journal Article
Closed access
PDF file
FAFaisal Alhwikem
Faisal Alhwikem

Verified
Journal Article
Open access
PDF file
SASHAFQAT ALI
SHAFQAT ALI
AMAamir Mehmood
Aamir Mehmood
FIFaiza Iftikhar
Faiza Iftikhar
JAJamal Nasser Alotaibi
Jamal Nasser Alotaibi
FAFaisal Alhwikem
Faisal Alhwikem
Arshad AliArshad Ali
Arshad Ali
This study addresses the trajectory tracking control problem for an underactuated hovercraft subject to additive bias and multiplicative loss-of-effectiveness thruster faults under environmental disturbances. In these systems, actuator degradation structurally breaks the differential flatness mapping, driving nominal controllers to generate control actions that induce severe actuator saturation and cause instability. To resolve this challenge, a hierarchical physics-informed neural adaptive control (PINAC) framework is proposed. First, a gated-recurrent-unit physics-informed neural observer (PINO) is designed to isolate thruster faults from exogenous hydrodynamic disturbances. Second, a constrained Safe-TD3 reinforcement learning agent functions as a supervisor, computing an online dilation factor to slow down the mission timeline, thereby reconfiguring the reference trajectory to accommodate degraded actuator boundaries. Third, a low-level non-singular terminal sliding mode (NTSM) controller is implemented as a tracking-guarantee layer. Unlike classical asymptotic schemes where convergence is only achieved as time approaches infinity, or finite-time controllers where the settling time depends on the initial state, the proposed PINAC framework guarantees practical fixed-time stability, ensuring that the settling-time bound is independent of initial conditions. Simulation results demonstrate that the designed controller prevents actuator saturation, provides smooth trajectory adjustment, and reduces tracking errors under severe composite faults.