Showing cs.FLShow all
3 papers · 1 filter
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.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…
cs.FL2024
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…