Automatic verification of finite-state concurrent systems using temporal logic specifications
ACM Transactions on Programming Languages and Systems (TOPLAS)
Handbook of theoretical computer science (vol. B)
Distributed LTL model-checking in SPIN
SPIN '01 Proceedings of the 8th international SPIN workshop on Model checking of software
Ten Years of Partial Order Reduction
CAV '98 Proceedings of the 10th International Conference on Computer Aided Verification
Distributing Timed Model Checking - How the Search Order Matters
CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
Modere: the model-checking engine of Rebeca
Proceedings of the 2006 ACM symposium on Applied computing
Modeling and Verification of Reactive Systems using Rebeca
Fundamenta Informaticae
Hi-index | 0.00 |
The major difficulty of model checking is state space explosion. Many approaches have been suggested to postpone such explosion to achieve model checking of superior models. Some of these approaches distribute states among grid nodes. Therefore state space size can be enlarged according to the number of grid nodes. Complexity of distributed model checking algorithm and lack of distributed reduction techniques are obstacles of these approaches. In this paper, we introduce semi-distributed model checking algorithm which is developed for actor based modelling languages with asynchronous message passing. Semi-distributed algorithm is a kind of centralized algorithm that stores light weight states in a central node. As a result, the central node can store larger state spaces. Experimental results show substantial improvement for semi-distributed algorithm decreases response time over the past results.