Undecidability of Universality for Timed Automata with Minimal Resources

DOI10.1007/978-3-540-75454-1_4zbMath1141.68423OpenAlexW2116411132MaRDI QIDQ3510831

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

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

Related Items (2)

An Introduction to Timed Automata ⋮ Detectability of labeled weighted automata over monoids

Uses Software

• Uppaal

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