11 citations · 13 across the 5 of their papers we have counts for
5 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…
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…
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…
Bandwidth of Timed Automata: 3 Classes
Eugene Asarin, Aldric Degorre, Catalin Dima +1
Timed languages contain sequences of discrete events ("letters'') separated by real-valued delays, they can be recognized by timed automata, and represent behaviors of various real…
Entropy Games and Matrix Multiplication Games
Eugene Asarin, Julien Cervelle, Aldric Degorre +3
Two intimately related new classes of games are introduced and studied: entropy games (EGs) and matrix multiplication games (MMGs). An EG is played on a finite arena by two-and-a-h…