Souad Guellati

Learn More
The increasing complexity of software is incessant, this phenomenon is even more accentuated when temporal aspects are introduced, hence the need for rigorous verification methods. The main purpose of this paper is to propose a quantitative verification approach based on model checking. Their properties are expressed in TCTL (Timed Computation Tree Logic)(More)
– Timed automata with durational actions (daTA) are a form of timed automata that admit a more natural representation of durational actions and capturing true concurrency, with those additional benefits the kinds of properties to be verified on real-time systems will be enlarged. We present a novel approach to construct a region graph, based on the(More)
Timed automata are widely used to model real-time systems. In this paper we are concerned by durational actions timed automata (daTA) which is a timed automata handling action durations and true concurrency. Our aim is to compute efficiently the state space of (daTA) in order to verify quantitative timing requirements and preserve the true concurrency(More)
  • 1