77 citations · 145 across the 23 of their papers we have counts for
23 papers
Weighing Timed Regular Languages: The Final Step (long version)
Eugene Asarin, Aldric Degorre, Catalin Dima +1
The bandwidth of a timed language characterizes the quantity of information per time unit (with a finite observation precision ). The asymptotic behavior of the bandwi…
Bridging Threat Models and Detections: Formal Verification via CADP
Dumitru-Bogdan Prelipcean, Cătălin Dima
Threat detection systems rely on rule-based logic to identify adversarial behaviors, yet the conformance of these rules to high-level threat models is rarely verified formally. We…
Weighing Obese Timed Languages
Eugene Asarin, Aldric Degorre, Catalin Dima +1
The bandwidth of a timed language characterizes the quantity of information per time unit (with a finite observation precision ). Obese timed automata have an unbounde…
Deciding the synthesis problem for hybrid games through bisimulation
Catalin Dima, Mariem Hammami, Youssouf Oualhadj +1
Hybrid games are games played on a finite graph endowed with real variables which may model behaviors of discrete controllers of continuous systems. The synthesis problem for hybri…
Computing the Bandwidth of Meager Timed Automata
Eugene Asarin, Aldric Degorre, Catalin Dima +1
The bandwidth of timed automata characterizes the quantity of information produced/transmitted per time unit. We previously delimited 3 classes of TA according to the nature of the…
Controller Synthesis in Timed Büchi Automata: Robustness and Punctual Guards
Benoît Barbot, Damien Busatto-Gaston, Catalin Dima +1
We consider the synthesis problem on timed automata with Büchi objectives, where delay choices made by a controller are subjected to small perturbations. Usually, the controller ne…