3 papers
cs.FL2026
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…
cs.CR2025
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…
cs.FL2025
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…