Thin and Thick Timed Regular Languages
From MaRDI portal
Publication:3172847
DOI10.1007/978-3-642-24310-3_9zbMath1348.68091MaRDI QIDQ3172847
Publication date: 7 October 2011
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://hal-upec-upem.archives-ouvertes.fr/hal-00793583/file/FORMATS11.pdf
68Q45: Formal languages and automata
Related Items
Probabilistic timed automata with clock-dependent probabilities, Entropy of regular timed languages, A maximal entropy stochastic process for a timed automaton, Timed Symbolic Dynamics
Cites Work
- 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
- Mean topological dimension
- Dynamical properties of timed automata
- Almost ASAP semantics: from timed models to timed implementations
- Sampled Semantics of Timed Automata
- Volume and Entropy of Regular Timed Languages: Discretization Approach
- Computing the Continuous Discretely
- Efficient Detection of Zeno Runs in Timed Automata
- Volume and Entropy of Regular Timed Languages: Analytic Approach
- Foundations of Software Science and Computation Structures