publications
My peer-reviewed publications. See also my Google scholar or my dblp page.
2023
- BookShared Control with Human Trust and Workload ModelsCyber-Physical-Human Systems: Fundamentals and Applications, 2023
- UAIRisk-aware Curriculum Generation for Heavy-tailed Task DistributionsIn UAI 2023
- CAVEfficient Sensitivity Analysis for Parametric Robust Markov ChainsIn CAV 2023
- IJCAIMore for Less: Safe Policy Improvement with Stronger Performance GuaranteesIn IJCAI 2023
- IJCAIRecursive Small-Step Multi-Agent A* for Dec-POMDPsIn IJCAI 2023
- NCAA Maintenance Planning Framework using Online and Offline Deep Reinforcement LearningNeural Comput. Appl. 2023
- STTTDecision-making under uncertainty: beyond probabilities. Challenges and PerspectivesSTTT 2023
- ICLRSafe Reinforcement Learning From Pixels Using a Stochastic Latent RepresentationIn ICLR 2023
- TACASRobust Almost-Sure Reachability in Multi-Environment MDPsIn TACAS 2023
- ICAPSAct-Then-Measure: Reinforcement Learning for Partially Observable Environments with Active MeasuringIn ICAPS 2023
- ICAPSModel Checking for Adversarial Multi-Agent Reinforcement Learning with Reactive Defense MethodsIn ICAPS 2023
- JAIRRobust Control for Dynamical Systems with Non-Gaussian Noise via Formal AbstractionsJ. Artif. Intell. Res. 2023
- AAAISafe Policy Improvement for POMDPs via Finite-State ControllersIn AAAI 2023
- AAAIProbabilities Are Not Enough: Formal Controller Synthesis for Stochastic Dynamical Models with Epistemic UncertaintyIn AAAI 2023
- AAAISafe Reinforcement Learning via Shielding under Partial ObservabilityIn AAAI 2023
- ICAARTTargeted Adversarial Attacks on Deep Reinforcement Learning Policies via Model CheckingIn ICAART 2023
2022
- NeurIPSRobust Anytime Learning of Markov Decision ProcessesIn NeurIPS 2022
- AAAISampling-Based Robust Control of Autonomous Systems with Non-Gaussian NoiseIn AAAI 2022
- CAVSampling-Based Verification of CTMCs with Uncertain RatesIn CAV (2) 2022
- STTTScenario-based verification of uncertain parametric MDPsInt. J. Softw. Tools Technol. Transf. 2022
- A Journey from Process Algebra via Timed Automata to Model Learning - Essays Dedicated to Frits Vaandrager on the Occasion of His 60th Birthday2022
- Grouping of Maintenance Actions with Deep Reinforcement Learning and Graph Convolutional NetworksIn ICAART (2) 2022
- COOL-MC: A Comprehensive Tool for Reinforcement Learning and Model CheckingIn SETTA 2022
2021
- Formalizing and guaranteeing human-robot interactionCommun. ACM 2021
- Task-Aware Verifiable RNN-Based Policies for Partially Observable Markov Decision ProcessesJ. Artif. Intell. Res. 2021
- Robust Finite-State Controllers for Uncertain POMDPsIn AAAI 2021
- AlwaysSafe: Reinforcement Learning without Safety Constraint Violations during TrainingIn AAMAS 2021
- Safe Policies for Factored Partially Observable Stochastic GamesIn Robotics: Science and Systems 2021
- Enforcing Almost-Sure Reachability in POMDPsIn CAV (2) 2021
- Strategy Synthesis for POMDPs in Robot Planning via Game-Based AbstractionsIEEE Trans. Autom. Control. 2021
- Synthesis of Provably Correct Autonomy Protocols for Shared ControlIEEE Trans. Autom. Control. 2021
- Control Theory Meets POMDPs: A Hybrid Systems ApproachIEEE Trans. Autom. Control. 2021
- Damage detection using in-domain and cross-domain transfer learningNeural Comput. Appl. 2021
- Adaptive Shielding under UncertaintyIn ACC 2021
- Balancing Wind and Batteries: Towards Predictive Verification of Smart GridsIn NFM 2021
2020
- Robustness Verification for Classifier EnsemblesIn ATVA 2020
- Safe Reinforcement Learning Using Probabilistic Shields (Invited Paper)In CONCUR 2020
- Robust Policy Synthesis for Uncertain POMDPs via Convex OptimizationIn IJCAI 2020
- Verifiable RNN-Based Policies for POMDPs Under Temporal Logic ConstraintsIn IJCAI 2020
- Shield Synthesis for Reinforcement LearningIn ISoLA (1) 2020
- Neural Simplex ArchitectureIn NFM 2020
- Strengthening Deterministic Policies for POMDPsIn NFM 2020
- Scenario-Based Verification of Uncertain MDPsIn TACAS (1) 2020
- Formal Modeling and Analysis of Timed Systems - 18th International Conference, FORMATS 2020, Vienna, Austria, September 1-3, 2020, Proceedings2020
2019
- Model Repair Revamped - - On the Automated Synthesis of Markov Chains -In From Reactive Systems to Cyber-Physical Systems 2019
- Counterexample-Guided Strategy Improvement for POMDPs Using Recurrent Neural NetworksIn IJCAI 2019
- Structured Synthesis for Probabilistic SystemsIn NFM 2019
- Correct-by-construction policies for POMDPsIn SNR 2019
- Shepherding Hordes of Markov ChainsIn TACAS (2) 2019
2018
- Conditioning in Probabilistic ProgrammingACM Trans. Program. Lang. Syst. 2018
- Verification of Uncertain POMDPs Using Barrier CertificatesIn Allerton 2018
- Human-in-the-Loop Synthesis for Partially Observable Markov Decision ProcessesIn ACC 2018
- Synthesis in pMDPs: A Tale of 1001 ParametersIn ATVA 2018
- Abstraktions-basierte Verifikation von POMDPs im Motion-Planning-KontextIn MBMV 2018
- Model Checking for Safe Navigation Among HumansIn QEST 2018
- Finite-State Controllers of POMDPs using Parameter SynthesisIn UAI 2018
- Machine Learning and Model Checking Join Forces (Dagstuhl Seminar 18121)Dagstuhl Reports 2018
2017
- Synthesis of shared control protocols with provable safety and performance guaranteesIn ACC 2017
- Motion planning under partial observability using game-based abstractionIn CDC 2017
- Sequential Convex Programming for the Efficient Verification of Parametric MDPsIn TACAS (2) 2017
- Synthesis and Verification of Self-aware Computing Systems2017
2016
- Probabilistic Verification for Cognitive ModelsIn AAAI Fall Symposia 2016
- Parameter Synthesis for Markov Models: Faster Than EverIn ATVA 2016
- Bounded Model Checking for Probabilistic ProgramsIn ATVA 2016
- Combining Static and Runtime Methods to Achieve Safe Standing-Up for Humanoid RobotsIn ISoLA (1) 2016
- Parameter Synthesis for Probabilistic SystemsIn MBMV 2016
- Safety-Constrained Reinforcement Learning for MDPsIn TACAS 2016
2015
- Counterexamples in probabilistic verification2015
- High-level Counterexamples for Probabilistic AutomataLog. Methods Comput. Sci. 2015
- Understanding Probabilistic ProgramsIn Correct System Design 2015
- PROPhESY: A PRObabilistic ParamEter SYnthesis ToolIn CAV (1) 2015
- Counterexamples for Expected RewardsIn FM 2015
- A Greedy Approach for the Efficient Repair of Stochastic ModelsIn NFM 2015
- Conditioning in Probabilistic ProgrammingIn MFPS 2015
2014
- Symbolic counterexample generation for large discrete-time Markov chainsSci. Comput. Program. 2014
- Minimal counterexamples for linear-time probabilistic verificationTheor. Comput. Sci. 2014
- Fast Debugging of PRISM ModelsIn ATVA 2014
- Accelerating Parametric Probabilistic VerificationIn QEST 2014
- Counterexample Generation for Discrete-Time Markov Models: An Introductory SurveyIn SFM 2014
2013
- Regular Model Checking Using Solver Technologies and Automata LearningIn NASA Formal Methods 2013
- High-Level Counterexamples for Probabilistic AutomataIn QEST 2013
2012
- The COMICS Tool - Computing Minimal Counterexamples for DTMCsIn ATVA 2012
- Symbolic Counterexample Generation for Discrete-Time Markov ChainsIn FACS 2012
- Minimal Critical Subsystems as Counterexamples for omega-Regular DTMC PropertiesIn MBMV 2012
- Minimal Critical Subsystems for Discrete-Time Markov ModelsIn TACAS 2012
2011
- Hierarchical Counterexamples for Discrete-Time Markov ChainsIn ATVA 2011
- Counterexample Generation for Markov Chains Using SMT-Based Bounded Model CheckingIn FMOODS/FORTE 2011
- On collaboratively conveying computer science to pupilsIn Koli Calling 2011
- SMT-based Counterexample Generation for Markov ChainsIn MBMV 2011
2010
- Podcastproduktion als kollaborativer Zugang zur theoretischen InformatikIn DeLFI 2010