Skip to Main content Skip to Navigation

Volumetry of timed languages and applications

Abstract : Since early 90s, timed automata and timed languages are extensively used for modelling and verification of real-time systems, and thoroughly explored from a theoretical standpoint. Recently Asarin and Degorre introduced the notions of volume and entropy of timed languages to quantify the size of these languages and the information content of their elements. In this thesis we build new developments of this theory (called by us volumetry of timed languages) and apply it to several problems occurring in various domains of theoretical computer science such as verification, enumerative combinatorics or information theory. Among other we (i) develop a theory of timed symbolic dynamics; (ii) characterize a dichotomy between bad behaving and well behaving timed automata; (iii) define a least biased stochastic process for a timed automaton; (iv) develop a timed theory of constrained channel coding; (v)count and generate randomly and uniformly permutations in certain classes
Document type :
Complete list of metadata

Cited literature [78 references]  Display  Hide  Download
Contributor : Abes Star :  Contact
Submitted on : Tuesday, February 16, 2016 - 11:03:07 AM
Last modification on : Wednesday, February 3, 2021 - 7:54:27 AM
Long-term archiving on: : Tuesday, May 17, 2016 - 10:09:23 AM


Version validated by the jury (STAR)


  • HAL Id : tel-01274729, version 1


Nicolas Basset. Volumetry of timed languages and applications. Document and Text Processing. Université Paris-Est, 2013. English. ⟨NNT : 2013PEST1073⟩. ⟨tel-01274729⟩



Record views


Files downloads