An algorithm computes the bandwidth of normal timed automata by reducing the problem to finding the maximum reward-to-cost ratio in a weighted finite graph built from the automaton.
In: Reachability Problems
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.FL 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Weighing Timed Regular Languages: The Final Step (long version)
An algorithm computes the bandwidth of normal timed automata by reducing the problem to finding the maximum reward-to-cost ratio in a weighted finite graph built from the automaton.