LOGIN TO YOUR ACCOUNT

Username
Password
Remember Me
Or use your Academic/Social account:

CREATE AN ACCOUNT

Or use your Academic/Social account:

Congratulations!

You have just completed your registration at OpenAire.

Before you can login to the site, you will need to activate your account. An e-mail will be sent to you with the proper instructions.

Important!

Please note that this site is currently undergoing Beta testing.
Any new content you create is not guaranteed to be present to the final version of the site upon release.

Thank you for your patience,
OpenAire Dev Team.

Close This Message

CREATE AN ACCOUNT

Name:
Username:
Password:
Verify Password:
E-mail:
Verify E-mail:
*All Fields Are Required.
Please Verify You Are Human:
fbtwitterlinkedinvimeoflicker grey 14rssslideshare1
Gomez, Rodolfo (2008)
Publisher: UKC
Languages: English
Types: Book
Subjects: QA76
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.

Share - Bookmark

Download from

Cite this article