Undecidability of Universality for Timed Automata with Minimal Resources

DOI10.1007/978-3-540-75454-1_4MaRDI QIDQ3510831zbMATH OpenOpenAlexFDO

Authors Sara Adams, Joël Ouaknine, James Worrell

Publication date 3 July 2008

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.96.1077

Mathematics Subject Classification ID

Undecidability and degrees of sets of sentences (03D35) Formal languages and automata (68Q45)

Recommendations

• Classes of timed automata and the undecidability of universality
• Universality analysis for one-clock timed automata
• Classes of timed automata and the undecidability of universality
• scientific article; zbMATH DE number 1956642
• A theory of timed automata

Cited in

(11)

• An undecidable problem for timed automata
• Detectability of labeled weighted automata over monoids
• Time-Bounded Reachability Problem for Recursive Timed Automata is Undecidable
• Classes of timed automata and the undecidability of universality
• Zone-Based Universality Analysis for Single-Clock Timed Automata
• Universality analysis for one-clock timed automata
• Classes of timed automata and the undecidability of universality
• An introduction to timed automata
• Formal Modeling and Analysis of Timed Systems
• Sampled Universality of Timed Automata
• Folk theorems on the determinization and minimization of timed automata

Describes a project that uses

Uses Software

• Uppaal

This page was built for publication: Undecidability of Universality for Timed Automata with Minimal Resources

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