Stefan Henkler
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Stefan Henkler has a total of 19 co-authors. Here are the top co-authors by number of shared publications:
- Giuseppe Scalora
Hamm-Lippstadt University of Applied Sciences, Lippstadt, Germany
6 shared publications - Luca Brodo
Hamm-Lippstadt University of Applied Sciences, Lippstadt, Germany
6 shared publications - Kristian Rother
Hochschule Hamm-Lippstadt
4 shared publications - Ali Ehteshami Bejnordi
Hochschule Hamm-Lippstadt
3 shared publications - Lukas Walter
Hamm-Lippstadt University of Applied Sciences, Lippstadt, Germany
3 shared publications - Domenic Drechsel
Hochschule Hamm-Lippstadt
2 shared publications
Latest Publications
- Open Access
- 8 October 2026
- Published by Association for Computing Machinery (ACM)
- p. 17-24
Correct-by-Construction Evolution of Digital Twins for Real-Time Autonomous Systems
Safety-critical cyber-physical systems must evolve---through adaptation and post-deployment updates---without forfeiting the guarantees on which their certification rests. Yet digital-twin (DT)--based model-based systems engineering (MBSE) lacks a formal mechanism for preserving correctness as the physical twin (PT) and its DT co-evolve. We argue that refinement can play this role twice: as a correctness guarantee and as a constructive device that automates deployment. We present a refinement-based paradigm for DT-based MBSE that organizes correctness into a small set of locally verifiable obligations over a multi-view decomposition and two flows for design and evolution. The central evolution obligation is instantiated by Relaxed Weak Timed Bisimulation (RWTBS), which allows a DT to propose updates to its PT that preserve output-timing while tolerating bounded input-timing flexibility. The same discipline then compiles timed automata into FreeRTOS and ROS~2 code that refines its model up to a single bounded relaxation---correct by construction.
- 8 October 2026
- Published by Association for Computing Machinery (ACM)
- p. 17-24
Open AccessCorrect-by-Construction Evolution of Digital Twins for Real-Time Autonomous Systems
Safety-critical cyber-physical systems must evolve---through adaptation and post-deployment updates---without forfeiting the guarantees on which their certification rests. Yet digital-twin (DT)--based model-based systems engineering (MBSE) lacks a formal mechanism for preserving correctness as the physical twin (PT) and its DT co-evolve. We argue that refinement can play this role twice: as a correctness guarantee and as a constructive device that automates deployment. We present a refinement-based paradigm for DT-based MBSE that organizes correctness into a small set of locally verifiable obligations over a multi-view decomposition and two flows for design and evolution. The central evolution obligation is instantiated by Relaxed Weak Timed Bisimulation (RWTBS), which allows a DT to propose updates to its PT that preserve output-timing while tolerating bounded input-timing flexibility. The same discipline then compiles timed automata into FreeRTOS and ROS~2 code that refines its model up to a single bounded relaxation---correct by construction.
- Open Access
- 4 October 2026
- Published by Association for Computing Machinery (ACM)
- p. 386-395
Bridging Social and Technical Compliance in Autonomous Systems through a Standardized Pattern Catalog
- 4 October 2026
- Published by Association for Computing Machinery (ACM)
- p. 386-395
Open AccessBridging Social and Technical Compliance in Autonomous Systems through a Standardized Pattern Catalog
- Open Access
- 4 October 2026
- Published by Association for Computing Machinery (ACM)
- p. 310-319
LLMA-UML: Extending the UML for Modeling LLM-Agent Systems
Large Language Model (LLM) agents are becoming important building blocks of software systems. However, an analysis of recent publications shows that existing modeling approaches for LLM-agent systems are fragmented and rarely grounded in widely adopted standards such as the Unified Modeling Language (UML). This fragmentation hinders communication, design review, and early architectural validation. After a review of existing modeling approaches, this paper introduces LLMA-UML, a UML profile with semantics for modeling LLM-agent systems. Designed as a lightweight yet semantically explicit modeling extension, it remains compatible with established UML-based workflows and enables model validation via constraints in the Object Constraint Language (OCL). The profile explicitly defines the boundaries of agents, including prompts, responses, context, memory, tools and retrieval. It also separates design-time specifications from runtime instances across UML diagrams. We describe the conceptual foundations and profile design of LLMA-UML and evaluate it through a representative case study. The results indicate that LLMA-UML improves the expressiveness and analyzability of UML models for LLM-based agent architectures.
- 4 October 2026
- Published by Association for Computing Machinery (ACM)
- p. 310-319
Open AccessLLMA-UML: Extending the UML for Modeling LLM-Agent Systems
Large Language Model (LLM) agents are becoming important building blocks of software systems. However, an analysis of recent publications shows that existing modeling approaches for LLM-agent systems are fragmented and rarely grounded in widely adopted standards such as the Unified Modeling Language (UML). This fragmentation hinders communication, design review, and early architectural validation. After a review of existing modeling approaches, this paper introduces LLMA-UML, a UML profile with semantics for modeling LLM-agent systems. Designed as a lightweight yet semantically explicit modeling extension, it remains compatible with established UML-based workflows and enables model validation via constraints in the Object Constraint Language (OCL). The profile explicitly defines the boundaries of agents, including prompts, responses, context, memory, tools and retrieval. It also separates design-time specifications from runtime instances across UML diagrams. We describe the conceptual foundations and profile design of LLMA-UML and evaluate it through a representative case study. The results indicate that LLMA-UML improves the expressiveness and analyzability of UML models for LLM-based agent architectures.
- 27 September 2026
- Published by Polish Information Processing Society PTI in Annals of Computer Science and Information Systems
- Vol. 47, 423-434
End-to-End Sugar Beet Management Optimisation via DSSAT Repair and Quadratic Surrogate Programming
- 27 September 2026
- Published by Polish Information Processing Society PTI in Annals of Computer Science and Information Systems
- Vol. 47, 423-434
End-to-End Sugar Beet Management Optimisation via DSSAT Repair and Quadratic Surrogate Programming
- Open Access
- 30 June 2026
- Published by Association for Computing Machinery (ACM) in Proceedings of the ACM on Software Engineering
- Vol. 3 (FSE) , 2698-2719
Property Refinement in Linear Temporal Logic: Formal Semantics and Algorithms for Software Verification
Model checking using temporal logic is a key aspect of formal verification of modern complex software systems. These systems are often the result of distributed development processes, involving multiple teams and iterative design cycles. This complexity is mirrored in the corresponding formal specifications, which often consist of a large number of temporal logic properties that need to be verified against a system model. Many of these properties overlap semantically, yet traditional verification treats them as independent, resulting in redundant checks that waste computational resources and inflate engineering effort. We address this by introducing and operationalizing a formal theory of property refinement for temporal logic into a concrete methodology that automatically identifies redundant properties from a verification suite. This is achieved by first partitioning specifications into equivalence classes based on shared atomic propositions, followed by an analysis of intra-class refinement relations to construct the minimal sufficient subset. Our extensive empirical evaluation confirms the practical viability of our approach, demonstrating it can reduce the number of required verification tasks by up to 75% and accelerate model checking by up to three orders of magnitude, with a one-time associated overhead cost of 0.035% for the refinement analysis. The results of the evaluation confirm that the benefits of this approach are threefold: it reduces the computational requirements for formal verification; it allows engineers to focus on the core requirements of the system, hereby reducing engineering effort; finally, the one-time negligible investment in refinement yields compounding returns, making it particularly advantageous for agile and long-term development lifecycles. This work thus establishes property refinement analysis as a key technique for scaling requirement engineering and software verification to modern complex software systems.
- 30 June 2026
- Published by Association for Computing Machinery (ACM) in Proceedings of the ACM on Software Engineering
- Vol. 3 (FSE) , 2698-2719
Open AccessProperty Refinement in Linear Temporal Logic: Formal Semantics and Algorithms for Software Verification
Model checking using temporal logic is a key aspect of formal verification of modern complex software systems. These systems are often the result of distributed development processes, involving multiple teams and iterative design cycles. This complexity is mirrored in the corresponding formal specifications, which often consist of a large number of temporal logic properties that need to be verified against a system model. Many of these properties overlap semantically, yet traditional verification treats them as independent, resulting in redundant checks that waste computational resources and inflate engineering effort. We address this by introducing and operationalizing a formal theory of property refinement for temporal logic into a concrete methodology that automatically identifies redundant properties from a verification suite. This is achieved by first partitioning specifications into equivalence classes based on shared atomic propositions, followed by an analysis of intra-class refinement relations to construct the minimal sufficient subset. Our extensive empirical evaluation confirms the practical viability of our approach, demonstrating it can reduce the number of required verification tasks by up to 75% and accelerate model checking by up to three orders of magnitude, with a one-time associated overhead cost of 0.035% for the refinement analysis. The results of the evaluation confirm that the benefits of this approach are threefold: it reduces the computational requirements for formal verification; it allows engineers to focus on the core requirements of the system, hereby reducing engineering effort; finally, the one-time negligible investment in refinement yields compounding returns, making it particularly advantageous for agile and long-term development lifecycles. This work thus establishes property refinement analysis as a key technique for scaling requirement engineering and software verification to modern complex software systems.
- Open Access
- 13 April 2026
- Published by Association for Computing Machinery (ACM)
- p. 1-12
Runtime Self-Optimization Through Knowledge-Driven Design Space Reduction
Modern Cyber-Physical Systems must operate in volatile environments, with conditions that are often unpredictable at design time, requiring engineering solutions that are able to learn and optimize their configuration at runtime. However, the dimensions of modern systems, which are often complex and highly interconnected, make self-optimization at runtime a challenging task. In this paper, we propose a novel approach to runtime self-optimization that leverages knowledge-driven design space reduction to enable efficient and formally correct optimization of complex systems. Contrary to naïve re-optimization strategies, which are often prohibitive, or heuristic search methods, which sacrifice optimality, our approach guarantees optimal solutions with heuristics-level runtime performance. Specifically, by storing and reusing proven-optimal configurations and intelligently pruning the design space based on learned knowledge, we are able to significantly reduce the search space, hereby enabling fast re-optimization. Upon changes in the operational domain, the knowledge base is efficiently queried and updated, with regions expansion and merging to maintain compactness. The key idea behind the approach is to use Zonotopes as the underlying representation, which offer a compact and efficient way to represent and manipulate high-dimensional design spaces. We evaluate the approach on a smart-farming drone scenario, comparing against common optimization methods demonstrating that our approach not only preserves optimality, but also improves performance up to ∼ 56x compared to baseline methods with negligible memory and computation overhead.
- 13 April 2026
- Published by Association for Computing Machinery (ACM)
- p. 1-12
Open AccessRuntime Self-Optimization Through Knowledge-Driven Design Space Reduction
Modern Cyber-Physical Systems must operate in volatile environments, with conditions that are often unpredictable at design time, requiring engineering solutions that are able to learn and optimize their configuration at runtime. However, the dimensions of modern systems, which are often complex and highly interconnected, make self-optimization at runtime a challenging task. In this paper, we propose a novel approach to runtime self-optimization that leverages knowledge-driven design space reduction to enable efficient and formally correct optimization of complex systems. Contrary to naïve re-optimization strategies, which are often prohibitive, or heuristic search methods, which sacrifice optimality, our approach guarantees optimal solutions with heuristics-level runtime performance. Specifically, by storing and reusing proven-optimal configurations and intelligently pruning the design space based on learned knowledge, we are able to significantly reduce the search space, hereby enabling fast re-optimization. Upon changes in the operational domain, the knowledge base is efficiently queried and updated, with regions expansion and merging to maintain compactness. The key idea behind the approach is to use Zonotopes as the underlying representation, which offer a compact and efficient way to represent and manipulate high-dimensional design spaces. We evaluate the approach on a smart-farming drone scenario, comparing against common optimization methods demonstrating that our approach not only preserves optimality, but also improves performance up to ∼ 56x compared to baseline methods with negligible memory and computation overhead.
- Open Access
- 12 April 2026
- Published by Association for Computing Machinery (ACM)
- p. 448-450
Modular Workshop Architecture for Teaching Machine Learning in Autonomous Driving by Non-Experts
- 12 April 2026
- Published by Association for Computing Machinery (ACM)
- p. 448-450
Open AccessModular Workshop Architecture for Teaching Machine Learning in Autonomous Driving by Non-Experts
- Open Access
- 12 April 2026
- Published by Association for Computing Machinery (ACM)
- p. 421-422
What Do We Really Need? Identifying Minimal Sufficient Temporal Properties via Refinement
- 12 April 2026
- Published by Association for Computing Machinery (ACM)
- p. 421-422
Open AccessWhat Do We Really Need? Identifying Minimal Sufficient Temporal Properties via Refinement
- 20 October 2025
- Published by Springer Nature
- p. 39-49
Comparing Quantization Techniques for DNNs in Precision Agriculture
- 20 October 2025
- Published by Springer Nature
- p. 39-49
Comparing Quantization Techniques for DNNs in Precision Agriculture
- 20 October 2025
- Published by Springer Nature
- p. 50-60
Hardware Acceleration of CNNs with the FINN Framework
- 20 October 2025
- Published by Springer Nature
- p. 50-60
Hardware Acceleration of CNNs with the FINN Framework