scholarly journals Stubborn Sets, Frozen Actions, and Fair Testing

2021 ◽  
Vol 178 (1-2) ◽  
pp. 139-172
Author(s):  
Antti Valmari ◽  
Walter Vogler

Many partial order methods use some special condition for ensuring that the analysis is not terminated prematurely. In the case of stubborn set methods for safety properties, implementation of the condition is usually based on recognizing the terminal strong components of the reduced state space and, if necessary, expanding the stubborn sets used in their roots. In an earlier study it was pointed out that if the system may execute a cycle consisting of only invisible actions and that cycle is concurrent with the rest of the system in a non-obvious way, then the method may be fooled to construct all states of the full parallel composition. This problem is solved in this study by a method that “freezes” the actions in the cycle. The new method also preserves fair testing equivalence, making it usable for the verification of many progress properties.

2021 ◽  
Vol 71 (1) ◽  
pp. 87-106
Author(s):  
Kutiš Vladimír ◽  
Paulech Juraj ◽  
Gálik Gálik ◽  
Murín Justín

Abstract The paper deals with the development of the finite element method (FEM) model of piezoelectric beam elements, where the piezoelectric layers are located on the outer surfaces of the beam core, which is made of functionally graded material. The created FEM model of piezoelectric beam structure is reduced using the modal truncation method, which is one of model order reduction (MOR) method. The results obtain from reduced state-space model are compared with results obtain from finite element model. MOR state-space model is also used in the design of the linear quadratic regulator (LQR). Created reduced state-space model with feedback with the LQR controller is analysed and compared with the results from FEM model.


2020 ◽  
Vol 179 (5-6) ◽  
pp. 1366-1402 ◽  
Author(s):  
Mickaël D. Chekroun ◽  
Alexis Tantet ◽  
Henk A. Dijkstra ◽  
J. David Neelin

2003 ◽  
Vol 10 (6) ◽  
pp. 477-491 ◽  
Author(s):  
X. Zang ◽  
P. Malanotte-Rizzoli

Abstract. The goal of this study is to compare the performances of the ensemble Kalman filter and a reduced-rank extended Kalman filter when applied to different dynamic regimes. Data assimilation experiments are performed using an eddy-resolving quasi-geostrophic model of the wind-driven ocean circulation. By changing eddy viscosity, this model exhibits two qualitatively distinct behaviors: strongly chaotic for the low viscosity case and quasi-periodic for the high viscosity case. In the reduced-rank extended Kalman filter algorithm, the model is linearized with respect to the time-mean from a long model run without assimilation, a reduced state space is obtained from a small number (100 for the low viscosity case and 20 for the high viscosity case) of leading empirical orthogonal functions (EOFs) derived from the long model run without assimilation. Corrections to the forecasts are only made in the reduced state space at the analysis time, and it is assumed that a steady state filter exists so that a faster filter algorithm is obtained. The ensemble Kalman filter is based on estimating the state-dependent forecast error statistics using Monte Carlo methods. The ensemble Kalman filter is computationally more expensive than the reduced-rank extended Kalman filter.The results show that for strongly nonlinear case, chaotic regime, about 32 ensemble members are sufficient to accurately describe the non-stationary, inhomogeneous, and anisotropic structure of the forecast error covariance and the performance of the reduced-rank extended Kalman filter is very similar to simple optimal interpolation and the ensemble Kalman filter greatly outperforms the reduced-rank extended Kalman filter. For the high viscosity case, both the reduced-rank extended Kalman filter and the ensemble Kalman filter are able to significantly reduce the analysis error and their performances are similar. For the high viscosity case, the model has three preferred regimes, each with distinct energy levels. Therefore, the probability density of the system has a multi-modal distribution and the error of the ensemble mean for the ensemble Kalman filter using larger ensembles can be larger than with smaller ensembles.


Author(s):  
Francois G. Meyer ◽  
Alexander M. Benison ◽  
Zachariah Smith ◽  
Daniel S. Barth
Keyword(s):  

1991 ◽  
Vol 23 (2) ◽  
pp. 355-372 ◽  
Author(s):  
S. Zachary

We consider a ‘reduced state space' approach to the analysis of blocking in stochastic loss networks. We show how this approach provides insight into the approximations currently used in large networks and enables improved approximations to be deduced. We further give some ‘heavy traffic' asymptotic results for the limiting scheme of Kelly (1986).


2010 ◽  
Vol 39 ◽  
pp. 689-743 ◽  
Author(s):  
E. Burns ◽  
S. Lemons ◽  
W. Ruml ◽  
R. Zhou

To harness modern multicore processors, it is imperative to develop parallel versions of fundamental algorithms. In this paper, we compare different approaches to parallel best-first search in a shared-memory setting. We present a new method, PBNF, that uses abstraction to partition the state space and to detect duplicate states without requiring frequent locking. PBNF allows speculative expansions when necessary to keep threads busy. We identify and fix potential livelock conditions in our approach, proving its correctness using temporal logic. Our approach is general, allowing it to extend easily to suboptimal and anytime heuristic search. In an empirical comparison on STRIPS planning, grid pathfinding, and sliding tile puzzle problems using 8-core machines, we show that A*, weighted A* and Anytime weighted A* implemented using PBNF yield faster search than improved versions of previous parallel search proposals.


Sign in / Sign up

Export Citation Format

Share Document