Ernest Bonnah
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
Ernest Bonnah has a total of 6 co-authors. Here are the top co-authors by number of shared publications:
- Khaza Anuarul Hoque
University of Missouri-Columbia, Columbia, Missouri, USA
5 shared publications - Luan Viet Nguyen
University of Dayton
4 shared publications - Paapa Quansah
Baylor University
1 shared publication - Shiguang Ju
Jiangsu University
1 shared publication - Shiguang Ju
Sch. of Comput. Sci. & Telecommun. Eng., Jiangsu Univ., Zhenjiang
1 shared publication Wenpeng Cai
Jiangsu University
1 shared publication
Latest Publications
- 11 June 2026
- Published by Springer Nature
- p. 56-73
NeuroNL2LTL: A Neurosymbolic Framework for Natural Language Translation of Linear Temporal Logic
- 11 June 2026
- Published by Springer Nature
- p. 56-73
NeuroNL2LTL: A Neurosymbolic Framework for Natural Language Translation of Linear Temporal Logic
- Open Access
- 28 September 2025
- Published by Association for Computing Machinery (ACM)
- p. 57-61
Hyperproperty-Constrained Secure Reinforcement Learning
- 28 September 2025
- Published by Association for Computing Machinery (ACM)
- p. 57-61
Open AccessHyperproperty-Constrained Secure Reinforcement Learning
- 29 November 2024
- Published by Springer Nature
- p. 332-352
Efficient SMT-Based Model Checking for HyperTWTL
- 29 November 2024
- Published by Springer Nature
- p. 332-352
Efficient SMT-Based Model Checking for HyperTWTL
- Open Access
- 21 September 2023
- Published by Association for Computing Machinery (ACM)
- p. 90-99
QTWTL: Quality Aware Time Window Temporal Logic for Performance Monitoring
In various service-oriented applications such as distributed autonomous delivery, healthcare, tourism, transportation, and many others, where service agents need to perform serial and time-bounded tasks to achieve their goals, quality of service must constantly be assured. In addition to safety requirements, such agents also need to fulfill performance requirements in order to satisfy their quality of service. This paper proposes the novel quality-aware time window temporal logic (QTWTL) by extending the traditional time window temporal logic (TWTL) with two operators for counting and aggregation operations. We also propose offline runtime monitoring algorithms for the performance monitoring of QTWTL specifications. To analyze the feasibility and efficiency of our proposed approach, we generate a large number of traces using the New York City Taxi and Limousine Commission Trip Record data, formalize their performance requirements using QTWTL, and monitor them using the proposed algorithms. The obtained results show that the monitoring algorithm has a linear space and time complexity with respect to the number of traces monitored.
- 21 September 2023
- Published by Association for Computing Machinery (ACM)
- p. 90-99
Open AccessQTWTL: Quality Aware Time Window Temporal Logic for Performance Monitoring
In various service-oriented applications such as distributed autonomous delivery, healthcare, tourism, transportation, and many others, where service agents need to perform serial and time-bounded tasks to achieve their goals, quality of service must constantly be assured. In addition to safety requirements, such agents also need to fulfill performance requirements in order to satisfy their quality of service. This paper proposes the novel quality-aware time window temporal logic (QTWTL) by extending the traditional time window temporal logic (TWTL) with two operators for counting and aggregation operations. We also propose offline runtime monitoring algorithms for the performance monitoring of QTWTL specifications. To analyze the feasibility and efficiency of our proposed approach, we generate a large number of traces using the New York City Taxi and Limousine Commission Trip Record data, formalize their performance requirements using QTWTL, and monitor them using the proposed algorithms. The obtained results show that the monitoring algorithm has a linear space and time complexity with respect to the number of traces monitored.
- Open Access
- 21 September 2023
- Published by Association for Computing Machinery (ACM)
- p. 100-110
Model Checking Time Window Temporal Logic for Hyperproperties
Hyperproperties extend trace properties to express properties of sets of traces, and they are increasingly popular in specifying various security and performance-related properties in domains such as cyber-physical systems, smart grids, and automotive. This paper introduces HyperTWTL, which extends Time Window Temporal Logic (TWTL)-a domain-specific formal specification language for robotics, by allowing explicit and simultaneous quantification over multiple execution traces. We propose two different semantics for HyperTWTL, synchronous and asynchronous, based on the alignment of the timestamps in the traces. Consequently, we demonstrate the application of HyperTWTL in formalizing important information-flow security policies and concurrency for robotics applications. Furthermore, we introduce a model checking algorithm for verifying fragments of HyperTWTL by reducing the problem to a TWTL model checking problem.
- 21 September 2023
- Published by Association for Computing Machinery (ACM)
- p. 100-110
Open AccessModel Checking Time Window Temporal Logic for Hyperproperties
Hyperproperties extend trace properties to express properties of sets of traces, and they are increasingly popular in specifying various security and performance-related properties in domains such as cyber-physical systems, smart grids, and automotive. This paper introduces HyperTWTL, which extends Time Window Temporal Logic (TWTL)-a domain-specific formal specification language for robotics, by allowing explicit and simultaneous quantification over multiple execution traces. We propose two different semantics for HyperTWTL, synchronous and asynchronous, based on the alignment of the timestamps in the traces. Consequently, we demonstrate the application of HyperTWTL in formalizing important information-flow security policies and concurrency for robotics applications. Furthermore, we introduce a model checking algorithm for verifying fragments of HyperTWTL by reducing the problem to a TWTL model checking problem.
- 29 May 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Robotics and Automation Letters
- Vol. 8 (8) , 4386-4393
Motion Planning Using Hyperproperties for Time Window Temporal Logic
Hyperproperties are increasingly popular in verifying security policies and synthesis of control for dynamic systems. Hyperproperties generalize trace properties to enable reasoning about multiple computation traces that traditional trace properties cannot. Recent works show the effectiveness and prospect of Hyperproperties, specifically Hyperproperties for Linear Temporal Logic (HyperLTL), in optimality-, robustness-, and privacy-aware robotic motion planning. However, despite their rich expressiveness, HyperLTL cannot express tasks with time constraints. This letter presents HyperTWTL, which extends the compact semantics of Time Window Temporal Logic (TWTL) with explicit and concurrent quantification over multiple execution traces. We demonstrate that HyperTWTL can be used to formalize complex robotic planning objectives. Given HyperTWTL specifications, we also propose a symbolic approach for synthesizing optimality-, robustness-, and privacy-aware strategies by reducing the planning problem to a first-order logic satisfiability problem. The planning problem was then solved using two industrial-strength SMT solvers. The feasibility of HyperTWTL and the efficiency and scalability of the proposed strategy synthesis approach are demonstrated by formalizing important motion planning objectives of a surveillance mission case study and synthesizing the respective strategies using Z3 and CVC4 SMT solvers.
- 29 May 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Robotics and Automation Letters
- Vol. 8 (8) , 4386-4393
Motion Planning Using Hyperproperties for Time Window Temporal Logic
Hyperproperties are increasingly popular in verifying security policies and synthesis of control for dynamic systems. Hyperproperties generalize trace properties to enable reasoning about multiple computation traces that traditional trace properties cannot. Recent works show the effectiveness and prospect of Hyperproperties, specifically Hyperproperties for Linear Temporal Logic (HyperLTL), in optimality-, robustness-, and privacy-aware robotic motion planning. However, despite their rich expressiveness, HyperLTL cannot express tasks with time constraints. This letter presents HyperTWTL, which extends the compact semantics of Time Window Temporal Logic (TWTL) with explicit and concurrent quantification over multiple execution traces. We demonstrate that HyperTWTL can be used to formalize complex robotic planning objectives. Given HyperTWTL specifications, we also propose a symbolic approach for synthesizing optimality-, robustness-, and privacy-aware strategies by reducing the planning problem to a first-order logic satisfiability problem. The planning problem was then solved using two industrial-strength SMT solvers. The feasibility of HyperTWTL and the efficiency and scalability of the proposed strategy synthesis approach are demonstrated by formalizing important motion planning objectives of a surveillance mission case study and synthesizing the respective strategies using Z3 and CVC4 SMT solvers.
- Open Access
- 22 January 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 8, 25863-25876
Privacy Enhancement Scheme (PES) in a Blockchain-Edge Computing Environment
With the public key being the parameter users are mostly addressed by on blockchain network, an intruder can connect transactional patterns to the public key and make a probable revelation of the identity of the user. Due to the diversity in approaches in achieving privacy, integrating the principle of transparency in any blockchain - edge computing platform will present some structural security challenges. Thus, an attempt should be made to achieve confidentiality whilst not eliminating a key principle of blockchain - transparency. Based on elliptic curve cryptosystem (ECC), we present a privacy-aware scheme that preserves the privacy details of the user in a blockchain-edge computing environment based on a combination of randomly generated public keys and digital signatures. The resilience and practicality of our scheme were tested on AVISPA and NS2 respectively. The results indicated our scheme was robust against attacks, efficient and low on computation resources of edge devices.
- 22 January 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 8, 25863-25876
Open AccessPrivacy Enhancement Scheme (PES) in a Blockchain-Edge Computing Environment
With the public key being the parameter users are mostly addressed by on blockchain network, an intruder can connect transactional patterns to the public key and make a probable revelation of the identity of the user. Due to the diversity in approaches in achieving privacy, integrating the principle of transparency in any blockchain - edge computing platform will present some structural security challenges. Thus, an attempt should be made to achieve confidentiality whilst not eliminating a key principle of blockchain - transparency. Based on elliptic curve cryptosystem (ECC), we present a privacy-aware scheme that preserves the privacy details of the user in a blockchain-edge computing environment based on a combination of randomly generated public keys and digital signatures. The resilience and practicality of our scheme were tested on AVISPA and NS2 respectively. The results indicated our scheme was robust against attacks, efficient and low on computation resources of edge devices.
- 7 December 2019
- Published by Springer Nature in Sensing and Imaging
- Vol. 21 (1) , 4
Coverage Maximization in Wireless Sensor Networks Using Minimal Exposure Path and Particle Swarm Optimization
- 7 December 2019
- Published by Springer Nature in Sensing and Imaging
- Vol. 21 (1) , 4
Coverage Maximization in Wireless Sensor Networks Using Minimal Exposure Path and Particle Swarm Optimization