This paper describes ongoing work on the automatic construction of formal models from Real-Time implementations. The model construction is based on measurements of the timed behavior of the threads of an implementation, their causal interaction patterns and external visible events. A specification of the timed behavior is modeled in timed automata and checked against the generated model in orde...

In this Chapter, we review the main results pertaining to the problem of fault diagnosis of timed automata. Timed automata are introduced in Chapter 1 and Chapter 2 in this book, and the reader not familiar with this model is invited to read them first.

ion obtained with Qian et al.’s method: A = {A3, a, u} A1 u := a

In this paper we study conciseness of various extensions of timed automata, and prove that several features like diagonal constraints or updates lead to exponentially more concise timed models.

We write the relations that characterize the simpliest timed automaton, the inertial delay buffer, in two versions: the non-deterministic and the deterministic one, by making use of the derivatives of the } 1 , 0 { → R functions.

We propose in this paper a construction for a “well known” result: regular signal-event languages are closed by intersection. In fact, while this result is indeed trivial for languages defined by Alur and Dill’s timed automata (the proof is an immediate extension of the one in the untimed case), it turns out that the construction is much more tricky when considering the most involved model of s...

The e cient representation and manipulation of time information is key to any successful implementation of a veri cation tool. Two slightly di erent models of timed automata have been proposed in [Dil89] and [ACD90]. We extend the syntax and semantics of the higher level speci cation language PROMELA to include constructs and statements based on the above models. We implement this extensions on...