Twan Basten
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
Twan Basten has a total of 256 co-authors. Here are the top co-authors by number of shared publications:
- Marc Geilen
Eindhoven University of Technology, Eindhoven, The Netherlands
94 shared publications - Sander Stuijk
Department of Electrical Engineering, Eindhoven University of Technology, 5600MB Eindhoven, The Netherlands
51 shared publications Henk Corporaal
Dept. of Electr. Eng., Eindhoven Univ. of Technol., Eindhoven, Netherlands
25 shared publicationsMajid Nabi
Department of Electrical and Computer Engineering, Isfahan University of Technology, Isfahan, Iran
16 shared publicationsLou Somers
Océ Technologies and Eindhoven University of Technology, Eindhoven, Netherlands
13 shared publicationsMartijn Hendriks
Department of Electrical Engineering, Eindhoven University of Technology, Eindhoven, The Netherlands
10 shared publications
Latest Publications
- 20 May 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 13 (14) , 30400-30413
Fast Time-Aware Shaper Scheduling for In-Vehicle Networks via Deep Reinforcement Learning
Modern vehicles increasingly rely on distributed computing platforms that exchange large volumes of sensor and control data with strict timing requirements. Ensuring that this traffic meets its deadlines over Ethernet-based in-vehicle networks requires Time-Sensitive Networking (TSN) and, in particular, effective configuration of the Time-Aware Shaper (TAS). However, generating and updating TAS schedules that remain valid as traffic patterns evolve is an NP-hard problem that traditional optimization or heuristic methods address only partially. This paper introduces a Deep Reinforcement Learning (DRL) scheduler that learns to configure TAS schedules directly from network state while preserving standard compliance through analytical validation. The proposed DRL scheduler encodes the scenario (network topology and workload) of the in-vehicle network using a Graph Neural Network (GNN) and learns scheduling policies that balance deadline satisfaction, latency, and resource utilization. Evaluation on a comprehensive benchmark shows that the proposed approach consistently outperforms state-of-the-art heuristics and a topology-specific DRL baseline, achieving higher success rate and lower delay while maintaining efficient bandwidth use. Once trained, it can adapt to new traffic scenarios within milliseconds, demonstrating the potential of the DRL-based scheduler as a foundation for adaptive and reliable communication in next-generation software-defined vehicles.
- 20 May 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 13 (14) , 30400-30413
Fast Time-Aware Shaper Scheduling for In-Vehicle Networks via Deep Reinforcement Learning
Modern vehicles increasingly rely on distributed computing platforms that exchange large volumes of sensor and control data with strict timing requirements. Ensuring that this traffic meets its deadlines over Ethernet-based in-vehicle networks requires Time-Sensitive Networking (TSN) and, in particular, effective configuration of the Time-Aware Shaper (TAS). However, generating and updating TAS schedules that remain valid as traffic patterns evolve is an NP-hard problem that traditional optimization or heuristic methods address only partially. This paper introduces a Deep Reinforcement Learning (DRL) scheduler that learns to configure TAS schedules directly from network state while preserving standard compliance through analytical validation. The proposed DRL scheduler encodes the scenario (network topology and workload) of the in-vehicle network using a Graph Neural Network (GNN) and learns scheduling policies that balance deadline satisfaction, latency, and resource utilization. Evaluation on a comprehensive benchmark shows that the proposed approach consistently outperforms state-of-the-art heuristics and a topology-specific DRL baseline, achieving higher success rate and lower delay while maintaining efficient bandwidth use. Once trained, it can adapt to new traffic scenarios within milliseconds, demonstrating the potential of the DRL-based scheduler as a foundation for adaptive and reliable communication in next-generation software-defined vehicles.
- Open Access
- 8 May 2026
- Published by Springer Nature in Journal of Intelligent Manufacturing
- Vol. 37 (7) , 2635-2668
Modular scheduling of tightly coupled production lines
Optimising productivity of tightly coupled production lines in, for instance, the production printing or semiconductor industry is difficult due to the diversity of products resulting in different product flows, the variety of constraints, and the precise timing required to coordinate multiple tightly coupled machines. A modular setup provides flexibility and cost reduction through reuse of machinery and schedulers. However, the scheduling of a modular production line is challenging as it leads to a distributed decision process where each module has a limited view of the entire system, while local scheduling decisions have a global impact on schedule feasibility. This work proposes a distributed scheduling method for tightly coupled modular sequential production lines where products cannot overtake each other during production. We develop a multi-agent framework in which a system agent propagates timing constraints of the schedulers of different modules. The system agent aims to reach consensus about the handover times of jobs between modules to converge to a globally feasible schedule. The system agent interacts with local agents that interface with local schedulers, allowing the use of existing local schedulers without modification. We illustrate the approach on production lines with multiple re-entrant flow-shop instances with setup times and due dates, which results in a challenging scheduling problem. The performance of the proposed distributed scheduling method is assessed using a monolithic exact scheduler (implemented as a constraint program, not applicable to modular problems) as a reference. It is found to deliver good quality schedules, having only a 1.15 larger makespan on average than the hypothetical optimum provided by the exact scheduler.
- 8 May 2026
- Published by Springer Nature in Journal of Intelligent Manufacturing
- Vol. 37 (7) , 2635-2668
Open AccessModular scheduling of tightly coupled production lines
Optimising productivity of tightly coupled production lines in, for instance, the production printing or semiconductor industry is difficult due to the diversity of products resulting in different product flows, the variety of constraints, and the precise timing required to coordinate multiple tightly coupled machines. A modular setup provides flexibility and cost reduction through reuse of machinery and schedulers. However, the scheduling of a modular production line is challenging as it leads to a distributed decision process where each module has a limited view of the entire system, while local scheduling decisions have a global impact on schedule feasibility. This work proposes a distributed scheduling method for tightly coupled modular sequential production lines where products cannot overtake each other during production. We develop a multi-agent framework in which a system agent propagates timing constraints of the schedulers of different modules. The system agent aims to reach consensus about the handover times of jobs between modules to converge to a globally feasible schedule. The system agent interacts with local agents that interface with local schedulers, allowing the use of existing local schedulers without modification. We illustrate the approach on production lines with multiple re-entrant flow-shop instances with setup times and due dates, which results in a challenging scheduling problem. The performance of the proposed distributed scheduling method is assessed using a monolithic exact scheduler (implemented as a constraint program, not applicable to modular problems) as a reference. It is found to deliver good quality schedules, having only a 1.15 larger makespan on average than the hypothetical optimum provided by the exact scheduler.
- Open Access
- 26 November 2025
- Published by Elsevier in Computers & Operations Research
- Vol. 187
An exact decomposition-based approach to the conflict-free-transportation-constrained flexible job-shop scheduling problem
- 26 November 2025
- Published by Elsevier in Computers & Operations Research
- Vol. 187
Open AccessAn exact decomposition-based approach to the conflict-free-transportation-constrained flexible job-shop scheduling problem
- Open Access
- 26 September 2025
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Embedded Computing Systems
- Vol. 24 (5s) , 1-28
Schedule Synthesis for Synchronous Dataflow Models with Lower and Upper Timing Bounds
Homogeneous Synchronous DataFlow Graphs (HSDFGs) have become a popular method for analysing the performance of manufacturing systems. Manufacturing tasks, modelled by actor firings in an HSDFG, are bounded by their earliest possible starting times, determined by the completion of preceding tasks. Taking into account these lower bounds, an HSDFG represents different possible task schedules for these tasks, namely any actor firing scheme that satisfies these lower bounds. However, in some cases, tasks in a manufacturing system must be completed before a deadline, which introduces an upper bound. Additionally, the relative start times between tasks may need to adhere to a lower bound. Such lower and upper bounds are not naturally supported by classical HSDFGs. In such cases, an HSDFG cannot represent all relevant aspects of the behaviour of a manufacturing system. This article extends the HSDFG model to support the specification of lower-bound and upper-bound constraints on timing differences between actor-firing starts and completions. The paper then presents a new method for transforming extended HSDFGs into a (max, +) linear system in the form of its state-space matrices. This system can be used to synthesize a task schedule that adheres to the specified lower and upper bounds while achieving the earliest possible execution times, optimizing throughput or makespan. We illustrate the necessity for specifying lower and upper bounds, and the application of our techniques, with a manufacturing system case study.
- 26 September 2025
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Embedded Computing Systems
- Vol. 24 (5s) , 1-28
Open AccessSchedule Synthesis for Synchronous Dataflow Models with Lower and Upper Timing Bounds
Homogeneous Synchronous DataFlow Graphs (HSDFGs) have become a popular method for analysing the performance of manufacturing systems. Manufacturing tasks, modelled by actor firings in an HSDFG, are bounded by their earliest possible starting times, determined by the completion of preceding tasks. Taking into account these lower bounds, an HSDFG represents different possible task schedules for these tasks, namely any actor firing scheme that satisfies these lower bounds. However, in some cases, tasks in a manufacturing system must be completed before a deadline, which introduces an upper bound. Additionally, the relative start times between tasks may need to adhere to a lower bound. Such lower and upper bounds are not naturally supported by classical HSDFGs. In such cases, an HSDFG cannot represent all relevant aspects of the behaviour of a manufacturing system. This article extends the HSDFG model to support the specification of lower-bound and upper-bound constraints on timing differences between actor-firing starts and completions. The paper then presents a new method for transforming extended HSDFGs into a (max, +) linear system in the form of its state-space matrices. This system can be used to synthesize a task schedule that adheres to the specified lower and upper bounds while achieving the earliest possible execution times, optimizing throughput or makespan. We illustrate the necessity for specifying lower and upper bounds, and the application of our techniques, with a manufacturing system case study.
- Open Access
- 13 November 2024
- Published by Springer Nature in Discrete Event Dynamic Systems
- Vol. 34 (4) , 573-604
Tracking dynamic deadlines in switched max-plus linear systems with uncontrollable workloads
Modern safety-critical cyber-physical systems such as medical imaging equipment or autonomous vehicles need to respect strict deadlines on received data-processing workloads. These deadlines and workloads are dynamic and uncontrollable and the systems typically have only a limited discrete number of system configurations to respond to dynamic changes. The number and types of processors allocated to a data-processing task, their operating voltage and frequency, and the resolution and frequency of sensing (e.g., images) are examples of controllable configuration parameters. Guaranteeing dynamically changing deadlines under uncontrollable workloads with a limited discrete number of response options can be phrased as a multi-objective tracking problem for a switched max-plus linear system. This results in a combined scheduling and control problem. We propose an integrated state-feedback and model-predictive control solution that minimizes the number of deadline misses and the cost of implementation (e.g., energy consumption). We demonstrate the effectiveness of our approach through simulation.
- 13 November 2024
- Published by Springer Nature in Discrete Event Dynamic Systems
- Vol. 34 (4) , 573-604
Open AccessTracking dynamic deadlines in switched max-plus linear systems with uncontrollable workloads
Modern safety-critical cyber-physical systems such as medical imaging equipment or autonomous vehicles need to respect strict deadlines on received data-processing workloads. These deadlines and workloads are dynamic and uncontrollable and the systems typically have only a limited discrete number of system configurations to respond to dynamic changes. The number and types of processors allocated to a data-processing task, their operating voltage and frequency, and the resolution and frequency of sensing (e.g., images) are examples of controllable configuration parameters. Guaranteeing dynamically changing deadlines under uncontrollable workloads with a limited discrete number of response options can be phrased as a multi-objective tracking problem for a switched max-plus linear system. This results in a combined scheduling and control problem. We propose an integrated state-feedback and model-predictive control solution that minimizes the number of deadline misses and the cost of implementation (e.g., energy consumption). We demonstrate the effectiveness of our approach through simulation.
- Open Access
- 6 November 2024
- Published by Association for Computing Machinery (ACM)
- p. 266-277
Online Admission Test for Real-Time Tasks with Arrival Curves for Server Platforms
- 6 November 2024
- Published by Association for Computing Machinery (ACM)
- p. 266-277
Open AccessOnline Admission Test for Real-Time Tasks with Arrival Curves for Server Platforms
- Open Access
- 3 July 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 12, 92733-92752
A Method for Building Trustworthy Hybrid Performance Models for Cyber-Physical Systems of Systems
The increasing dynamism and interconnectivity of Cyber-Physical Systems of Systems (CPSoS) emphasize the need for advanced performance modeling approaches. Performance models serve the purpose of exploring and evaluating design solutions, providing insights into system behavior during the early design phases, and managing performance risks during development. Despite the advancements in hybrid modeling within the field of performance modeling, the challenge of constructing models effectively and efficiently while ensuring their trustworthiness has not received much attention. This paper proposes a method, that is, step-by-step guidelines on using formalisms, techniques, and tools, to construct trustworthy hybrid models for analyzing and predicting stochastic timing performance of CPSoS. The method integrates design patterns for improved model design and development, alongside Bayesian calibration and statistical validation techniques to further enhance trustworthiness of the models. Although many individual techniques, formalisms and tools are available, our contribution lies in proposing a systematic method for achieving trustworthiness within the context of hybrid performance modeling and simulation. We concretize the method for cloud-based cyber-physical systems. Through two case studies, we show the efficacy of the proposed method for accurately predicting end-to-end latency of offloading imaging tasks to the cloud. The first case study showcases the application of design patterns in a practical scenario involving a cloud-based healthcare system—a collaboration with an industry partner in healthcare systems. The second case study has been implemented as a prototype to show the use of calibration and validation techniques with operational data in a laboratory context using an image-reconstruction application.
- 3 July 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 12, 92733-92752
Open AccessA Method for Building Trustworthy Hybrid Performance Models for Cyber-Physical Systems of Systems
The increasing dynamism and interconnectivity of Cyber-Physical Systems of Systems (CPSoS) emphasize the need for advanced performance modeling approaches. Performance models serve the purpose of exploring and evaluating design solutions, providing insights into system behavior during the early design phases, and managing performance risks during development. Despite the advancements in hybrid modeling within the field of performance modeling, the challenge of constructing models effectively and efficiently while ensuring their trustworthiness has not received much attention. This paper proposes a method, that is, step-by-step guidelines on using formalisms, techniques, and tools, to construct trustworthy hybrid models for analyzing and predicting stochastic timing performance of CPSoS. The method integrates design patterns for improved model design and development, alongside Bayesian calibration and statistical validation techniques to further enhance trustworthiness of the models. Although many individual techniques, formalisms and tools are available, our contribution lies in proposing a systematic method for achieving trustworthiness within the context of hybrid performance modeling and simulation. We concretize the method for cloud-based cyber-physical systems. Through two case studies, we show the efficacy of the proposed method for accurately predicting end-to-end latency of offloading imaging tasks to the cloud. The first case study showcases the application of design patterns in a practical scenario involving a cloud-based healthcare system—a collaboration with an industry partner in healthcare systems. The second case study has been implemented as a prototype to show the use of calibration and validation techniques with operational data in a laboratory context using an image-reconstruction application.
- Open Access
Time- and Behavior-Preserving Execution of Determinate Supervisory Control
The activity framework is a promising model-based design approach for Flexible Manufacturing Systems (FMS). It is used in industry for specification and analysis of FMS. It provides an intuitive specification language with a hierarchical view of the system's actions and events, activities built from them, and an automaton that captures the overall behavior of the system in terms of sequences of activities corresponding to its accepted words. It also provides a scalable timing analysis method using max-plus linear systems theory. The framework currently requires manual implementation of the supervisory controller that governs the system behavior. This is labor-intensive and error-prone. In this article, we turn the framework into a model-driven approach by introducing an execution architecture and execution engine that allow a specification to be executed in a time- and behavior-preserving fashion. We prove that the architecture and engine preserve the specified ordering of actions and events in the specification as well as the timing thereof up to a specified bound. We validate our approach on a prototype production system.
Open AccessTime- and Behavior-Preserving Execution of Determinate Supervisory Control
The activity framework is a promising model-based design approach for Flexible Manufacturing Systems (FMS). It is used in industry for specification and analysis of FMS. It provides an intuitive specification language with a hierarchical view of the system's actions and events, activities built from them, and an automaton that captures the overall behavior of the system in terms of sequences of activities corresponding to its accepted words. It also provides a scalable timing analysis method using max-plus linear systems theory. The framework currently requires manual implementation of the supervisory controller that governs the system behavior. This is labor-intensive and error-prone. In this article, we turn the framework into a model-driven approach by introducing an execution architecture and execution engine that allow a specification to be executed in a time- and behavior-preserving fashion. We prove that the architecture and engine preserve the specified ordering of actions and events in the specification as well as the timing thereof up to a specified bound. We validate our approach on a prototype production system.
- Open Access
- 29 August 2023
- Published by Springer Nature in Discrete Event Dynamic Systems
- Vol. 33 (3) , 341-372
Modeling and analysis of switching max-plus linear systems with discrete-event feedback
Switching max-plus linear system (SMPLS) models are an apt formalism for performance analysis of discrete-event systems. SMPLS analysis is more scalable than analysis through other formalisms such as timed automata, because SMPLS abstract pieces of determinate concurrent system behavior into atomic modes with fixed timing. We consider discrete-event systems that are decomposed into a plant and a Supervisory Controller (SC) that controls the plant. The SC needs to react to events, concerning e.g. the successful completion or failure of an action, to determine the future behavior of the system, for example, to initiate a retrial of the action. To specify and analyze such system behavior and the impact of feedback on timing properties, we introduce an extension to SMPLS with discrete-event feedback. In this extension, we model the plant behavior with system modes and capture the timing of discrete-event feedback emission from plant to SC in the mode matrices. Furthermore, we use I/O automata to capture how the SC responds to discrete-event feedback with corresponding mode sequences of the SMPLS. We define the semantics of SMPLS with events using new state-space equations that are akin to classical SMPLS with dynamic state-vector sizes. To analyze the extended models, we formulate a transformation from SMPLS with events to classical SMPLS with equivalent semantics and properties such that performance properties can be analyzed using existing techniques. Our approach enables the specification of discrete-event feedback from the plant to the SC and its performance analysis. We demonstrate our approach by specifying and analyzing the makespan of a flexible manufacturing system.
- 29 August 2023
- Published by Springer Nature in Discrete Event Dynamic Systems
- Vol. 33 (3) , 341-372
Open AccessModeling and analysis of switching max-plus linear systems with discrete-event feedback
Switching max-plus linear system (SMPLS) models are an apt formalism for performance analysis of discrete-event systems. SMPLS analysis is more scalable than analysis through other formalisms such as timed automata, because SMPLS abstract pieces of determinate concurrent system behavior into atomic modes with fixed timing. We consider discrete-event systems that are decomposed into a plant and a Supervisory Controller (SC) that controls the plant. The SC needs to react to events, concerning e.g. the successful completion or failure of an action, to determine the future behavior of the system, for example, to initiate a retrial of the action. To specify and analyze such system behavior and the impact of feedback on timing properties, we introduce an extension to SMPLS with discrete-event feedback. In this extension, we model the plant behavior with system modes and capture the timing of discrete-event feedback emission from plant to SC in the mode matrices. Furthermore, we use I/O automata to capture how the SC responds to discrete-event feedback with corresponding mode sequences of the SMPLS. We define the semantics of SMPLS with events using new state-space equations that are akin to classical SMPLS with dynamic state-vector sizes. To analyze the extended models, we formulate a transformation from SMPLS with events to classical SMPLS with equivalent semantics and properties such that performance properties can be analyzed using existing techniques. Our approach enables the specification of discrete-event feedback from the plant to the SC and its performance analysis. We demonstrate our approach by specifying and analyzing the makespan of a flexible manufacturing system.
- 24 January 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
- Vol. 42 (10) , 3412-3425
Efficient Computation of the Max-Plus Semantics of Synchronous Dataflow Graphs
Streaming systems are naturally modeled with synchronous dataflow graphs (SDFGs). The max-plus semantics of an SDFG is a compact matrix representation of its timing behavior. The max-plus semantics enables us to analyze and control timing properties of the systems, such as the obtainable minimum guaranteed throughput and maximum latency. Deriving the max-plus semantics, and consequently, performance analysis may be computationally expensive since the state-of-the-art method simulates one iteration of an SDFG. This holds, in particular, for systems whose components operate at different levels of granularity, as this results in many executions of some components in one iteration. This paper aims at efficiently calculating the max-plus semantics of SDFGs. The paper proposes an optimization framework exploring decompositions of a given SDFG and finding a composition sequence whose computational effort for compositionally obtaining the max-plus semantics is minimal. Not only does our proposed technique accelerate the performance analysis of multiscale streaming systems, but it also allows us to compute the max-plus semantics of some systems for which the state-of-the-art method does not succeed because of memory limitations.
- 24 January 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
- Vol. 42 (10) , 3412-3425
Efficient Computation of the Max-Plus Semantics of Synchronous Dataflow Graphs
Streaming systems are naturally modeled with synchronous dataflow graphs (SDFGs). The max-plus semantics of an SDFG is a compact matrix representation of its timing behavior. The max-plus semantics enables us to analyze and control timing properties of the systems, such as the obtainable minimum guaranteed throughput and maximum latency. Deriving the max-plus semantics, and consequently, performance analysis may be computationally expensive since the state-of-the-art method simulates one iteration of an SDFG. This holds, in particular, for systems whose components operate at different levels of granularity, as this results in many executions of some components in one iteration. This paper aims at efficiently calculating the max-plus semantics of SDFGs. The paper proposes an optimization framework exploring decompositions of a given SDFG and finding a composition sequence whose computational effort for compositionally obtaining the max-plus semantics is minimal. Not only does our proposed technique accelerate the performance analysis of multiscale streaming systems, but it also allows us to compute the max-plus semantics of some systems for which the state-of-the-art method does not succeed because of memory limitations.