prod is a reachability analyzer for Predicate/Transition Nets. The tool incorporates several advanced reduced reachability graph generation methods. The tool also includes a CTL model checker and supports on-they veriication of LTL formulas. prod is being used in industrial projects at the Digital Systems Laboratory. 1 Intro Reachability analysis is a powerful formal way to analyze concurrent a...

The applicability of model checking is hindered by the state space explosion problem in combination with limited amounts of main memory. To extend its reach, the large available capacities of secondary storage such as hard disks can be exploited. Due to the specific performance characteristics of secondary storage technologies, specialised algorithms are required. In this paper, we present a te...

State space partitioning-based approaches have been proposed in the literature to address the state-space explosion problem in model checking. These approaches, whether sequential or distributed, perform a large amount of work in the form of inter-partition (cross-over) image computations, which can be expensive. We present a model checking algorithm that aggregates these expensive cross-over i...

Analysis and synthesis of concurrent systems suffers from combinatorial state space explosion. That is, even a relatively small system specification can (and often does) yield a very large state space. One of the prominent techniques for alleviating this problem is based on complete prefixes of Petri net unfoldings. It relies on the partial order view of concurrent computation, and represents s...

This paper addresses the state explosion problem in automata based LTL model checking. To deal with large space requirements we turn to use a distributed approach. All the known methods for automata based model checking are based on depth first traversal of the state space which is difficult to parallelise as the ordering in which vertices are visited plays an important role. We come up with en...

Verifications of parallel programs are frequently based on automated state-space exploration techniques known as model checking. To avoid state-space explosion problems, theorem proving techniques can be used, for example by manually annotating programs with suitable assertions and using these assertions to prove their correctness (e.g. using the Owicki/Gries theory). We propose a method to sup...

Accurate analysis of reliability of system requires that it accounts for all major variations in system's operation. Most reliability analyses assume that the system configuration, success criteria, and component behavior remain the same. However, multiple phases are natural. We present a new computationally efficient technique for analysis of phased-mission systems where the operational states...

Accurate analysis of reliability of system requires that it accounts for all major variations in system's operation. Most reliability analyses assume that the system con guration, success criteria, and component behavior remain the same. However, multiple phases are natural. We present a new computationally e cient technique for analysis of phased-mission systems where the operational states of...

All model checkers suffer from the state space explosion. The distribution of the task among several machines is a technique which adresses this problem. The key issue of a distributed checker are the rules for assigning the states to the participating machines. The task of the checker is to visit all states of the system, which usually arise from the composition of smaller systems. This paper ...

Stochastic models of biological networks are well established in systems biology, where the computational treatment of such models is often focused on the solution of the so-called chemical master equation via stochastic simulation algorithms. In contrast to this, the development of storage-efficient model representations that are directly suitable for computer implementation has received signi...