Ändra sökning
RefereraExporteraLänk till posten
Permanent länk

Direktlänk
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annat format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annat språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf
Zone-Based Universality Analysis for Single-Clock Timed Automata
Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorteknik.
2007 (Engelska)Ingår i: International Symposium on Fundamentals of Software Engineering, Proceedings / [ed] Arbab F; Sirjani M, 2007, 98-112 s.Konferensbidrag, Publicerat paper (Refereegranskat)
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.

Ort, förlag, år, upplaga, sidor
2007. 98-112 s.
Serie
Lecture Notes in Computer Science, ISSN 0302-9743 ; 4767
Nationell ämneskategori
Data- och informationsvetenskap
Identifikatorer
URN: urn:nbn:se:uu:diva-10732ISI: 000250913500007ISBN: 978-3-540-75697-2 (tryckt)OAI: oai:DiVA.org:uu-10732DiVA: diva2:38500
Konferens
International Symposium on Fundamentals of Software Engineering Tehran, IRAN, APR 17-19, 2007
Tillgänglig från: 2007-05-21 Skapad: 2007-05-21 Senast uppdaterad: 2011-04-14Bibliografiskt granskad

Open Access i DiVA

Fulltext saknas

Personposter BETA

Abdulla, Parosh

Sök vidare i DiVA

Av författaren/redaktören
Abdulla, Parosh
Av organisationen
Datorteknik
Data- och informationsvetenskap

Sök vidare utanför DiVA

GoogleGoogle Scholar

isbn
urn-nbn

Altmetricpoäng

isbn
urn-nbn
Totalt: 381 träffar
RefereraExporteraLänk till posten
Permanent länk

Direktlänk
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annat format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annat språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf