Timed automata (TA) are widely used to model and verify real-time systems. In a TA, the real valued variables, called clocks, measure the time passed between events. The verification of TA is exponential in the number of clocks. That constitutes a bottleneck for its application in large systems. To address this issue, we propose a novel clock reduction method. We aim at reducing the number of clocks by developing a position (location and transition) based mapping for clocks. Motivated by that the locations and transitions of the automaton reflect the modeled system's physical properties and design parameters; the proposed method changes the clock constraints based on their positions to reduce the total number of clocks. To guarantee correct...
Abstract. By definition Timed Automata have an infinite state-space, thus for verification purposes,...
A proof system for timed automata is presented, based on a CCS-style language for describing timed a...
Timed automata follow a mathematical semantics, which assumes perfect precision and synchrony of clo...
We propose a method for reducing the number of clocks of a timed automaton by combining two algorith...
We define and study a new approach to the implementability of timed automata, where the semantics is...
The formalism of parametric timed automata provides designers with a formal way to specify and verif...
The formalism of parametric timed automata provides designers with a formal way to specify and verif...
We define and study a new approach to the implementability of timed automata, where the semantics is...
Abstract. We introduce the novel notion of quasi-equal clocks and use it to improve the verification...
We define and study a new approach to the implementability of timed automata, where the semantics is...
. Model checking is emerging as a practical tool for automated debugging of complex reactive systems...
During the past few years, a number of verification tools have been developed for real--time systems...
During the past few years, a number of verification tools have been developed for real-time systems ...
International audienceWe consider the problem of synthesizing controllers for real-time systems wher...
Abstract In real-time systems, correctness depends on the time at which events occur. Examples of re...
Abstract. By definition Timed Automata have an infinite state-space, thus for verification purposes,...
A proof system for timed automata is presented, based on a CCS-style language for describing timed a...
Timed automata follow a mathematical semantics, which assumes perfect precision and synchrony of clo...
We propose a method for reducing the number of clocks of a timed automaton by combining two algorith...
We define and study a new approach to the implementability of timed automata, where the semantics is...
The formalism of parametric timed automata provides designers with a formal way to specify and verif...
The formalism of parametric timed automata provides designers with a formal way to specify and verif...
We define and study a new approach to the implementability of timed automata, where the semantics is...
Abstract. We introduce the novel notion of quasi-equal clocks and use it to improve the verification...
We define and study a new approach to the implementability of timed automata, where the semantics is...
. Model checking is emerging as a practical tool for automated debugging of complex reactive systems...
During the past few years, a number of verification tools have been developed for real--time systems...
During the past few years, a number of verification tools have been developed for real-time systems ...
International audienceWe consider the problem of synthesizing controllers for real-time systems wher...
Abstract In real-time systems, correctness depends on the time at which events occur. Examples of re...
Abstract. By definition Timed Automata have an infinite state-space, thus for verification purposes,...
A proof system for timed automata is presented, based on a CCS-style language for describing timed a...
Timed automata follow a mathematical semantics, which assumes perfect precision and synchrony of clo...