uu.seUppsala University Publications
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Zone-Based Universality Analysis for Single-Clock Timed Automata
Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computer Systems.
2007 (English)In: International Symposium on Fundamentals of Software Engineering, Proceedings / [ed] Arbab F; Sirjani M, 2007, 98-112 p.Conference paper, Published paper (Refereed)
Abstract [en]

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 a region-based constraint system and suffer from constraint explosion even for small examples. In this paper, we present a zone-based algorithm for solving the universality problem for single-clock timed automata. We apply the theory of better quasi-orderings, a refinement of the theory of well quasi-orderings, to prove termination of the algorithm. We have implemented a prototype based on our method, and checked universality for a number of timed automata. Comparisons with a region-based prototype confirm that zones are a more succinct representation, and hence allow a much more efficient implementation of the universality algorithm.

Place, publisher, year, edition, pages
2007. 98-112 p.
Series
Lecture Notes in Computer Science, ISSN 0302-9743 ; 4767
National Category
Computer and Information Science
Identifiers
URN: urn:nbn:se:uu:diva-10732ISI: 000250913500007ISBN: 978-3-540-75697-2 (print)OAI: oai:DiVA.org:uu-10732DiVA: diva2:38500
Conference
International Symposium on Fundamentals of Software Engineering Tehran, IRAN, APR 17-19, 2007
Available from: 2007-05-21 Created: 2007-05-21 Last updated: 2011-04-14Bibliographically approved

Open Access in DiVA

No full text

Authority records BETA

Abdulla, Parosh

Search in DiVA

By author/editor
Abdulla, Parosh
By organisation
Computer Systems
Computer and Information Science

Search outside of DiVA

GoogleGoogle Scholar

isbn
urn-nbn

Altmetric score

isbn
urn-nbn
Total: 391 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf