Ltl Model Checking with I/o-efficient Accepting Cycle Detection Ltl Model Checking with I/o-efficient Accepting Cycle Detection
نویسندگان
چکیده
We show how to adopt existing non-DFS-based algorithm OWCTY [ČP03] for accepting cycle detection to the I/O efficient setting and compare the I/O efficiency and practical performance of the adopted algorithm to the existing I/O efficient LTL model checking approach of Edelkamp et al. [EJ06]. We show that while the new algorithm exhibits similar I/O complexity with respect to the size of the graph, it avoids the quadratic increase in the size of the graph of the approach of Edelkamp et al. Therefore, the absolute numbers of I/O operations are significantly smaller and the algorithm exhibits better practical performance.
منابع مشابه
I/O Efficient Accepting Cycle Detection
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...
متن کاملDiVinE-CUDA - A Tool for GPU Accelerated LTL Model Checking
In this paper we present a tool that performs CUDA accelerated LTL Model Checking. The tool exploits parallel algorithm MAP adjusted to the NVIDIA CUDA architecture in order to efficiently detect the presence of accepting cycles in a directed graph. Accepting cycle detection is the core algorithmic procedure in automata-based LTL Model Checking. We demonstrate that the tool outperforms non-acce...
متن کاملPdmc ’ 05
Enumerative distributed reachability analysis based on a simple partitioning of the state space has become a well known technique implemented in numerous model checking tools. The timed automata model checker UPPAAL is no exception to this rule, and for over 5 years a distributed version of UPPAAL has been used to analyse large timed automata models. In this talk we address two fundamental issu...
متن کاملHow to Order Vertices for Distributed LTL Model-Checking Based on Accepting Predecessors
Distributed automata-based LTL model-checking relies on algorithms for finding accepting cycles in a Büchi automaton. The approach to distributed accepting cycle detection as presented in [9] is based on maximal accepting predecessors. The ordering of accepting states (hence the maximality) is one of the main factors affecting the overall complexity of model-checking as an imperfect ordering ca...
متن کاملSemi-external LTL Model Checking
In this paper we establish c-bit semi-external graph algorithms, – i.e., algorithms which need only a constant number c of bits per vertex in the internal memory. In this setting, we obtain new trade-offs between time and space for I/O efficient LTL model checking. First, we design a c-bit semi-external algorithm for depth-first search. To achieve a low internal memory consumption, we construct...
متن کامل