Stefan Schupp
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
Research Interests
Stefan Schupp has a total of 38 co-authors. Here are the top co-authors by number of shared publications:
- Anne Remke
University of Munster
5 shared publications - Erika Ábrahám
RWTH Aachen University Aachen Germany
3 shared publications - Ezio Bartocci
TU Wien
3 shared publications - Joanna Delicaris
Westfälische Wilhelms-Universität
3 shared publications - Bettina Könighofer
Graz University of Technology
2 shared publications - Dejan Ničković
AIT Austrian Institute of Technology
2 shared publications
Latest Publications
- Open Access
- 4 February 2025
- Published by Springer Nature in International Journal on Software Tools for Technology Transfer
- p. 1-19
An adaptive, provable correct simplex architecture
Simplex architectures optimize performance and safety by switching between an advanced controller and a base controller. We propose an approach to synthesize the switching logic and extensions of the base controller in the Simplex architectures to achieve high performance and provable correctness for a rich class of temporal specifications by maximizing the time the advanced controller is active. We achieve provable correctness by performing static verification of the baseline controller. The result of this verification is a set of states that is proven to be safe, called the recoverable region. We employ proofs on demand to ensure that the base controller is safe in those states that are visited during runtime, which depends on the advanced controller. Verification of hybrid systems is often overly conservative, resulting in smaller recoverable regions that cause unnecessary switches to the baseline controller. To avoid these switches, we invoke targeted reachability queries to extend the recoverable region at runtime. In case the recoverable region cannot be extended using the baseline controller, we employ a repair procedure. This tries to synthesize a patch for the baseline controller and can further extend the recoverable region. Our offline and online verification relies upon reachability analysis since it allows observation-based extension of the known recoverable region. We implemented our methodology on top of the state-of-the-art tool HyPro which allowed us to automatically synthesize verified and performant Simplex architectures for advanced case studies, like safe autonomous driving on a race track.
- 4 February 2025
- Published by Springer Nature in International Journal on Software Tools for Technology Transfer
- p. 1-19
Open AccessAn adaptive, provable correct simplex architecture
Simplex architectures optimize performance and safety by switching between an advanced controller and a base controller. We propose an approach to synthesize the switching logic and extensions of the base controller in the Simplex architectures to achieve high performance and provable correctness for a rich class of temporal specifications by maximizing the time the advanced controller is active. We achieve provable correctness by performing static verification of the baseline controller. The result of this verification is a set of states that is proven to be safe, called the recoverable region. We employ proofs on demand to ensure that the base controller is safe in those states that are visited during runtime, which depends on the advanced controller. Verification of hybrid systems is often overly conservative, resulting in smaller recoverable regions that cause unnecessary switches to the baseline controller. To avoid these switches, we invoke targeted reachability queries to extend the recoverable region at runtime. In case the recoverable region cannot be extended using the baseline controller, we employ a repair procedure. This tries to synthesize a patch for the baseline controller and can further extend the recoverable region. Our offline and online verification relies upon reachability analysis since it allows observation-based extension of the known recoverable region. We implemented our methodology on top of the state-of-the-art tool HyPro which allowed us to automatically synthesize verified and performant Simplex architectures for advanced case studies, like safe autonomous driving on a race track.
- 1 November 2024
- Published by Springer Nature
- p. 1-37
The ARCH-COMP Friendly Verification Competition for Continuous and Hybrid Systems
- 1 November 2024
- Published by Springer Nature
- p. 1-37
The ARCH-COMP Friendly Verification Competition for Continuous and Hybrid Systems
- Open Access
Decidable Reasoning About Time in Finite-Domain Situation Calculus Theories
Representing time is crucial for cyber-physical systems and has been studied extensively in the Situation Calculus. The most commonly used approach represents time by adding a real-valued fluent $\mathit{time}(a)$ that attaches a time point to each action and consequently to each situation. We show that in this approach, checking whether there is a reachable situation that satisfies a given formula is undecidable, even if the domain of discourse is restricted to a finite set of objects. We present an alternative approach based on well-established results from timed automata theory by introducing clocks as real-valued fluents with restricted successor state axioms and comparison operators. %that only allow comparisons against fixed rationals. With this restriction, we can show that the reachability problem for finite-domain basic action theories is decidable. Finally, we apply our results on Golog program realization by presenting a decidable procedure for determining an action sequence that is a successful execution of a given program.Open AccessDecidable Reasoning About Time in Finite-Domain Situation Calculus Theories
Representing time is crucial for cyber-physical systems and has been studied extensively in the Situation Calculus. The most commonly used approach represents time by adding a real-valued fluent $\mathit{time}(a)$ that attaches a time point to each action and consequently to each situation. We show that in this approach, checking whether there is a reachable situation that satisfies a given formula is undecidable, even if the domain of discourse is restricted to a finite set of objects. We present an alternative approach based on well-established results from timed automata theory by introducing clocks as real-valued fluents with restricted successor state axioms and comparison operators. %that only allow comparisons against fixed rationals. With this restriction, we can show that the reachability problem for finite-domain basic action theories is decidable. Finally, we apply our results on Golog program realization by presenting a decidable procedure for determining an action sequence that is a successful execution of a given program. - 3 January 2024
- Published by Springer Nature
- p. 170-182
RealySt: A C++ Tool for Optimizing Reachability Probabilities in Stochastic Hybrid Systems
- 3 January 2024
- Published by Springer Nature
- p. 170-182
RealySt: A C++ Tool for Optimizing Reachability Probabilities in Stochastic Hybrid Systems
- Open Access
- 26 October 2023
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Modeling and Computer Simulation
- Vol. 33 (4) , 1-27
Optimizing Reachability Probabilities for a Restricted Class of Stochastic Hybrid Automata via Flowpipe Construction
Stochastic hybrid automata (SHA) are a powerful tool to evaluate the dependability and safety of critical infrastructures. However, the resolution of nondeterminism, which is present in many purely hybrid models, is often only implicitly considered in SHA. This article instead proposes algorithms for computing maximum and minimum reachability probabilities for singular automata with urgent transitions and random clocks that follow arbitrary continuous probability distributions. We borrow a well-known approach from hybrid systems reachability analysis, namely flowpipe construction, which is then extended to optimize nondeterminism in the presence of random variables. First, valuations of random clocks that ensure reachability of specific goal states are extracted from the computed flowpipes, and second, reachability probabilities are computed by integrating over these valuations. We compute maximum and minimum probabilities for history-dependent prophetic and non-prophetic schedulers using set-based methods. The implementation featuring the library HyPro and the complexity of the approach are discussed in detail. Two case studies featuring nondeterministic choices show the feasibility of the approach.
- 26 October 2023
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Modeling and Computer Simulation
- Vol. 33 (4) , 1-27
Open AccessOptimizing Reachability Probabilities for a Restricted Class of Stochastic Hybrid Automata via Flowpipe Construction
Stochastic hybrid automata (SHA) are a powerful tool to evaluate the dependability and safety of critical infrastructures. However, the resolution of nondeterminism, which is present in many purely hybrid models, is often only implicitly considered in SHA. This article instead proposes algorithms for computing maximum and minimum reachability probabilities for singular automata with urgent transitions and random clocks that follow arbitrary continuous probability distributions. We borrow a well-known approach from hybrid systems reachability analysis, namely flowpipe construction, which is then extended to optimize nondeterminism in the presence of random variables. First, valuations of random clocks that ensure reachability of specific goal states are extracted from the computed flowpipes, and second, reachability probabilities are computed by integrating over these valuations. We compute maximum and minimum probabilities for history-dependent prophetic and non-prophetic schedulers using set-based methods. The implementation featuring the library HyPro and the complexity of the approach are discussed in detail. Two case studies featuring nondeterministic choices show the feasibility of the approach.
- 19 October 2023
- Published by Springer Nature
- p. 3-25
Lightweight Verification of Hyperproperties
- 27 June 2023
- Published by Springer Nature
- p. 164-182
Maximizing Reachability Probabilities in Rectangular Automata with Random Clocks
- 27 June 2023
- Published by Springer Nature
- p. 164-182
Maximizing Reachability Probabilities in Rectangular Automata with Random Clocks
- Open Access
Maximizing Reachability Probabilities in Rectangular Automata with Random Clocks
This paper proposes an algorithm to maximize reachability probabilities for rectangular automata with random clocks via a history-dependent prophetic scheduler. This model class incorporates time-induced nondeterminism on discrete behavior and nondeterminism in the dynamic behavior. After computing reachable state sets via a forward flowpipe construction, we use backward refinement to compute maximum reachability probabilities. The feasibility of the presented approach is illustrated on a scalable model.
Open AccessMaximizing Reachability Probabilities in Rectangular Automata with Random Clocks
This paper proposes an algorithm to maximize reachability probabilities for rectangular automata with random clocks via a history-dependent prophetic scheduler. This model class incorporates time-induced nondeterminism on discrete behavior and nondeterminism in the dynamic behavior. After computing reachable state sets via a forward flowpipe construction, we use backward refinement to compute maximum reachability probabilities. The feasibility of the presented approach is illustrated on a scalable model.
- 2 May 2023
- Published by Springer Nature
- p. 141-160
Provable Correct and Adaptive Simplex Architecture for Bounded-Liveness Properties
- 2 May 2023
- Published by Springer Nature
- p. 141-160
Provable Correct and Adaptive Simplex Architecture for Bounded-Liveness Properties
- Open Access
- 22 July 2022
- Published by Elsevier in Information and Computation
- Vol. 289
Recent developments in theory and tool support for hybrid systems verification with HyPro
- 22 July 2022
- Published by Elsevier in Information and Computation
- Vol. 289
Open AccessRecent developments in theory and tool support for hybrid systems verification with HyPro