loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Fifth International Conference on Computer and Information Technology (CIT'05)
Efficient Deadlock-Freeness Detection in Real-time Systems
Shanghai, China
September 21-September 23
ISBN: 0-7695-2432-X
Peng Rong, Wuhan University
Cui Jingsong, Wuhan University
Pan Yue, Wuhan University

A Time-Action-Lock (TAL) is a state of a real-time system at which neither time can progress nor an action can occur. B. Behzad and O. Kozo presented a TAL-freeness detection method based on the geometry of Timed Automata. It is realized by means of translating the problem to Rational Presburger Sentences that has its drawback of inefficiency. In this paper, we present an algebraic approach for TALfreeness detection, which can dramatically improve the performance of the method previously published. Detailed correctness proofs and performance analysis are provided.

Citation:
Peng Rong, Cui Jingsong, Pan Yue, "Efficient Deadlock-Freeness Detection in Real-time Systems," cit, pp.805-809, Fifth International Conference on Computer and Information Technology (CIT'05), 2005
Usage of this product signifies your acceptance of the Terms of Use.