2026-07-26T23:12:16Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:5363 2024-03-06T10:36:33Z ddc:004 open_access

Unfolding-based Partial Order Reduction Rodríguez, César Sousa, Marcelo Sharma, Subodh Kroening, Daniel Partial order reduction unfoldings concurrency model checking 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. Schloss Dagstuhl – Leibniz-Zentrum für Informatik César Rodríguez and Marcelo Sousa and Subodh Sharma and Daniel Kroening 2015 Is Part Of LIPIcs, Volume 42, 26th International Conference on Concurrency Theory (CONCUR 2015) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.CONCUR.2015.456 urn:nbn:de:0030-drops-53637 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2015.456 eng https://creativecommons.org/licenses/by/3.0/legalcode