English) The present thesis focuses on distributed systems operating under probabilistic influences like faults. How well can such systems provide their service under the effects of faults? How well can they recover from faults? The present thesis introduces with limiting window availability a suitable measure to answer such questions, and presents a method for its computation. For the computat...

Abstract. The investigation of viable and objective hardware system complexity formulas is discussed in this paper. The definition of State Space Complexity and Communication Space Complexity are specified in terms of underlying hardware system metrics. This enables the quantification of the State Space Explosion problem. In addition, it enables the identification and subsequent quantification ...

First we establish explosion criteria for jump processes with an arbitrary locally compact separable metric state space. Then these results are applied to two stochastic coagulation–fragmentation models— the direct simulation model and the mass flow model. In the pure coagulation case, there is almost sure explosion in the mass flow model for arbitrary homogeneous coagulation kernels with expon...

The challenge this thesis addresses is to speed up the development of concurrent programs by increasing the efficiency with which concurrent programs can be tested and consequently evolved. The goal of this thesis is to generate methods and tools that help software engineers increase confidence in the correct operation of their programs. To achieve this goal, this thesis advocates testing of co...

Avoiding State-Space Explosion in Multithreaded Programs with Input-Covering Schedules and Symbolic Execution

Dependability models of complex distributed systems using Markovian techniques suffer from state space explosion. Several methods for controlling the state space explosion problem have been proposed in the literature. These largeness avoidance methods include state truncation, model composition, behavioral decomposition, time-scale decomposition and fixed-point iteration. In this paper we brief...

State space generation is often needed in the analysis of concurrent and distributed systems. The stubborn set method is one of the techniques that try to alleviate the state space explosion encountered in state space generation. An algorithm for nding a stubborn set having as few enabled transitions as possible is presented. Practicality of the algorithm is motivated with the aid of examples.

Explicit parallelism greatly complicates the program semantics, especially if concurrent activities are allowed to interact with each other through shared variables. Existing compiler analysis and optimization techniques for sequential programs must be carefully examined before they can be safely applied to parallel programs. In this paper, we present a general framework for analyzing programs ...

Interoperability testing aims at verifying the possibility for two or more components to communicate correctly while providing the foreseen services. In this paper, we describe a new method for generating interoperability test cases. This method is equivalent to classical methods in terms of non-interoperability detection. Contrary to classical approaches, this method avoids the well-known stat...

Ethernet networks are promising for the harmonization of the communication technologies in manufacturing automation but they have not been specifically intended for industrial control applications. Investigations have thus become necessary to evaluate their performance. Most analysis approaches use probabilistic models to validate the system’s behavior. However, if the deterministic behavior of...