Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Fundamenta Informaticae XX (2009) 133 1 Universality Analysis for One-Clock Timed Automata
 

Summary: Fundamenta Informaticae XX (2009) 1­33 1
IOS Press
Universality Analysis for One-Clock Timed Automata
Parosh Aziz Abdulla
Uppsala University
Johann Deneux
Uppsala University
Jošel Ouaknine
Oxford University
Karin Quaas
Leipzig University
James Worrell
Oxford University
Abstract. This paper is concerned with the universality problem for timed automata: given a timed
automaton A, does A accept all timed words? Alur and Dill have shown that the universality problem
is undecidable if A has two clocks, but they left open the status of the problem when A has a
single clock. In this paper we close this gap for timed automata over infinite words by showing
that the one-clock universality problem is undecidable. For timed automata over finite words we
show that the one-clock universality problem is decidable with non-primitive recursive complexity.
This reveals a surprising divergence between the theory of timed automata over finite words and over

  

Source: Abdulla, Parosh Aziz - Department of Information Technology, Uppsala Universitet

 

Collections: Computer Technologies and Information Sciences