文章基本信息

标题：Unfolding-based Partial Order Reduction
本地全文：下载
作者：C{\'e}sar Rodr{\'i}guez ; Marcelo Sousa ; Subodh Sharma 等
期刊名称：LIPIcs : Leibniz International Proceedings in Informatics
电子版ISSN：1868-8969
出版年度：2015
卷号：42
页码：456-469
DOI：10.4230/LIPIcs.CONCUR.2015.456
出版社：Schloss Dagstuhl -- Leibniz-Zentrum fuer Informatik
摘要：Partial order reduction (POR) and net unfoldings are two alternative methods to tackle state-space explosion caused by concurrency. In this paper, we propose the combination of both approaches in an effort to combine their strengths. We first define, for an abstract execution model, unfolding semantics parameterized over an arbitrary independence relation. Based on it, our main contribution is a novel stateless POR algorithm that explores at most one execution per Mazurkiewicz trace, and in general, can explore exponentially fewer, thus achieving a form of super-optimality. Furthermore, our unfolding-based POR copes with non-terminating executions and incorporates state caching. On benchmarks with busy-waits, among others, our experiments show a dramatic reduction in the number of executions when compared to a state-of-the-art DPOR.
关键词：Partial order reduction; unfoldings; concurrency; model checking