Emptiness and Universality Problems in Timed Automata with Positive Frequency

DOI10.1007/978-3-642-22012-8_19zbMath1333.68158arXiv1309.2842OpenAlexW1485977729MaRDI QIDQ3012924

Thomas Brihaye, Amélie Stainer, Nathalie Bertrand, Patricia Bouyer

Publication date: 7 July 2011

Published in: Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1309.2842

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60)

Cites Work

• Unnamed Item
• Unnamed Item
• A theory of timed automata
• Automatic verification of real-time systems with discrete probability distributions.
• Optimal infinite scheduling for multi-priced timed automata
• Recurrence and Transience for Probabilistic Automata.
• Quantitative languages
• Volume and Entropy of Regular Timed Languages: Discretization Approach
• Mean-Payoff Automaton Expressions
• On Omega-Languages Defined by Mean-Payoff Conditions
• CONCUR 2004 - Concurrency Theory

This page was built for publication: Emptiness and Universality Problems in Timed Automata with Positive Frequency