Classes of timed automata and the undecidability of universality

MaRDI QIDQ5450118zbMATH OpenFDO

Authors Guilherme A. Pinto, Arnaldo Vieira Moura

Publication date 19 March 2008

zbMATH Keywords

analytic hierarchytimed automata: universality

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05) Hierarchies of computability and definability (03D55) Undecidability and degrees of sets of sentences (03D35)

Recommendations

• Classes of timed automata and the undecidability of universality
• scientific article; zbMATH DE number 1956642
• Undecidability of Universality for Timed Automata with Minimal Resources
• A theory of timed automata
• Foundations of Software Science and Computational Structures

Cited in

(8)

• Task automata: Schedulability, decidability and undecidability
• scientific article; zbMATH DE number 6515829 (Why is no real title available?)
• scientific article; zbMATH DE number 1956642 (Why is no real title available?)
• A perfect class of context-sensitive timed languages
• Undecidability of Universality for Timed Automata with Minimal Resources
• Classes of timed automata and the undecidability of universality
• Time-Bounded Reachability Problem for Recursive Timed Automata is Undecidable
• Unambiguity in Timed Regular Languages: Automata and Logics

This page was built for publication: Classes of timed automata and the undecidability of universality

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