Hypervolume approximation in timed automata model checking

  • Authors:
  • Víctor Braberman;Jorge Lucángeli Obes;Alfredo Olivero;Fernando Schapachnik

  • Affiliations:
  • Departamento de Computación, FCEyN, Universidad de Buenos Aires, Buenos Aires, Argentina and CONICET;Departamento de Computación, FCEyN, Universidad de Buenos Aires, Buenos Aires, Argentina;Facultad de Ingeniería y Cs. Exactas, Universidad Argentina de la Empresa, Buenos Aires, Argentina;Departamento de Computación, FCEyN, Universidad de Buenos Aires, Buenos Aires, Argentina

  • Venue:
  • FORMATS'07 Proceedings of the 5th international conference on Formal modeling and analysis of timed systems
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

Difference Bound Matrices (DBMs) are the most commonly used data structure for model checking timed automata. Since long they are being used in successful tools like Kronos or UPPAAL. As DBMs represent convex polyhedra in an n-dimensional space, this paper explores the idea of using its hypervolume as the basis for two optimization techniques. One of them is very simple to implement. The other, an improvement over the first, requires more involved programming. Each of them saves verification time (up to 19% in our case studies), with a modest increase of memory requirements. Their impact differs among the different case studies but, as they can be combined, there is no need to choose a priori.