Revisiting Resistance Speeds Up I/O-Efficient LTL Model Checking


Share/Save/Bookmark

Barnat, J. and Brim, L. and Šimeček, P. and Weber, M. (2008) Revisiting Resistance Speeds Up I/O-Efficient LTL Model Checking. In: 14th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, TACAS 2008, 29 Mar - 06 Apr 2008, Budapest, Hungary (pp. pp. 48-62).

[img] PDF
Restricted to UT campus only
: Request a copy
154kB
Abstract:Revisiting resistant graph algorithms are those that can tolerate
re-exploration of edges without yielding incorrect results.
Revisiting resistant I/O efficient graph algorithms exhibit
considerable speed-up in practice in comparison to non-revisiting
resistant algorithms. In the paper we present a new revisiting
resistant I/O efficient LTL model checking algorithm. We analyze
its theoretical I/O complexity and we experimentally compare its
performance to already existing I/O efficient LTL model checking
algorithms.

Item Type:Conference or Workshop Item
Faculty:
Electrical Engineering, Mathematics and Computer Science (EEMCS)
Research Group:
Link to this item:http://purl.utwente.nl/publications/62369
Official URL:http://dx.doi.org/10.1007/978-3-540-78800-3_5
Export this item as:BibTeX
EndNote
HTML Citation
Reference Manager

 

Repository Staff Only: item control page

Metis ID: 251039