Weighing Obese Timed Languages
Fuente:
arXiv
Gespeichert in:
| Hauptverfasser: | , , , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2025
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866908502187835392 |
|---|---|
| author | Asarin, Eugene Degorre, Aldric Dima, Catalin Inclán, Bernardo Jacobo |
| author_facet | Asarin, Eugene Degorre, Aldric Dima, Catalin Inclán, Bernardo Jacobo |
| contents | The bandwidth of a timed language characterizes the quantity of information per time unit (with a finite observation precision $\varepsilon$). Obese timed automata have an unbounded frequency of events and produce information at the maximal possible rate. In this article, we compute the bandwidth of any such automaton in the form $\approxα/\varepsilon$. Our approach reduces the problem to computing the best reward-to-time ratio in a weighted timed graph constructed from the given timed automaton, with weights corresponding to the entropy of auxiliary finite automata. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2508_18133 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Weighing Obese Timed Languages Asarin, Eugene Degorre, Aldric Dima, Catalin Inclán, Bernardo Jacobo Formal Languages and Automata Theory 68Q70, 68Q45, 68P30 F.4.3; E.4; F.1.1 The bandwidth of a timed language characterizes the quantity of information per time unit (with a finite observation precision $\varepsilon$). Obese timed automata have an unbounded frequency of events and produce information at the maximal possible rate. In this article, we compute the bandwidth of any such automaton in the form $\approxα/\varepsilon$. Our approach reduces the problem to computing the best reward-to-time ratio in a weighted timed graph constructed from the given timed automaton, with weights corresponding to the entropy of auxiliary finite automata. |
| title | Weighing Obese Timed Languages |
| topic | Formal Languages and Automata Theory 68Q70, 68Q45, 68P30 F.4.3; E.4; F.1.1 |
| url | https://arxiv.org/abs/2508.18133 |