Bowman, Howard (2001) Time and Action Lock Freedom Properties of Timed Automata. In: Kim, Myungchul and Chin, Byoungmoon and Kang, Sungwon and Lee, Danhyung, eds. Formal Techniques for Networked and Distributed Systems. . pp. 119-134. Kluwer Academic Publishers (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided) (KAR id:13578)
The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided. |
Abstract
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: | Divisions > Division of Computing, Engineering and Mathematical Sciences > School of Computing |
Depositing User: | Mark Wheadon |
Date Deposited: | 24 Nov 2008 17:59 UTC |
Last Modified: | 05 Nov 2024 09:47 UTC |
Resource URI: | https://kar.kent.ac.uk/id/eprint/13578 (The current URI for this page, for reference purposes) |
- Export to:
- RefWorks
- EPrints3 XML
- BibTeX
- CSV
- Depositors only (login required):