Hypervolume approximation in timed automata model checking
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...
Guardado en:
Autores principales: | Braberman, V., Obes, J.L., Olivero, A., Schapachnik, F. |
---|---|
Formato: | SER |
Materias: | |
Acceso en línea: | http://hdl.handle.net/20.500.12110/paper_03029743_v4763LNCS_n_p69_Braberman |
Aporte de: |
Ejemplares similares
-
Hypervolume approximation in timed automata model checking
por: Braberman, Víctor Adrián, et al.
Publicado: (2007) -
Issues in distributed timed model checking
por: Braberman, V., et al. -
Dealing with practical limitations of distributed timed model checking for timed automata
por: Braberman, V., et al. -
Issues in distributed timed model checking
por: Braberman, Víctor Adrián, et al.
Publicado: (2005) -
Dealing with practical limitations of distributed timed model checking for timed automata
por: Braberman, Víctor Adrián, et al.
Publicado: (2006)