Thin and thick timed regular languages

DOI10.1007/978-3-642-24310-3_9zbMATH Open1348.68091OpenAlexW124063618MaRDI QIDQ3172847FDOQ3172847

Eugene Asarin, Nicolas Basset

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

Recommendations

• Entropy of regular timed languages
• Volume and Entropy of Regular Timed Languages: Discretization Approach
• Volume and entropy of regular timed languages: analytic approach
• A nonarchimedian discretization for timed languages
• Formal Modeling and Analysis of Timed Systems

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• Computing the Continuous Discretely
• A theory of timed automata
• Mean topological dimension
• Title not available (Why is that?)
• Title not available (Why is that?)
• Volume and Entropy of Regular Timed Languages: Discretization Approach
• Robust safety of timed automata
• Almost ASAP semantics: from timed models to timed implementations
• Sampled semantics of timed automata
• Title not available (Why is that?)
• Volume and entropy of regular timed languages: analytic approach
• Efficient Detection of Zeno Runs in Timed Automata
• Dynamical properties of timed automata
• Foundations of Software Science and Computation Structures
• Factorization forests of finite height
• Title not available (Why is that?)
• Two size measures for timed languages

Cited In (6)

• A maximal entropy stochastic process for a timed automaton
• Probabilistic timed automata with clock-dependent probabilities
• Two size measures for timed languages
• Entropy of regular timed languages
• Generating Functions of Timed Languages
• Timed Symbolic Dynamics

This page was built for publication: Thin and thick timed regular languages

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3172847)