1 citations · 1 across the 2 of their papers we have counts for
4 papers
Random Generation of Small Quantitative Automata for Algorithm Debugging
Mikael Bisgaard Dahlsen-Jensen, Jaco van de Pol
Analysis algorithms for quantitative automata are complex and hard to validate. Existing approaches -- benchmarks, mutation testing, uniform random generation -- each fail to expos…
State-Space Abstractions for Parametric Timed Games
Mikael Bisgaard Dahlsen-Jensen, Laure Petrucci, Jaco van de Pol
Synthesizing controllers for real-time systems under both timing uncertainty and adversarial environments requires exploring prohibitively large symbolic state spaces. While zone i…
Controller Synthesis for Parametric Timed Games
Mikael Bisgaard Dahlsen-Jensen, Baptiste Fievet, Laure Petrucci +1
We present a (semi)-algorithm to compute winning strategies for parametric timed games. Previous algorithms only synthesized constraints on the clock parameters for which the game…
Program Analysis via Multiple Context Free Language Reachability
Giovanna Kobus Conrado, Adam Husted Kjelstrøm, Andreas Pavlogiannis +1
Context-free language (CFL) reachability is a standard approach in static analyses, where the analysis question is phrased as a language reachability problem on a graph wrt a C…