Sampled Universality of Timed Automata

DOI10.1007/978-3-540-71389-0_2MaRDI QIDQ5758054zbMATH OpenOpenAlexFDO

Authors Pavel Krčál, Wang Yi, Parosh A. Abdulla

Publication date 7 September 2007

Published in Foundations of Software Science and Computational Structures (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-71389-0_2

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Sampled semantics of timed automata
• FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
• Undecidability of Universality for Timed Automata with Minimal Resources
• Universality analysis for one-clock timed automata
• Emptiness and universality problems in timed automata with positive frequency

Cited in

(7)

• Sampled semantics of timed automata
• Emptiness and universality problems in timed automata with positive frequency
• R-Automata
• scientific article; zbMATH DE number 1956642 (Why is no real title available?)
• Robust reachability in timed automata and games: a game-based approach
• Universality of R-automata with Value Copying
• FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science

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

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