This report presents the transformation of behavioral VHDL programs to Timed Automata.

In this paper, we define the class of hourglass automata, which are timed automata with bounded clocks that can be made to progress backwards as well as forwards at a constant rate. We then introduce a new clock update for timed automata that allows hourglass automata to be expressed. This allows us to show that language emptiness remains decidable with this update when the number of clocks is ...

The paper presents a new method for checking reachability properties of Timed Automata. The idea consists in on-the-fly verification of a property on a pseudo-bisimulating model generated by a modified partitioning algorithm. Pseudo-bisimulating models are often much smaller than forward-reachability graphs commonly used in reachability analysis. A theoretical description of the algorithm is su...

ion Inputs A , h {h = abstraction function} Ŝ := ∅, →̂ := ∅ {M̂ = (Ŝ, ŝ0, →̂)} foreach l ∈ L do Ŝ := Ŝ ∪ {h(l)} end for ŝ0 := h(l0) foreach (l1, a, g, r, l2) ∈ T do →:=→ ∪{(h(l1), h(l2))} end for return M̂

This article deals with a humanmodel of interaction based on a psychological experiment. It presents an original architecture called BDIGGY where interaction and planning are linked homogeneously thanks to the BDI concept. BDIGGY includes a model of human interaction which is twofold : 1) it is based on the Speech Act theory to model the utterances ; 2) it uses a discourse model, represented by...

From a highly distributed timed automata specification, the paper analyses an implementation in the form of a looping controller, launching possibly many tasks in each cycle. Qualitative and quantitative constraints are distinguished on the specification to allow such an implementation, and the analysis of the semantic differences between the specification and the implementation leads to define...

We present a tool for the robustness analysis of timed automata, that can check whether a given time-abstract behaviour of a timed automaton is still present when the guards are perturbed. The perturbation model we consider is shrinking, which corresponds to increasing lower bounds and decreasing upper bounds in the clock guards by parameters. The tool synthesizes these parameters for which the...