E cient automatic model{checking algorithms for real-time systems have been obtained in recent years based on the state{region graph technique of Alur, Courcoubetis and Dill. However, these algorithms are faced with two potential types of explosion arising from parallel composition: explosion in the space of control nodes, and explosion in the region space over clock-variables. This paper repor...

Ideally, a model checking tool should be able to successfully tackle state space explosion for complete validation of the system, while providing short counterexamples in case an error exists. Techniques such as partial order (p.o.) reduction [1, 2] are very effective at tackling state space explosion, but do not concern themselves with the production of short counterexamples. On the other hand...

State explosion is well-known to be the principle limitation in protocol verification. In this paper, we propose a verification technique called leaping reachability analysis (LRA) to tackle state explosion. We advocate LRA as a uniform and property-driven relief strategy for verifying general progress properties of protocols modeled as networks of communicating finite state machines (CFSMs). U...

| Static analysis of concurrent programs has been hindered by the well known state explosion problem. Although many diierent techniques have been proposed to combat this state explosion, there is little empirical data comparing the performance of the methods. This information is essential for assessing the practical value of a technique and for choosing the best method for a particular problem....

A major obstacle in applying nite-state model checking to the veriication of large systems is the com-binatorial explosion of the state space arising when many loosely coupled parallel processes are considered. The problem also known as the state-explosion problem has been attacked from various sides. This paper presents a new approach based on partial model checking: Parts of the concurrent sy...

State explosion is a well-known problem that impedes analysis and testing based on state-space exploration. This problem is particularly serious in real-time systems because unbounded time values cause the state space to be infinite even for simple systems. In this paper, we present an algorithm that produces a compact representation of the reachable state space of a real-time system. The algor...

State explosion is a well-known problem that impedes analysis and testing based on state-space exploration. This problem is particularly serious in real-time systems because unbounded time values cause the state space to be innnite over for simple systems. In this paper, we present an algorithm that produces a compact representation of the reachable state space of a real-time system. The algori...

State space explosion is a major problem in both qualitative and quantitative model checking. This article focuses on using beam search, a heuristic search algorithm, for pruning weighted state spaces while generating. The original beam search is adapted to the state space generation setting and two new variants, motivated by practical case studies, are devised. These beam searches have been im...

Title: Fighting the state explosion problem in component protocols Author: Viliam Holub email: [email protected] phone: +420 2 2191 4235 Department: Department of Software Engineering Faculty of Mathematics and Physics Charles University in Prague, Czech Republic Advisor: Prof. Ing. Frantǐsek Plášil, DrSc. email: [email protected] phone: +420 2 2191 4266 Mailing address (both Author ...

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