Sampled Semantics of Timed Automata

DOI10.2168/LMCS-6(3:14)2010zbMath1214.68195arXiv1007.2783OpenAlexW3100372325MaRDI QIDQ2786131

Wang Yi, Pavel Krcal, Parosh Aziz Abdulla

Publication date: 21 September 2010

Published in: Logical Methods in Computer Science (Search for Journal in Brave)

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

zbMATH Keywords

samplingtimed automatadecidabilitylimitedness

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (6)

Thin and Thick Timed Regular Languages ⋮ A survey of timed automata for the development of real-time systems ⋮ Robust reachability in timed automata and games: a game-based approach ⋮ Progress-preserving Refinements of CTA ⋮ Timed Automata Can Always Be Made Implementable ⋮ Entropy of regular timed languages

This page was built for publication: Sampled Semantics of Timed Automata