Dealing with practical limitations of distributed timed model checking for timed automata
Two base algorithms are known for reachability verification over timed automata. They are called forward and backwards, and traverse the automata edges using either successors or predecessors. Both usually work with a data structure called Difference Bound Matrices (DBMs). Although forward is better...
Guardado en:
| Autores principales: | Braberman, V., Olivero, A., Schapachnik, F. |
|---|---|
| Formato: | JOUR |
| Materias: | |
| Acceso en línea: | http://hdl.handle.net/20.500.12110/paper_09259856_v29_n2_p197_Braberman |
| Aporte de: |
Ejemplares similares
-
Dealing with practical limitations of distributed timed model checking for timed automata
por: Braberman, Víctor Adrián, et al.
Publicado: (2006) -
On-the-fly workload prediction and redistribution in the distributed timed model checker zeus
por: Braberman, V., et al.
Publicado: (2005) -
On-the-fly workload prediction and redistribution in the distributed timed model checker zeus
por: Braberman, V., et al. -
On-the-fly workload prediction and redistribution in the distributed timed model checker zeus
por: Braberman, V., et al.
Publicado: (2005) -
On-the-fly workload prediction and redistribution in the distributed timed model checker zeus
por: Braberman, Víctor Adrián, et al.
Publicado: (2005)