Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
10328882 | Electronic Notes in Theoretical Computer Science | 2005 | 12 Pages |
Abstract
State space explosion is a fundamental obstacle in formal verification of concurrent systems. Several techniques for combating this problem have emerged in the past few years, among which the two we are interested in are: partial order reduction and distributed memory state exploration. While the first one tries to reduce the problem to a smaller one, the other one tries to extend the computational power to solve the same problem. In this paper, we consider a combination of these two approaches and propose a distributed memory algorithm for partial order reduction.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
L. Brim, I. Äerná, P. Moravec, J. Å imÅ¡a,