Factorization forests of finite height
Theoretical Computer Science - Special issue on theoretical computer science, algebra and combinatorics
Theoretical Computer Science
Dynamical Properties of Timed Automata
Discrete Event Dynamic Systems
Computing Reachability Relations in Timed Automata
LICS '02 Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science
ICALP '92 Proceedings of the 19th International Colloquium on Automata, Languages and Programming
On Discretization of Delays in Timed Automata and Digital Circuits
CONCUR '98 Proceedings of the 9th International Conference on Concurrency Theory
Timed Automata and the Theory of Real Numbers
CONCUR '99 Proceedings of the 10th International Conference on Concurrency Theory
Pumping Lemmas for Timed Automata
FoSSaCS '98 Proceedings of the First International Conference on Foundations of Software Science and Computation Structure
Robust Undecidability of Timed and Hybrid Systems
HSCC '00 Proceedings of the Third International Workshop on Hybrid Systems: Computation and Control
HART '97 Proceedings of the International Workshop on Hybrid and Real-Time Systems
Almost ASAP semantics: from timed models to timed implementations
Formal Aspects of Computing
Robust safety of timed automata
Formal Methods in System Design
State-Density Functions over DBM Domains in the Analysis of Non-Markovian Models
IEEE Transactions on Software Engineering
Volume and Entropy of Regular Timed Languages: Discretization Approach
CONCUR 2009 Proceedings of the 20th International Conference on Concurrency Theory
Volume and Entropy of Regular Timed Languages: Analytic Approach
FORMATS '09 Proceedings of the 7th International Conference on Formal Modeling and Analysis of Timed Systems
Efficient detection of Zeno runs in timed automata
FORMATS'07 Proceedings of the 5th international conference on Formal modeling and analysis of timed systems
Measuring information in timed languages
LATA'12 Proceedings of the 6th international conference on Language and Automata Theory and Applications
Generating functions of timed languages
MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
Toward a timed theory of channel coding
FORMATS'12 Proceedings of the 10th international conference on Formal Modeling and Analysis of Timed Systems
Frequencies in forgetful timed automata
FORMATS'12 Proceedings of the 10th international conference on Formal Modeling and Analysis of Timed Systems
A maximal entropy stochastic process for a timed automaton,
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part II
Robust controller synthesis in timed automata
CONCUR'13 Proceedings of the 24th international conference on Concurrency Theory
Spectral gap in timed automata
FORMATS'13 Proceedings of the 11th international conference on Formal Modeling and Analysis of Timed Systems
Hi-index | 0.00 |
In previous literature on timed automata, it was noticed that they are in several aspects too precise, which leads sometimes to strange artifacts, mathematical pathologies or unrealistic models. In particular, some timed automata are non-implementable, non-robust, behave badly under discretization, have many Zeno runs etc. In this paper, we propose a unifying approach to most of these issues for deterministic timed automata. We classify these automata either as thin or as thick. In thin automata, all the infinite trajectories are, in some weak sense, Zeno; the discretization of long trajectories is difficult, since it requires very small discretization step. In thick automata, most of trajectories are non-Zeno and behave well under discretization; such automata satisfy a sort of pumping lemma. Formally, the thin-thick alternative is based on the notion of entropy of timed regular languages introduced by E. Asarin and A. Degorre in [3,4]. Thin languages have the entropy = -∞ while thick have a larger one. An important application of thin-thick alternative is again the entropy theory of timed languages. We show that the entropy can be computed with a desired precision using discretization and thus it is computable, which closes a question left open in [3,4].