Bowman, Howard (1999) On Time and Action Lock Free Description of Timed Systems. Technical report. (KAR id:21729)
PDF
Language: English |
|
Download this file (PDF/427kB) |
![]() |
Request a format suitable for use with assistive technology e.g. a screenreader | |
Postscript
Language: English |
|
Download this file (Postscript/919kB) |
Preview |
Request a format suitable for use with assistive technology e.g. a screenreader |
Abstract
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: | Reports and Papers (Technical report) |
---|---|
Uncontrolled keywords: | Timed Automata, Timelocks |
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: | 04 Sep 2009 10:03 UTC |
Last Modified: | 16 Nov 2021 10:00 UTC |
Resource URI: | https://kar.kent.ac.uk/id/eprint/21729 (The current URI for this page, for reference purposes) |
- Link to SensusAccess
- Export to:
- RefWorks
- EPrints3 XML
- BibTeX
- CSV
- Depositors only (login required):