Skip to main content
Kent Academic Repository

Verification of Timed Automata with Deadlines in Uppaal

Gomez, Rodolfo (2008) Verification of Timed Automata with Deadlines in Uppaal. Technical report. UKC (KAR id:23991)

Abstract

Timed Automata with Deadlines (TAD) is a notation to model concurrent real-time systems that has a number of advantages over mainstream Timed Automata (TA). The semantics of deadlines and synchronisation rule out the most common form of timelocks, making TAD more robust than TA w.r.t. formal verification. In addition, it is often the case that urgency is more naturally expressed with deadlines rather than invariants. However, with the exception of the IF Toolset, there are no real-time model-checkers which support TAD models. This paper extends the available tool support by offering a compositional translation from TAD networks to Uppaal's TA networks. The techniques presented in this paper allow users to benefit from Uppaal's GUI, modelling facilities and efficient verification algorithms to construct and analyze TAD models.

Item Type: Reports and Papers (Technical report)
Subjects: Q Science > QA Mathematics (inc Computing science) > QA 76 Software, computer programming,
Divisions: Divisions > Division of Computing, Engineering and Mathematical Sciences > School of Computing
Depositing User: Mark Wheadon
Date Deposited: 29 Mar 2010 12:09 UTC
Last Modified: 16 Nov 2021 10:02 UTC
Resource URI: https://kar.kent.ac.uk/id/eprint/23991 (The current URI for this page, for reference purposes)

University of Kent Author Information

Gomez, Rodolfo.

Creator's ORCID:
CReDIT Contributor Roles:
  • Depositors only (login required):

Total unique views for this document in KAR since July 2020. For more details click on the image.