A Web services are proliferated because of its massive support and uses in the industries and research areas. Usages of the web services are unavoidable in the software industry for its reusability and interoperability. For more reusability, web services are integrated together to form the composition. Hence the compositions of web services are widely done and getting benefit from it. Various m...

The state space explosion problem in model checking remains the chief obstacle to the practical verification of real-world distributed systems. We attempt to address this problem in the context of verifying concurrent (message-passing) C programs against safety specifications. More specifically, we present a fully automated compositional framework which combines two orthogonal abstraction techn...

ABSTRACT In the development of high-assurance systems, formal modeling, analysis and verification techniques are playing an increasingly important role. In spite of significant advances, formal modeling and verification still suffers from limited applicability due to exponential runtime space growth exibited by model checkers. In this paper, we describe an alternative to model checking. We desc...

Model checking is a powerful and widespread technique for the verification of finite distributed systems. However, the main hindrance for wider application of this technique is the well-known state explosion problem. During the last two decades, numerous techniques have been proposed to cope with the state explosion problem in order to get a manageable state space. Among them, on-the-fly modelc...

In this paper, we present a comprehensive survey of various approaches for the verification of cache coherence protocols based on state enumeration, (symbolic) model checking and symbolic state models. Since these techniques search the state space of the protocol exhaustively, the amount of memory required to manipulate the state information and the verification time grow very fast with the num...

Abstraction is one of the most important strategies for dealing with the state space explosion problem in model checking. In the abstract model, although the state space is largely reduced, however, a counterexample found in such a model may not be a real counterexample. And the abstract model needs to be further refined where an NP-hard state separation problem is often involved. In this paper...

Concurrent systems with many replicated components often exhibit a lot of symmetries. When using model checking to verify such systems, this leads to a redundant search over equivalent parts of the state-space. Verification can even be intractable for concurrent systems due to the state-space explosion problem which model checking suffers from. Considerable memory savings can be achieved by usi...

High-level Petri nets make models more concise and readable as compared to low-level Petri nets. However, usual verification techniques such as state space analysis remain an open challenge for both because of state space explosion. The contribution of this paper is to propose an approach for property based reduction of the state space of Algebraic Petri nets (a variant of high-level Petri nets...

The complete exploration of large system states modeled with Petri net (PN) systems demonstrates state space explosion, limiting reachability analysis. The calculation of the number of states (samples) necessary to conduct a statistical hypothesis test for reachability problems of PN systems is discussed in this paper. The calculation is based on the estimation of the size of the state space. T...

State space explosion is a significant obstacle in the formal verification of properties on distributed programs. Much effort has been directed in the area of state space reduction for model checking distributed programs. Such research efforts mainly employ one of two techniques: (a) construction of a reduced explicit state space, or (b) a compact representation of the state space. In this pape...