30 citations · 48 across the 8 of their papers we have counts for
19 papers
The Geometry of Reachability in Continuous Vector Addition Systems with States
Shaull Almagor, Arka Ghosh, Tim Leys +1
We study the geometry of reachability sets of continuous vector addition systems with states (VASS). In particular we establish that they are almost Minkowski sums of convex cones…
COOL-MC: A Comprehensive Tool for Reinforcement Learning and Model Checking
Dennis Gross, Nils Jansen, Sebastian Junges +1
This paper presents COOL-MC, a tool that integrates state-of-the-art reinforcement learning (RL) and model checking. Specifically, the tool builds upon the OpenAI gym and the proba…
Active Learning of Sequential Transducers with Side Information about the Domain
Raphaël Berthon, Adrien Boiret, Guillermo A. Perez +1
Active learning is a setting in which a student queries a teacher, through membership and equivalence queries, in order to learn a language. Performance on these algorithms is ofte…
Continuous One-Counter Automata
Michael Blondin, Tim Leys, Filip Mazowiecki +2
We study the reachability problem for continuous one-counter automata, COCA for short. In such automata, transitions are guarded by upper and lower bound tests against the counter…
The Complexity of Reachability in Parametric Markov Decision Processes
Sebastian Junges, Joost-Pieter Katoen, Guillermo A. Pérez +1
This article presents the complexity of reachability decision problems for parametric Markov decision processes (pMDPs), an extension to Markov decision processes (MDPs) where tran…
The Extended HOA Format for Synthesis
Guillermo A. Perez
We propose a small extension to the Hanoi Omega-Automata format to define reactive-synthesis problems. Namely, we add a "controllable-AP" header item specifying the subset of atomi…