Performance/dependability evaluation via modeling results in fast and economic system development. Traditionally, simulations have been used to evaluate realistic systems but do not yield exact results. Analytic solution methods can yield exact results, but can su er from the state-space explosion problem. A reduced base model construction technique for stochastic activity networks, which explo...

The stubborn set method is one of the methods that try to relieve the state space explosion problem that occurs in state space generation. This paper is concentrated on the veriication of nexttime-less LTL (linear time temporal logic) formulas with the aid of the stubborn set method. The contribution of the paper is a theorem that gives us a way to utilize the structure of the formula when the ...

Electronically executed business processes are frequently implemented using the Business Process Execution Language (BPEL). These workflows may be in control of crucial business processes of an organization, in the same time existing model checking approaches are still immature i.e. they either seem to loose to much information during the generation of the analysis model, or the state space exp...

State space-based simulation method of general stochastic continuous-time models suffers from its sensitivity to state space-explosion. In this paper, we address this problem by the introduction of variable time steps for the proxel-based simulation method. We show how the complexity of the simulation is reduced by expressing rare event probability using fewer computational units. It is shown b...

Model checking suffers from the state space explosion problem. One method to alleviate this problem is to exploit symmetries in the system, such that duplicate symmetric components of the state space are not explored – saving time during the checking process. This paper identifies symmetries in typical structures of the formal language of B, including relations, powersets and elements of sets, ...

In this paper we present a new algorithm to counteract state explosion when using Explicit State Space Exploration to verify protocollike systems. We sketch the implementation of our algorithm within the Caching Murφ verifier and give experimental results showing its effectiveness. We show experimentally that, when memory is a scarce resource, our algorithm improves on the time performances of ...

For synthesising efficient asynchronous circuits one has to deal with the state space explosion problem. In this paper, we present a combined approach to alleviate it, based on using Petri net unfoldings and decomposition. The experimental results show significant improvement in terms of runtime compared with other existing methods.

Partial-order reduction is a well-known technique to cope with the state-space-explosion problem in the verification of concurrent systems. Using the hierarchical structure of concurrent systems, we present an enhancement of the partial-order-reduction scheme of [12, 19]. A prototype of the new algorithm has been implemented on top of the verification tool SPIN. The first experimental results a...

This paper presents an analytical approach for the analysis of non-Markovian stochastic Petri nets. The primary aim of the presented solution method is its universal applicability. Therefore, an approach based on discrete phase type distributions has been chosen to perform the necessary Markovization. For the handling of the resulting state space explosion problem, symbolic storage structures, ...

Reachability analysis is a powerful formal method for analysis of concurrent and distributed nite state systems. It suuers from the state space explosion problem, however, i.e. the state space of a system can be far too large to be completely generated. This thesis is concentrated on the application and theory of the stubborn set method which is one of the methods that try to relieve the state ...