Bounded timed-arc Petri nets with read-arcs were recently proven equivalent to networks of timed automata, though the Petri net model cannot express urgent behaviour and the descri...
In this work we tackle the following problem: given a timed automaton, and a target set F of configurations, restrict its transition relation in a systematic way so that from ever...
We present formal definitions of stabilization for the Timed I/O Automata (TIOA) framework, and of emulation for the timed Virtual Stationary Automata programming abstraction laye...
Time dependant models have been intensively studied for many reasons, among others because of their applications in software verification and due to the development of embedded pla...
Timed automata (TA) are a widely used model for real-time systems. Several tools are dedicated to this model, and they mostly implement a forward analysis for checking reachability...