An Improved Failures Equivalence for Finite-State Systems with a Reduction Algorithm
Proceedings of the IFIP WG6.1 International Symposium on Protocol Specification, Testing and Verification XI
The Influence of Software Module Systems on Modular Verification
Proceedings of the 9th International SPIN Workshop on Model Checking of Software
Compositional State Space Generation
Papers from the 12th International Conference on Applications and Theory of Petri Nets: Advances in Petri Nets 1993
Induction in Compositional Model Checking
CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
Distributed breadth-first search LTL model checking
Formal Methods in System Design
A work-efficient distributed algorithm for reachability analysis
Formal Methods in System Design
A distributed verification approach for modular Petri nets
Proceedings of the 2007 Summer Computer Simulation Conference
An Incremental and Modular Technique for Checking LTL\X Properties of Petri Nets
FORTE '07 Proceedings of the 27th IFIP WG 6.1 international conference on Formal Techniques for Networked and Distributed Systems
Towards a Standard for Modular Petri Nets: A Formalisation
PETRI NETS '09 Proceedings of the 30th International Conference on Applications and Theory of Petri Nets
Model checking safety properties in modular high-level nets
ICATPN'03 Proceedings of the 24th international conference on Applications and theory of Petri nets
Towards distributed verification of petri nets properties
VECoS'07 Proceedings of the First international conference on Verification and Evaluation of Computer and Communication Systems
| Hi-index | 0.00 |
This paper deals with the modular analysis of distributed concurrent systems modelled by Petri nets. The main analysis techniques of such systems suffer from the well-known problem of the combinatory explosion of state space. In order to cope with this problem, we use a modular representation of the state space instead of the ordinary one. The modular representation, namely modular state space, is much smaller than the ordinary state space. We propose to distribute the modular state space on every machine associated with one module. We enhance the modularity of the verification of some local properties of any module by limiting it to the exploration of local and some global information. Once the construction of the distributed state space is performed, there is no communication between modules during the verification.