From HUPPAAL to UPPAAL - A Translation from Hierarchical Timed Automata to Flat Timed Automata

Hierarchical Timed Automata for UPPAAL

From MITL to Timed Automata

We show how to transform formulae written in the real-time temporal logic MITL into timed automata that recognize their satisfying models. This compositional construction is much simpler than previously known and can be easily implemented. Prediction is very difficult, especially about the future. Niels Bohr

From Scenarios to Timed Automata

We describe a new method of synthesizing a formal model for real-time systems from scenarios. Scenarios, formally defined as Timed Event Sequences, together with mode graphs are used to describe behaviors of real-time systems. Given a set of Timed Event Sequences and a mode graph, our synthesis method constructs a minimal, acyclic, deterministic timed automaton that models the specified aspects...

MightyL: A Compositional Translation from MITL to Timed Automata

The design of critical software that respect real-time specifications is a notoriously difficult problem. In this context, verification of programs against formal specifications is crucial, in order to handle the thin timing behaviours. In the untimed setting, a logic widely used both in academia and industry is Linear Temporal Logic (LTL) [16]. A crucial ingredient of its success is the possib...

Structural translation from Time Petri Nets to Timed Automata

In this paper, we consider Time Petri Nets (TPN) where time is associated with transitions. We give a formal semantics for TPNs in terms of Timed Transition Systems. Then, we propose a translation from TPNs to Timed Automata (TA) that preserves the behavioral semantics (timed bisimilarity) of the TPNs. For the theory of TPNs this result is two-fold: i) reachability problems and more generally T...