Skip to main content

On Time and Action Lock Free Description of Timed Systems

Bowman, Howard (1999) On Time and Action Lock Free Description of Timed Systems. Technical report. (KAR id:21729)

Language: English
Download (821kB) Preview
Language: English
Download (919kB) Preview


Time and action locks can arise freely in timed automata specification. While both are error situations, time locks are by far the more serious fault. This is because their occurrence prevents any further evolution of the system. First we investigate techniques for avoiding the occurrence of timelocks. The central aspect of our solution is a redefinition of automata parallel composition based on the Timed Automata with Deadlines Framework of Bornot and Sifakis. Then the second result we present is a notion of parallel composition which preserves action lock freeness. In the sense that, if any component automaton is action lock free, then the composition will also be action lock free.

Item Type: Monograph (Technical report)
Uncontrolled keywords: Timed Automata, Timelocks
Subjects: Q Science > QA Mathematics (inc Computing science) > QA 76 Software, computer programming,
Divisions: Faculties > Sciences > School of Computing > Theoretical Computing Group
Depositing User: Mark Wheadon
Date Deposited: 04 Sep 2009 10:03 UTC
Last Modified: 09 Feb 2020 04:03 UTC
Resource URI: (The current URI for this page, for reference purposes)
Bowman, Howard:
  • Depositors only (login required):


Downloads per month over past year