Abstract
We show how to adapt an existing non-DFS-based accepting cycle detection algorithm OWCTY [10,15,29] to the I/O efficient setting and compare its I/O efficiency and practical performance to the existing I/O efficient LTL model checking approach of Edelkamp and Jabbar [14]. The new algorithm exhibits similar I/O complexity with respect to the size of the graph while it avoids quadratic increase in the size of the graph. Therefore, the number of I/O operations performed is significantly lower and the algorithm exhibits better practical performance. © Springer-Verlag Berlin Heidelberg 2007.
Cite
CITATION STYLE
Barnat, J., Brim, L., & Šimeček, P. (2007). I/O efficient accepting cycle detection. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4590 LNCS, pp. 281–293). Springer Verlag. https://doi.org/10.1007/978-3-540-73368-3_32
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
