Axiomatizing Timed Automata with Deadlines

Pedro R. D'Argenio and B. Gebremichael
submitted to the 17th International Conference on Concurrency Theory (CONCUR 06) Bonn, Germany, August 27-30, 2006.

Abstract

It is known that the usual timed bisimulation fails to be a congruence for timed automata with deadlines a variant of timed automata where component synchronization is delayable, and time progress is controlled by deadlines on transitions instead of invariants on locations. Recently (in CONCUR 05 paper) , we found the coarsest congruence relation that is included in timed bisimulation for timed automata with deadlines. In the present paper we provide an algebraic proof system for direct derivation of such relation by syntactic manipulation. We establish that the proof system is sound and complete.

CONCUR 06 submission version
technical report version


By biniam (at) cs.kun.nl. Last modified March 2006