Abstract
To study the size of regular timed languages, we generalize a classical approach introduced by Chomsky and Miller for discrete automata: count words having n symbols, and compute the exponential growth rate of their number (entropy). For timed automata, we replace cardinality by volume and define (volumetric) entropy similarly. It represents the average quantity of information per event in a timed word of the language. We exhibit a criterion for telling apart “thick” timed automata with non-vanishing entropy, for which typical runs are non-Zeno and discretizable, from “thin” automata for which all runs behave in a Zeno-like way, implying a quick volume collapse. We associate to every timed automaton a positive integral operator; the entropy equals the logarithm of its spectral radius. This operator has a spectral gap, thus allowing for fast converging numerical procedures to approximate entropy. In a special case, entropy is even characterized symbolically.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
