Location of Repository

Verification of Timed Automata with Deadlines in Uppaal

By Rodolfo Gomez

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

Topics: QA76
Publisher: UKC
Year: 2008
OAI identifier: oai:kar.kent.ac.uk:23991

Suggested articles

Preview

Citations

  1. A temporal calculus of communicating systems. doi
  2. (1994). A theory of timed automata. doi
  3. (2004). A tutorial on Uppaal. doi
  4. (2001). Analysis of a biphase mark protocol with Uppaal and PVS. doi
  5. (2006). Analysis of the zeroconf protocol using Uppaal. doi
  6. (1998). Automatic verification of a lip synchronization protocol using uppaal. doi
  7. (1996). Compositional specification of timed systems. doi
  8. (2006). Concurrency Theory, Calculi and Automata for Modelling Untimed and Timed Concurrent Systems.
  9. (2001). Formal design and analysis of a gearbox controller. doi
  10. (1997). Formal modeling and analysis of an audio/video protocol: an industrial case study using Uppaal. doi
  11. (2006). How to stop time stopping. doi
  12. (1997). Kronos: A verification tool for real-time systems. doi
  13. (1998). Modeling urgency in timed systems. doi
  14. (2001). MoDeST - a modelling and description language for stochastic timed systems. doi
  15. (2007). MOTOR: The MODEST tool environment. doi
  16. (1998). On the composition of hybrid systems. doi
  17. (1983). Results on the propositional mu-calculus. doi
  18. (1994). Symbolic model checking for real-time systems. doi
  19. (2004). The IF toolset. doi
  20. (2003). The power of reachability testing for timed automata. doi
  21. (2001). Time and action lock freedom properties for timed automata. doi
  22. (2004). Timed automata with urgent transitions. doi

To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.