School of Computing

Time and action lock freedom properties of timed automata

Howard Bowman

In M. Kim, B. Chin, S. Kang, and D. Lee, editors, Formal Techniques for Networked and Distributed Systems, pages 182-196. Kluwer Academic Publishers, August 2001.

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.



Bibtex Record

@inproceedings{1299,
author = {Howard Bowman},
title = {Time and Action Lock Freedom Properties of Timed Automata},
month = {August},
year = {2001},
pages = {182-196},
keywords = {determinacy analysis, Craig interpolants},
note = {},
doi = {},
url = {http://www.cs.kent.ac.uk/pubs/2001/1299},
    publication_type = {inproceedings},
    submission_id = {19183_1001584291},
    booktitle = {Formal Techniques for Networked and Distributed Systems},
    editor = {M. Kim and B. Chin and S. Kang and D. Lee},
    publisher = {Kluwer Academic Publishers},
    refereed = {yes},
}

School of Computing, University of Kent, Canterbury, Kent, CT2 7NF

Enquiries: +44 (0)1227 824180 or contact us.

Last Updated: 21/03/2014