Other formats:
BibTeX
LaTeX
RIS
@inproceedings{913444, author = {Barnat, Jiří and Brim, Luboš and Ročkai, Petr}, address = {Los Alamos}, booktitle = {Software Engineering and Formal Methods (SEFM 2010)}, keywords = {LTL Model Checking; Partial Order Reduction; Parallel and Distributed Processing; DiVinE}, howpublished = {tištěná verze "print"}, language = {eng}, location = {Los Alamos}, isbn = {978-0-7695-4153-2}, pages = {222-231}, publisher = {IEEE Computer Society Press}, title = {Parallel Partial Order Reduction with Topological Sort Proviso}, year = {2010} }
TY - JOUR ID - 913444 AU - Barnat, Jiří - Brim, Luboš - Ročkai, Petr PY - 2010 TI - Parallel Partial Order Reduction with Topological Sort Proviso PB - IEEE Computer Society Press CY - Los Alamos SN - 9780769541532 KW - LTL Model Checking KW - Partial Order Reduction KW - Parallel and Distributed Processing KW - DiVinE N2 - Partial order reduction and distributed-memory processing are the two essential techniques to fight the wellknown state space explosion problem in explicit state model checking. Unfortunately, these two techniques have not been integrated yet to a satisfactory degree. The main source of difficulties is the cycle proviso that requires one fully expanded state on every cycle in the reduced state space graph. In this paper we suggest a new technique that guarantees correct construction of the reduced state space graph w.r.t. the cycle proviso. Our new technique is fully compatible with the parallel graph traversal procedure while at the same time it provides competitive reduction of the state space if compared to the serial case. The new technique has been implemented within the parallel and distributed-memory LTL model checker DIVINE and its performance is reported in this paper. ER -
BARNAT, Jiří, Luboš BRIM and Petr ROČKAI. Parallel Partial Order Reduction with Topological Sort Proviso. In \textit{Software Engineering and Formal Methods (SEFM 2010)}. Los Alamos: IEEE Computer Society Press, 2010, p.~222-231. ISBN~978-0-7695-4153-2.
|