Universality and language inclusion for open and closed timed automata

Authors:
Joël Ouaknine;James Worrell
Affiliations:
Computer Science Department, Carnegie Mellon University, Pittsburgh, PA;Department of Mathematics, Tulane University, New Orleans, LA
Venue:
HSCC'03 Proceedings of the 6th international conference on Hybrid systems: computation and control
Year:
2003

Citing 5
Cited 10

A theory of timed automata

Theoretical Computer Science
Event-clock automata: a determinizable class of timed automata

Theoretical Computer Science
What Good Are Digital Clocks?

ICALP '92 Proceedings of the 19th International Colloquium on Automata, Languages and Programming
On Discretization of Delays in Timed Automata and Digital Circuits

CONCUR '98 Proceedings of the 9th International Conference on Concurrency Theory
Robust Timed Automata

HART '97 Proceedings of the International Workshop on Hybrid and Real-Time Systems

Universality Analysis for One-Clock Timed Automata

Fundamenta Informaticae - Fundamentals of Software Engineering 2007: Selected Contributions
Time-Bounded Verification

CONCUR 2009 Proceedings of the 20th International Conference on Concurrency Theory
Closed, Open, and Robust Timed Networks

Electronic Notes in Theoretical Computer Science (ENTCS)
Sampled universality of timed automata

FOSSACS'07 Proceedings of the 10th international conference on Foundations of software science and computational structures
Zone-based universality analysis for single-clock timed automata

FSEN'07 Proceedings of the 2007 international conference on Fundamentals of software engineering
Undecidability of universality for timed automata with minimal resources

FORMATS'07 Proceedings of the 5th international conference on Formal modeling and analysis of timed systems
Towards a theory of time-bounded verification

ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming: Part II
Decidability and complexity results for timed automata via channel machines

ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Verification, performance analysis and controller synthesis for real-time systems

FSEN'09 Proceedings of the Third IPM international conference on Fundamentals of Software Engineering
Universality Analysis for One-Clock Timed Automata

Fundamenta Informaticae - Fundamentals of Software Engineering 2007: Selected Contributions

Quantified Score

Hi-index	0.00

Visualization

Abstract

The algorithmic analysis of timed automata is fundamentally limited by the undecidability of the universality problem. For this reason and others, there has been considerable interest in restricted classes of timed automata. In this paper we study the universality problem for two prominent such subclasses: open and closed timed automata. This problem is described as open in [6,8] in the case of open timed automata. We show here that the problem is undecidable for open timed automata over strongly monotonic time (no two events are allowed to occur at the same time), and decidable over weakly monotonic time. For closed timed automata, we show that the problem is undecidable regardless of the monotonicity assumptions on time. As a corollary, we settle the various language inclusion problems over these classes of timed automata.