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...

Full description

Bibliographic Details

Published in:	arXiv.org
Main Authors:	Jørgensen, Kenneth Y, Larsen, Kim G, Srba, Jiří
Format:	Paper
Language:	English
Published:	Ithaca Cornell University Library, arXiv.org 27.11.2012
Subjects:	Algorithms Clocks Complexity Data structures Discretization
ISSN:	2331-8422
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!