1 citations · 2 across the 3 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…
On-The-Fly Algorithm for Reachability in Parametric Timed Games (Extended Version)
Mikael Bisgaard Dahlsen-Jensen, Baptiste Fievet, Laure Petrucci +1
Parametric Timed Games (PTG) are an extension of the model of Timed Automata. They allow for the verification and synthesis of real-time systems, reactive to their environmeand dep…