Journal article icon

Journal article

Zone-based universality analysis for single-clock timed automata

Abstract:

During the last years, timed automata have become a popular model for describing the behaviour of real-time systems. In particular, there has been much research on problems such as language inclusion and universality. It is well-known that the universality problem is undecidable for the class of timed automata with two or more clocks. Recently, it was shown that the problem becomes decidable if the automata are restricted to operate on a single clock variable. However, existing algorithms use...

Expand abstract

Actions


Authors


Journal:
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume:
4767 LNCS
Pages:
98-112
Publication date:
2007-01-01
EISSN:
1611-3349
ISSN:
0302-9743
URN:
uuid:714e9864-6e66-4a82-b95e-6f92b160ae92
Source identifiers:
289561
Local pid:
pubs:289561
Language:
English

Terms of use


Metrics


Views and Downloads






If you are the owner of this record, you can report an update to it here: Report update to this record

TO TOP