Time-Darts: A Data Structure for Verification of Closed Timed Automata

Symbolic data structures for model checking timed systems have been subject to a significant research, with Difference Bound Matrices (DBMs) still being the preferred data structure in several mature verification tools. In comparison, discretization offers an easy alternative, with all operations ha...

Celý popis

Podrobná bibliografia

Vydané v:	arXiv.org
Hlavní autori:	Jørgensen, Kenneth Y, Larsen, Kim G, Srba, Jiří
Médium:	Paper
Jazyk:	English
Vydavateľské údaje:	Ithaca Cornell University Library, arXiv.org 27.11.2012
Predmet:	Algorithms Clocks Complexity Data structures Discretization
ISSN:	2331-8422
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!