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...

where the matrix M ∈ RN×N is assumed to be invertible. Models of mechanical systems are often of this type since (1.1) then represents the equation of motion of the system. For such a system M = MT , C = CT and K = KT are respectively the mass, damping and stiffness matrices, f(t) ∈ RN×1 is the vector of external forces, and x(t) ∈ RN×1 is the vector of internal generalized coordinates (see [4]...

Krylov subspace methods have become very popular, not only for solving large scale linear systems, but also in the area of model order reduction. It is also well known that the performance of iterative solution techniques depends crucially on the choice of preconditioning matrix. Within the area of model order reduction, the concept of preconditioning has not yet been introduced. However, recen...

Analysis of effects due to parasitics is of vital importance during the design of large-scale integrated circuits, since it gives insight into how circuit performance is affected by undesired parasitic effects. Due to the increasing amount of interconnect and metal layers, parasitic extraction and simulation may become very time consuming or even unfeasible. Developments are presented, for redu...

Verifying that a concurrent program satisfies a given property, such as deadlock-freeness, is computationally difficult. Naive exploration techniques are facing the state space explosion problem: they consider an exponential number of interleavings of parallel threads (relative to the program size). Partial order reduction is a standard method to address this difficulty. It is based on the obse...

We present recent advances in the mixed symbolic and numeric model reduction techniques for automatically extracting the dominant system behavior of multiphysical systems. A unique feature of our approach is to compute approximated symbolic formulas for linear and nonlinear system characteristics, rigorously reducing the complexity of symbolic expressions while controlling a user-given error bo...

In this survey, we provide an overview of model order reduction (MOR) methods applied to coupled systems. The coupling can be linear or nonlinear, weak or strong. Physically, the coupling may come from structurestructure coupling, fluid-structure or fluid-fluid interaction, electro-thermal coupling, electroor thermal-mechanical coupling, or circuit-device coupling. Different MOR methods for cou...

We present a partial-order reduction technique for local model checking of hierarchical networks of labeled transition systems in the weak modal mu-calculus. We have implemented our technique in the Concur-rency Factory speciication and veriication environment; experimental results show that partial-order reduction can be highly eeective in combating state explosion in modal mu-calculus model c...

Software systems assembled from a large number of autonomous components become an interesting target for formal verification due to the issue of correct interplay in component interaction. State/event LTL [6, 5] incorporates both states and events to express important properties of component-based software systems. The main contribution of the paper is a partial order reduction technique for ve...

Partial order reduction helps improve the performance of a (sequential) model-checker by eliminating the interleaving of independent actions. In this paper, we show how to combine partial order reduction and parallel distributed model-checking. We point out that an appropriate partial order reduction algorithm is to be chosen to avoid sequentializing an otherwise parallelizable activity. We pro...