Scientific publications
Explore the publications from TNO‑ESI, showcasing our research findings and expertise. This includes peer-reviewed articles, conference papers, and research reports, as well as more accessible publications that share insights from our collaborations with industry partners. You can easily search the publications by keyword to find what is most relevant to you.
- Year
- 2018
- Authors
- Klusener, S.; Mooij, A.J.; Ketema, J.; Wezep, H. van
Reducing code duplication by identifying fresh domain abstractions
- Published in
- 34th IEEE International Conference on Software Maintenance and Evolution, ICSME 2018, 23 September 2018 through 29 September 2018, pp. 569-578.
When software components are developed iteratively, code frequently evolves in an inductive manner: A unit is created and is then copied and modified many times. Such development often happens when variation points and, hence, proper domain abstractions are initially unclear. As a result, there may be substantial amounts of code duplication, and the code may be difficult to understand and maintain, warranting a redesign.
- Year
- 2018
- Authors
- Detterer, P.; Erdin, C.; Nabi, M.; Basten, A.A.; Jiao, H.
Understanding the impact of circuit-level inaccuracy on sensor network performance
- Published in
- 15th ACM International Symposium on Performance Evaluation of Wireless Ad Hoc, Sensor, and Ubiquitous Networks, PE-WASUN 2018, 28 October 2018 through 2 November 2018, pp. 107-114.
Energy efficiency is of paramount importance in designing low-power wireless sensor nodes. Approximate computing is a new circuit-level technique for reducing power consumption. However, the gain in power by applying this technique is achieved at the cost of computational errors. The impact of such inaccuracies in the circuit level of a radio transceiver chip on the performance of Wireless Sensor Networks has not yet been explored.
- Year
- 2018
- Authors
- Ara, H.A.; Geilen, M.; Behrouzian, A.; Basten, A.A.
Throughput-bufering trade-of analysis for scenario-aware dataflow models
In multi-media applications, bufers represent storage spaces that are used to store the data communicated between diferent tasks in the application, and throughput refers to the rate at which output data is produced by the application. The capacities of the bufers inluence the throughput, by altering the waiting times for tasks that need to read or write data from or to the bufers.
- Year
- 2018
- Authors
- Ibrahim, A.; Math, C.B.; Goswami, D.; Basten, A.A.; Li, H.
Co-simulation framework for control, communication and traffic for vehicle platoons
Vehicle platooning has gained attention for its potential to achieve an increased road capacity and safety, and a higher fuel efficiency. Member vehicles of a platoon wirelessly communicate complying with industrial standards such as IEEE 802.11p. By exchanging information with other members via wireless communication, a platoon member computes its desired acceleration which is then passed on to the engine control system via in-vehicle network to physically realize the acceleration.
- Year
- 2018
- Authors
- Duhaiby, O. al; Mooij, A.J.; Wezep, H. van; Groote, J.F.
Pitfalls in applying model learning to industrial legacy software
Maintaining legacy software is one of the most common struggles of the software industry, being costly yet essential. We tackle that problem by providing better understanding of software by extracting behavioural models using the model learning technique. The used technique interacts with a running component and extracts abstract models that would help developers make better informed decisions.
- Year
- 2018
- Authors
- Mohamed, S.; Zhu, D.; Goswami, D.; Basten, A.A.
Optimising quality-of-control for data-intensive multiprocessor image-based control systems considering workload variations
Image-Based Control (IBC) systems have a long sample period. Sensing in these systems consists of compute-intensive image processing algorithms whose response times are dependent on image workload. IBC systems are typically designed for the worst-case workload that results in a long sample period and hence suboptimal quality-of-control (QoC).
- Year
- 2018
- Authors
- Jonk, R.W.J.; Voeten, J.P.M.; Geilen, M. C.W.; Basten, A.A.; Schiffelers, R.
Timing prediction for service-based applications mapped on linux-based multi-core platforms
We develop a model-based approach to predict timing of service-based software applications on Linux-based multi-core platforms for alternative mappings (affinity and priority settings). Service-based applications consist of communicating sequential (Linux) processes. These processes execute functions (also called services), but can only execute them one at a time.
- Year
- 2018
- Authors
- Behrouzian, A.; Goswami, D.; Basten, A.A.
Robust co-synthesis of embedded control systems with occasional deadline misses
Feedback control applications are robust to occasional deadline misses. This opens up the possibility of saving scarce (computation and communication) resources on embedded platforms. Stability and performance requirements of a control loop impose restrictions on acceptable patterns of deadline misses (e.
- Year
- 2018
- Authors
- Pinxten, J. van; Geilen, M.; Hendriks, M.; Basten, T.
Parametric Critical Path Analysis for Event Networks with Minimal and Maximal Time Lags
- Published in
- IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 37(10)
High-end manufacturing systems are cyber-physical systems where productivity depends on the close cooperation of mechanical (physical) and scheduling (cyber) aspects. Mechanical and control constraints impose minimal and maximal time differences between events in the product flow. Sequence-dependent constraints are used by a scheduler to optimize system productivity while satisfying operational requirements.
- Year
- 2018
- Authors
- Behrouzian, A.R.B.; Goswami, D.; Basten, T.; Geilen, M.; Alizadeh Ara, H.; Hendriks, M.
Firmness Analysis of Real-Time Applications Under Static-Priority Preemptive Scheduling
(m, k)-firm real-time tasks must meet the deadline of at least m jobs out of any k consecutive jobs to satisfy the firmness requirement. Scheduling of an (m, k)-firm task requires firmness analysis, whose results are used to provide system-level guarantees on the satisfaction of firmness conditions. We address firmness analysis of an (m, k)-firm task that is intended to be added to a set of asynchronous tasks scheduled under a Static-Priority Preemptive (SPP) policy.

