Entropy of regular timed languages
From MaRDI portal
Publication:2343131
DOI10.1016/j.ic.2015.03.003zbMath1309.68114MaRDI QIDQ2343131
Aldric Degorre, Nicolas Basset, Eugene Asarin
Publication date: 4 May 2015
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ic.2015.03.003
Related Items
Testing membership for timed automata, Wordgen : a Timed word Generation Tool, Counting and generating permutations in regular classes, Timed Symbolic Dynamics
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Factorization forests of finite height
- Robust safety of timed automata
- A theory of timed automata
- Descent pattern avoidance
- Perturbation theory for linear operators.
- Dynamical properties of timed automata
- Non-negative matrices and Markov chains.
- Almost ASAP semantics: from timed models to timed implementations
- Sampled Semantics of Timed Automata
- Robust Controller Synthesis in Timed Automata
- Spectral Gap in Timed Automata
- Generating Functions of Timed Languages
- Thin and Thick Timed Regular Languages
- Volume and Entropy of Regular Timed Languages: Discretization Approach
- Timed regular expressions
- Finite state languages
- Hypervolume Approximation in Timed Automata Model Checking
- Efficient Detection of Zeno Runs in Timed Automata
- Volume and Entropy of Regular Timed Languages: Analytic Approach
- Periods of Connected Networks and Powers of Nonnegative Matrices
- Toward a Timed Theory of Channel Coding
- Frequencies in Forgetful Timed Automata
- An Introduction to Symbolic Dynamics and Coding
- What good are digital clocks?
- A Maximal Entropy Stochastic Process for a Timed Automaton,
- Counting and Generating Permutations Using Timed Languages
