The Coarsest Congruence for Timed Automata with Deadlines Contained in Bisimulation

Abstract. Delaying the synchronization of actions may reveal some hidden behavior that would not happen if the synchronization met the specified deadlines. This precise phenomenon makes bisimulation fail to be a congruence for the parallel composition of timed automata with deadlines, a variant of timed automata where time progress is controlled by deadlines imposed on each transition. This problem has been known and unsolved for several years. In this paper we give a characterization of the coarsest congruence that is included in the bisimulation relation. In addition, a symbolic characterization of such relation is provided and shown to be decidable. We also discuss the pitfalls of existing parallel compositions in this setting and argue that our definition is both reasonable and sufficiently expressive as to consider the modeling of both soft and hard real-time constraints.

• Type: Conference
• Year: 2005
• Where: CONCUR
• Authors: Pedro R. D'Argenio, Biniam Gebremichael
• Keywords: CONCUR 2005, Distributed And Parallel Computing, Parallel Compositions, Phenomenon Makes Bisimulation, Timed Automata