Bowman, H. (2001) Time and Action Lock Freedom Properties of Timed Automata. In: Formal Techniques for Networked and Distributed Systems.
|The full text of this publication is not available from this repository. (Contact us about this Publication)|
Time and action locks can arise freely in timed automata specification. We review techniques for avoiding the occurrence of timelocks, based on the Timed Automata with Deadlines framework. Then we present 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:||Conference or workshop item (Paper)|
|Uncontrolled keywords:||Timed Automata, Timelocks|
|Subjects:||Q Science > QA Mathematics (inc Computing science) > QA 76 Software, computer programming,|
|Divisions:||Faculties > Science Technology and Medical Studies > School of Computing > Theoretical Computing Group|
|Depositing User:||Mark Wheadon|
|Date Deposited:||24 Nov 2008 17:59|
|Last Modified:||20 Apr 2012 11:32|
|Resource URI:||http://kar.kent.ac.uk/id/eprint/13578 (The current URI for this page, for reference purposes)|
- Depositors only (login required):