Search Results for author:
Found 7 papers, 3 papers with code
Synthesizing Efficiently Monitorable Formulas in Metric Temporal Logic
In runtime verification, manually formalizing a specification for monitoring system executions is a tedious and error-prone process.
Targeted Adversarial Attacks on Deep Reinforcement Learning Policies via Model Checking
We use this metric to craft optimal adversarial attacks.
COOL-MC: A Comprehensive Tool for Reinforcement Learning and Model Checking
This paper presents COOL-MC, a tool that integrates state-of-the-art reinforcement learning (RL) and model checking.
Lecture Notes on Partially Known MDPs
In these notes we will tackle the problem of finding optimal policies for Markov decision processes (MDPs) which are not fully known to us.
Active Learning of Sequential Transducers with Side Information about the Domain
We show that there exists an algorithm using string equation solvers that uses this knowledge to learn subsequential string transducers with a better guarantee on the required number of equivalence queries than classical active learning.
The Extended HOA Format for Synthesis
We propose a small extension to the Hanoi Omega-Automata format to define reactive-synthesis problems.
Logic in Computer Science Formal Languages and Automata Theory
The Complexity of Graph-Based Reductions for Reachability in Markov Decision Processes
We study the never-worse relation (NWR) for Markov decision processes with an infinite-horizon reachability objective.
