National audienceThis paper deals with the representation of continuous system dynamics into a timed discrete-event formalism to the end of system analysis. The continuous model of the system is first approximated using intervals and then translated into the timed automata formalism by comparison with thresholds defined on the state variables' domains. The detection of thresholds crossing is characterised by two time instants corresponding respectively to the earliest and latest crossing dates. This approach is briefly illustrated with real data obtained from a 1 m3 wastewater treatment pilot plant
In this chapter we introduce a formalism, Time Petri Nets (TPNs), to model real-time systems. We com...
Abstract. A language for representing timed automata is introduced. Its semantics i defined in terms...
In order to approximate discrete-event systems in which there exist considerable states and events, ...
This paper deals with the representation of continuous system dynamics into a timed discrete-event f...
Abstracting 'continuous' system behaviours into discrete-event representations (i.e., timed automata...
. Model checking is emerging as a practical tool for automated debugging of complex reactive systems...
Timed systems can be modeled as automata (or, generally, discrete transi-tion structures) extended w...
International audienceThis chapter surveys timed automata as a formalism for model checking real-tim...
This paper shows how to abstract networks of timed automata in order to accelerate the analysis of q...
. We investigate the relationship between timed c/e systems [4] and timed automata [2]. We provide a...
. The past decade has witnessed a rapid development in the field of formal methods for the specifica...
We argue that timed models are a suitable framework for the detection of behavior in real-world even...
. We propose timed (finite) automata to model the behavior of realtime systems over time. Our defini...
International audienceWe introduce timed automata and show how they can be used for the specificatio...
Model checking is a technique to automatically analyse systems that have been modeled in a formal la...
In this chapter we introduce a formalism, Time Petri Nets (TPNs), to model real-time systems. We com...
Abstract. A language for representing timed automata is introduced. Its semantics i defined in terms...
In order to approximate discrete-event systems in which there exist considerable states and events, ...
This paper deals with the representation of continuous system dynamics into a timed discrete-event f...
Abstracting 'continuous' system behaviours into discrete-event representations (i.e., timed automata...
. Model checking is emerging as a practical tool for automated debugging of complex reactive systems...
Timed systems can be modeled as automata (or, generally, discrete transi-tion structures) extended w...
International audienceThis chapter surveys timed automata as a formalism for model checking real-tim...
This paper shows how to abstract networks of timed automata in order to accelerate the analysis of q...
. We investigate the relationship between timed c/e systems [4] and timed automata [2]. We provide a...
. The past decade has witnessed a rapid development in the field of formal methods for the specifica...
We argue that timed models are a suitable framework for the detection of behavior in real-world even...
. We propose timed (finite) automata to model the behavior of realtime systems over time. Our defini...
International audienceWe introduce timed automata and show how they can be used for the specificatio...
Model checking is a technique to automatically analyse systems that have been modeled in a formal la...
In this chapter we introduce a formalism, Time Petri Nets (TPNs), to model real-time systems. We com...
Abstract. A language for representing timed automata is introduced. Its semantics i defined in terms...
In order to approximate discrete-event systems in which there exist considerable states and events, ...